Dynamically controlling false sharing in distributed shared memory
- Univ. of Arizona, Tucson, AZ (United States)
Distributed shared memory (DSM) alleviates the need to program message passing explicitly on a distributed-memory machine. In order to reduce memory latency, a DSM replicates copies of data. This paper examines several current approaches to controlling thrashing caused by false sharing in a DSM. Then it introduces a novel memory consistency protocol, writer-owns, which detects and eliminates false sharing at run time. In iterative computations, where the data is accessed similarly every iteration, the writer-owns protocol can have tremendous benefits because the overhead of eliminating false sharing is only incurred once. Performance results show that the writer-owns protocol is competitive with and often better than existing approaches.
- OSTI ID:
- 421383
- Report Number(s):
- CONF-960835-; CNN: Grant CCR-9415303; CDA-8822652; TRN: 96:006403-0045
- Resource Relation:
- Conference: 5. IEEE international symposium on high-performance distributed computing, Syracuse, NY (United States), 6-9 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the fifth IEEE international symposium on high performance distributed computing; PB: 664 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Determining the true and false sharing thrashings in parallel processing systems
Contention Modeling for Multithreaded Distributed Shared Memory Machines: The Cray XMT