Name
Abstract | ||
|---|---|---|
. This paper describes a new compiler algorithm to reduce thenumber of barrier synchronisations in parallelised programs. A preliminarytechnique to rapidly determine critical data dependences is developed.This forms the basis of the Fast First Sink (FFS) algorithm whichplaces, provably, the minimal number of barriers in polynomial time forcodes with a regular structure. This algorithm is implemented in a prototypecompiler and applied to three well known benchmarks. Preliminary... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0031650 | HPCN Europe |
Keywords | Field | DocType |
barrier synchronisation optimisation,polynomial time | Synchronization,Computer science,Parallel computing,Compiler,Basic block,Data dependence,Time complexity | Conference |
Volume | ISSN | ISBN |
1225 | 0302-9743 | 3-540-62898-3 |
Citations | PageRank | References |
2 | 0.42 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Stöhr | 1 | 64 | 9.52 |
| Michael F. P. O'Boyle | 2 | 1101 | 65.55 |