Distributed Shared Memory (DSM) systems typically sup- port one consistency protocol [3,5,6]. However, recent work [1,11,12,14,17] proposes the use of adaptive consistency based on a heuristical analy- sis of recent access patterns. Although heuristic-based approaches can significantly improve runtime, the access pattern alone does not nec- essarily define the most appropriate consistency protocol. The size of updates and other factors related to the computing environment, such as heavily loaded links, heavily loaded nodes, bursty traffic patterns, and network latency all affect performance. Multiple access patterns within the application also make it diffcult to select the most appropriate con- sistency protocol. This paper presents a measurement-based approach to the problem of selecting the most appropriate consistency protocol for the current application in the current runtime environment. We show that measurement-based analysis provides an accurate estimate of per- formance and therefore can be used to select the most appropriate con- sistency protocol, even in cases where hueristic-based approaches fail to select the appropriate protocol.
|Title of host publication||Languages, Compilers, and Run-Time Systems for Scalable Computers - 5th International Workshop, LCR 2000, Selected Papers|
|Number of pages||12|
|State||Published - 2000|
|Event||5th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, LCR 2000 - Rochester, United States|
Duration: May 25 2000 → May 27 2000
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||5th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, LCR 2000|
|Period||5/25/00 → 5/27/00|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)