On paged distributed virtual memory algorithms in a broadcasting environment

Authors:
Abdelaziz Fellah
Affiliations:
Faculty of Science, Dept of Mathematics and Computer Science, U.A.E. University, P.O. Box 19246, Al-Ain, United Arab Emirates
Venue:
Computer Communications
Year:
1998

Citing 11
Cited 0

The Wisconsin Wind Tunnel: virtual prototyping of parallel computers

SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Distributed operating systems

Distributed operating systems
Data communications, computer networks and open systems (4th ed.)

Data communications, computer networks and open systems (4th ed.)
Message passing versus distributed shared memory on networks of workstations

Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Reducing TLB and memory overhead using online superpage promotion

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
TreadMarks: Shared Memory Computing on Networks of Workstations

Computer
Paging tradeoffs in distributed-shared-memory multiprocessors

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Batrun: Utilizing Idle Workstations for Large-Scale Computing

IEEE Parallel & Distributed Technology: Systems & Technology
Distributed Shared Memory: Concepts and Systems

IEEE Parallel & Distributed Technology: Systems & Technology
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
A Case for NOW (Networks of Workstations)

IEEE Micro

Quantified Score

Hi-index	0.24

Visualization

Abstract

Advances in network and processor technology have improved and increased the performance of distributed virtual memory systems in recent years. Remote memory access is considered as a faster-than-disk memory level and has strongly influenced research in distributed virtual memory management. Moreover, the broadcasting transmission nature commonly used in todays LAN provides a simplified environment for paging purposes. In this paper, we show that remote memory paging in distributed virtual memory systems are significantly faster than traditional disk paging. Then through simulation, we compare the performance of two different systems, distributed virtual memory and dedicated memory systems. Distributed virtual memory systems provide significant performance improvement with relatively less cost and no extra hardware than dedicated memory systems. Also, we describe and evaluate several remote memory paging algorithms, the best of which is called the class priority algorithm.