Munin: distributed shared memory based on type-specific memory coherence

  • Authors:

  • J. K. Bennett;J. B. Carter;W. Zwaenepoel

  • Affiliations:

  • Department of Electrical and Computer Engineering, Rice University, Houston, Texas;Department of Computer Science, Rice University, Houston, Texas;Department of Computer Science, Rice University, Houston, Texas

  • Venue:
  • PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We are developing Munin, a system that allows programs written for shared memory multiprocessors to be executed efficiently on distributed memory machines. Munin attempts to overcome the architectural limitations of shared memory machines, while maintaining their advantages in terms of ease of programming. Our system is unique in its use of loosely coherent memory, based on the partial order specified by a shared memory parallel program, and in its use of type-specific memory coherence. Instead of a single memory coherence mechanism for all shared data objects, Munin employs several different mechanisms, each appropriate for a different class of shared data object. These type-specific mechanisms are part of a runtime system that accepts hints from the user or the compiler to determine the coherence mechanism to be used for each object. This paper focuses on the design and use of Munin's memory coherence mechanisms, and compares our approach to previous work in this area.