A Queueing Network Model of Distributed Shared Memory
D. Venkatesulu, Timothy A. Gonsalves · 1995
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.