Elimination of redundant messages with a Two-pass static analysis algorithm

摘要

Eliminating redundant messages in distributed programs leads to the reduction of commu- nication overheads, and thus to the improvement of the overall performances of the distrib- uted program. Therefore, a lot of work has been done recently to achieve this goal. In this Paper, we present an algorithm for eliminating redundant messages in parallel programs that Have been distributed automatically. This algorithm works on program whose control flow is as General as possible, i.e., contains gotos. Precisely, the control flow is a finite deterministic au- Tomaton with a DAG of actions in each state.