Distributed virtual memory in the CSMA/CD environment

Advances in network and processor technology have improved and increased the performance of distributed systems. We show that paging across a network of nodes in a CSMA/CD environment results in significant performance over paging to the disk. We describe, simulate and implement four distributed paging algorithms, the no, odd-even, mod and class priority algorithms. Moreover, we show that the class priority algorithm outperforms other methods in terms of memory performance