Results 1 - 6 of 6

Implementation and performance of Munin

by John B. Carter, John K. Bennett, Willy Zwaenepoel - IN PROCEEDINGS OF THE 13TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 1991
"... Munin is a distributed shared memory (DSM) system that allows shared memory parallel programs to be executed efficiently on distributed memory multiprocessors. Munin is unique among existing DSM systems in its use of multiple consistency protocols and in its use of release consistency. In Munin, sha ..."
Abstract - Cited by 587 (22 self) - Add to MetaCart
of two Munin programs that achieve performance within ten percent of message passing implementations of the same programs. Munin achieves this level of performance with only minor annotations to the shared memory programs.

Design of the Munin Distributed Shared Memory System

by John B. Carter
"... Software distributed shared memory (DSM) is a software abstraction of shared memory on a distributed memory machine. The key problem in building an e cient DSM system is to reduce the amount of communication needed to keep the distributed memories consistent. The Munin DSM system incorporates a numb ..."
Abstract - Cited by 52 (1 self) - Add to MetaCart
number of novel techniques for doing so, including the use of multiple consistency protocols and support for multiple concurrent writer protocols. Due to these, and other, features, Munin is able to achieve high performance on a variety of numerical applications This paper contains a detailed description

Implementation and Performance

by John B. Carter, John K. Bennett - of Munin",13th ACM Symp. on Operating Systems Principles , 1991
"... Munin is a distributed shared memory (DSM) system that allows shared memory parallel programs to be ex-ecuted efficiently on distributed memory multiproces-sors. Munin is unique among existing DSM systems in its use of multiple consistency protocols and in its use of release consistency. In Munin, s ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Munin programs that achieve performance within ten percent of message passing implemental ions of the same programs. Munin achieves this level of performance with only minor annotations to the shared memory pro-grams. 1

Techniques for reducing consistency-related communication in distributed shared memory systems

by John B. Carter, John K. Bennett, Willy Zwaenepoel - ACM Transactions on Computer Systems. Toappear
"... Distributed shared memory (DSM) is a software abstraction of shared memory on a distributed memory machine. One of the key problems in building an e cient DSM system is to reduce the amount ofcommunication needed to keep the distributed memories consistent. In this paper we presentfour techniques fo ..."
Abstract - Cited by 106 (13 self) - Add to MetaCart
for doing so: (1) software release consistency � (2) multiple consistency protocols � (3) write-shared protocols � and (4) an update-with-timeout mechanism. These techniques have been implemented in the Munin DSM system. We compare the performance of seven application programs on Munin, rst

Toward Large-Scale Shared Memory Multiprocessing

by John K. Bennett, John B. Carter, Willy Zwaenepoel , 1991
"... We are currently investigating two different approaches to scalable shared memory: Munin, a distributed shared memory (DSM) system implemented entirely in software, and Willow, a true shared memory multiprocessor with extensive hardware support for scalability. Munin allows parallel programs written ..."
Abstract - Add to MetaCart
We are currently investigating two different approaches to scalable shared memory: Munin, a distributed shared memory (DSM) system implemented entirely in software, and Willow, a true shared memory multiprocessor with extensive hardware support for scalability. Munin allows parallel programs

KOAN: a Shared Virtual Memory for the iPSC/2 hypercube

by Zakaria Lahjomri, Thierry Priol - In CONPAR/VAPP92 , 1991
"... In this paper, we describe the salient features of an implementation of a shared virtual memory, named KOAN, running on a iPSC/2 hypercube. We then discuss its performance on a non-numerical algorithm like ray-tracing as well as a numerical one: the Modified Gram-Schmidt algorithm. 1 Introductio ..."
Abstract - Cited by 41 (20 self) - Add to MetaCart
In this paper, we describe the salient features of an implementation of a shared virtual memory, named KOAN, running on a iPSC/2 hypercube. We then discuss its performance on a non-numerical algorithm like ray-tracing as well as a numerical one: the Modified Gram-Schmidt algorithm. 1
Results 1 - 6 of 6