Hemingway, A Distributed Shared Memory System
Abstract
Distributed shared memory systems can be divided into single-writer and multi-writer protocols. Multi-writer systems can further be divided into loosely-consistent and multi-writer protocols. Single writer systems can suffer from excessive false sharing. Both single-writer with loosely-consistent multi-writer protocols depend on synchronization communication susceptible to latency. By comparison, a write-through, weakly-consistent distributed shared memory system relies largely on asynchronous write operations. These writes can be consolidated or squashed using write buffers. The remaining latency-sensitive operations include copying readable pages. if we assume that communication bandwidth will become increasingly plentiful, but that communication latency will not increase as fast as bandwidth, write-through protocols have several advantages. In this paper, we describe those advantages and the design of Hemingway, a write-through, weakly consistent distributed shared memory system.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 23, 1995
- Accession Number
- ADA459176
Entities
People
- Anshu Aggarwal
- Dirk Grunwald
- Evi Nemeth
- Trent R. Hein
Organizations
- University of Colorado Boulder