Name
Abstract | ||
|---|---|---|
This paper develops and proves an exact distributed invalidation algorithm for programs with compile time decidable control-flow.
We present an efficient constructive algorithm that globally combines locally gathered information to insert coherence calls
in such a manner that eliminates all invalidation traffic without loss of locality and places the minimal number of coherence
calls. Experimental results show that it outperforms existing compiler directed coherence techniques and hardware based memory
consistency.
|
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44520-X_51 | European Conference on Parallel Processing |
Keywords | Field | DocType |
time decidable control-flow,invalidation algorithm,coherence technique,hardware basedme mory consistency,invalidation traffic,efficient constructive algorithm,minimal number,coherence call,control flow | Locality,Shared memory,Compile time,Computer science,Parallel computing,Distributed memory,Compiler,Coherence (physics),Distributed algorithm,Cache coherence,Distributed computing | Conference |
Volume | ISSN | ISBN |
1900 | 0302-9743 | 3-540-67956-1 |
Citations | PageRank | References |
2 | 0.39 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rupert W. Ford | 1 | 84 | 9.57 |
| Michael F. P. O'Boyle | 2 | 1101 | 65.55 |
| Elena Stöhr | 3 | 64 | 9.52 |