MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Efficiently Adapting to Sharing Patterns in Software DSMs (1998) [35 citations — 8 self]

Download:
pdf | ps
by Luiz Rodolpho Monnerat, Ricardo Bianchini
In Proceedings of the 4 th International Symposium on High Performance Computer Architecture
http://www.cs.rutgers.edu/~ricardob/papers/hpca98.ps.gz
Add To MetaCart

Abstract:

In this paper we introduce a page-based Lazy Release Consistency protocol called ADSM that constantly and efficiently adapts to the applications ' sharing patterns. Adaptation in ADSM is based on our dynamic categorization of the type of sharing experienced by each page. Pages can be categorized as falsely-shared, migratory, or producer /consumer(s). Migratory and producer/consumer(s) pages are managed in single-writer mode, while falselyshared data are managed in multiple-writer mode. Coherence is kept with invalidations for most types of the shared data, but updates are used for lock-protected data in migratory state and barrier-protected data in producer /consumer(s) state. We performed experiments with 6 parallel applications on an 8-node SP2 system, comparing our protocol against standard TreadMarks and a version of TreadMarks that also adapts to sharing patterns. Our results show that ADSM consistently outperforms its competitors; our protocol can improve the TreadMarks speedups by as much as 155%, while surpassing the performance of the adaptive TreadMarks implementation by as much as 67%. Our main conclusions are that our categorization and adaptation strategies are useful techniques for improving the performance of page-based software DSMs, while ADSM is a highly-efficient option for low-cost parallel computing. 1

Citations

705 SPLASH: Stanford Parallel Applications for Shared Memory – Singh, Weber, et al. - 1992
531 Implementation and performance of Munin – Carter, Bennet, et al. - 1991
477 Treadmarks: Distributed shared memory on standard workstations and operating systems – Keleher, Cox, et al. - 1994
422 Lazy Release Consistency for Software Distributed Shared Memory – Keleher, Cox, et al. - 1992
361 W.A.Sawdon, The Midway Distributed Shared Memory System – Bershad - 1993
133 Scope consistency: A bridge between release consistency and entry consistency – Iftode, Singh, et al. - 1996
114 Adaptive cache coherency for detecting migratory shared data – Cox, Fowler - 1993
112 An adaptive cache coherence protocol optimized for migratory sharing – Stenstrom, Brorsson, et al. - 1993
105 A unified formalization of four shared-memory models – Adve, Aggarwal - 1993
99 The Relative Importance of Concurrent Writers and Weak Consistency Models – Keleher - 1996
93 et al. The NAS Parallel Benchmarks – Bailey - 1991
78 An Integrated Compile-Time/Run-Time Software Distributed Shared Memory System – Dwarkadas, Cox, et al. - 1996
57 Software DSM protocols that adapt between single writer and multiple writer – Amza, Cox, et al. - 1997
53 Brazos: A third generation DSM system – Speight, Bennett - 1997
32 Tradeoffs Between False Sharing and Aggregation in Software Distributed Shared Memory – Amza, Cox, et al. - 1997
15 The Affinity Entry Consistency Protocol – Seidel, Bianchini, et al. - 1997
14 Reducing the Write Traffic for a Hybrid Cache Protocol – Dahlgren, Stenstrom - 1994
13 The impact of speeding up critical sections with data prefetching and forwarding – Trancoso, Torrellas - 1996
11 Effectiveness of Dynamic Prefetching in Multiple-Writer Distributed Virtual Shared Memory Systems – Karlsson, Stenstrom - 1997
5 Adaptive Migratory Scheme for Distributed Shared Memory – Kim, Vaidya - 1996
4 Fault Behavior and Prefetching in Software DSMs – Page - 1997
4 Exploitation of Parallelism in Seismic Migration – Figueiredo - 1995
View or Download | Add to My Collection | Correct Errors