Abstract
Advances in network and processor technology have improved and increased the performance of distributed systems. In this paper, 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.
Original language | English |
---|---|
Pages | 778-781 |
Number of pages | 4 |
Publication status | Published - 1997 |
Event | Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2) - Victoria, Can Duration: 20 Aug. 1997 → 22 Aug. 1997 |
Conference
Conference | Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2) |
---|---|
City | Victoria, Can |
Period | 20/08/97 → 22/08/97 |