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 gatheredin formation 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 basedme mory consistency.
CITATION STYLE
Ford, R. W., O’Boyle, M. F. P., & Stöhr, E. A. (2000). Exact distributed invalidation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 395–404). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_51
Mendeley helps you to discover research relevant for your work.