Competitive Management of Distributed Shared Memory
Abstract
This paper presents and analyzes algorithms for managing the distributed shared memory present in non-uniform memory access multiprocessors and related systems. The competitive properties of these algorithms guarantee that their performance is within a small constant factor of optimal even though they make no use of any information about memory reference patterns. Both hardware and software implementation concerns are covered. A case study of the Mach operating systems indicates that integration of these algorithms into operating systems does not pose major problems. On the other hand, hardware support is required to obtain the full functionality of the algorithms. We also sketch possible algorithm extensions to additional hardware architectures and software programming models. Reprints. (jes)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1988
- Accession Number
- ADA207322
Entities
People
- Anoop Gupta
- David L. Black
- Wolf-dietrich Weber
Organizations
- Stanford University