Bibliographic Details
| Title: |
Elimination of redundant messages with a two-pass static analysis algorithm |
| Authors: |
Girault, Alain1 Alain.Girault@inrialpes.fr |
| Source: |
Parallel Computing. Mar2002, Vol. 28 Issue 3, p433. 21p. |
| Subjects: |
Computer software |
| Abstract: |
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 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 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. [Copyright &y& Elsevier] |
|
Copyright of Parallel Computing is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
