Name
Abstract | ||
|---|---|---|
This paper describes a new compiler algorithm to reduce the number of barrier synchronisations in parallelised programs. A preliminary technique to rapidly determine critical data dependences is developed. This forms the basis of the First Fast Sink (FFS) algorithm which places, provably, the minimal number of barriers in polynomial time for codes with a regular structure. This algorithm is implemented in a prototype compiler and applied to three well known benchmarks. Preliminary results show that it outperforms an existing state-of-the-art commercial compiler. Copyright (C) 1998 Elsevier Science B.V. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0167-739X(97)00040-X | Future Generation Comp. Syst. |
Keywords | Field | DocType |
polynomial time | Graph algorithms,Computer science,Parallel computing,Algorithm,Compiler,Time complexity,Sink (computing),Distributed computing | Journal |
Volume | Issue | ISSN |
13 | 4-5 | 0167-739X |
Citations | PageRank | References |
1 | 0.36 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Stöhr | 1 | 64 | 9.52 |
| Michael F. P. O'Boyle | 2 | 1101 | 65.55 |