Eliminating redundant messages in distributed programs leads to the reduction of communication overheads, and thus to the improvement of the overall performances of the distributed program. Therefore, a lot of work ha...
详细信息
Eliminating redundant messages in distributed programs leads to the reduction of communication overheads, and thus to the improvement of the overall performances of the distributed 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 parallelprograms 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 automaton with a DAG of actions in each state. Our algorithm proceeds in two passes: First a global data-flow analysis which computes, for each state of the automaton, the set of distant variables that are known at the beginning of the state. Then a local elimination which removes redundant messages locally in each state of the automaton. We present the algorithms as well as the corresponding time and memory costs. (C) 2002 Elsevier Science B.V, All rights reserved.
暂无评论