Distributed virtual memory in the CSMA/CD environment

M. Abaza, A. Fellah

Research output: Contribution to conferencePaperpeer-review

2 Citations (Scopus)

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 languageEnglish
Pages778-781
Number of pages4
Publication statusPublished - 1997
EventProceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2) - Victoria, Can
Duration: 20 Aug. 199722 Aug. 1997

Conference

ConferenceProceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2)
CityVictoria, Can
Period20/08/9722/08/97

Fingerprint

Dive into the research topics of 'Distributed virtual memory in the CSMA/CD environment'. Together they form a unique fingerprint.

Cite this