A Queueing Network Model of Distributed Shared Memory

Distributed Shared Memory (DSM) is a mechanism which provides logical shared memory in a distributed system. This simplifies the task of distributed programming. We develop simple queueing network models that can be used to compare the performance characteristics of several DSM algorithms for location of shared pages. Our models can be evaluated efficiently using the MVA (Mean Value Analysis) technique. Using these models, we can explore the regions of applicability of various DSM algorithms. By modelling contention at shared resources such as the network and memory servers, our model is able to provide more accurate results than the earlier analysis by Stumm and Zhou.

[1]  Michael Stumm,et al.  Algorithms implementing distributed shared memory , 1990, Computer.

[2]  Brett D. Fleisch.  Distributed shared memory in a loosely coupled distributed system , 1987, Computer Communication Review.

[3]  Bill Nitzberg,et al.  Distributed shared memory: a survey of issues and algorithms , 1991, Computer.

[4]  Umakishore Ramachandran,et al.  An implementation of distributed shared memory , 1991, Softw. Pract. Exp..

[5]  David R. Cheriton,et al.  Problem-oriented Shared Memory: A Decentralized Approach to Distributed System Design , 1986, IEEE International Conference on Distributed Computing Systems.

[6]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[7]  Michel Dubois,et al.  Shared Block Contention in a Cache Coherence Protocol , 1991, IEEE Trans. Computers.

[8]  Willy Zwaenepoel,et al.  Munin: distributed shared memory based on type-specific memory coherence , 1990, PPOPP '90.

[9]  Richard E. Kessler,et al.  An analysis of distributed shared memory algorithms , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[10]  Timothy A. Gonsalves,et al.  A DSM-based portable distributed programming testbed , 1995 .

[11]  Brett D. Fleisch,et al.  Mirage: a coherent distributed shared memory design , 1989, SOSP '89.

[12]  Susan J. Eggers,et al.  Simplicity Versus Accuracy in a Model of Cache Coherency Overhead , 1991, IEEE Trans. Computers.

[13]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[14]  Gary Scott Delp.  The architecture and implementation of MEMNET: a high--speed shared-memory computer communication network , 1988 .

[15]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.

[16]  Michael Stumm,et al.  Extending distributed shared memory to heterogeneous environments , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[17]  Anoop Gupta,et al.  Memory-reference characteristics of multiprocessor applications under MACH , 1988, SIGMETRICS 1988.

[18]  Kai Li,et al.  Heterogeneous Distributed Shared Memory , 1992, IEEE Trans. Parallel Distributed Syst..