Invalidation-Based Distributed Shared Memory on RHODOS

Distributed shared memory (DSM) provides a mechanism to transparently share variables between processes running on different workstations in a distributed system. Users are unaware that the underlying mechanism for inter process communication is message passing or RPC and are able to write their code using the well known shared memory primitives. In this report, we have described the design and implementation of RHODOS’ DSM. It uses no global information and is based on the simple clean write_invalidate consistency protocol. In addition, we give the performance results we obtained for sequential and parallel Quicksort and Travelling Salesman Problem using RHODOS’ DSM.