Distributed virtual memory in the CSMA/CD environment

M. Abaza; A. Fellah

Distributed virtual memory in the CSMA/CD environment

M. Abaza, A. Fellah

School of Computing and Information systems

United Arab Emirates University

Research output: Contribution to conference › Paper › peer-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 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

Cite this

@conference{5f9d2657101f4c47b83e1200421baefb,

title = "Distributed virtual memory in the CSMA/CD environment",

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.",

author = "M. Abaza and A. Fellah",

year = "1997",

language = "English",

pages = "778--781",

note = "Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2) ; Conference date: 20-08-1997 Through 22-08-1997",

}

TY - CONF

T1 - Distributed virtual memory in the CSMA/CD environment

AU - Abaza, M.

AU - Fellah, A.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0031379342

M3 - Paper

AN - SCOPUS:0031379342

SP - 778

EP - 781

T2 - Proceedings of the 1997 6th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Part 1 (of 2)

Y2 - 20 August 1997 through 22 August 1997

ER -

Distributed virtual memory in the CSMA/CD environment

Abstract

Conference

Other files and links

Fingerprint

Cite this