Virtual memory for a hypercube multiprocessor

Authors:
J. M. Francioni;D. A. Poplawski;S. Pahwa
Affiliations:
Department of Computer Science, Michigan Technological University, Houghton, MI;Department of Computer Science, Michigan Technological University, Houghton, MI;Department of Computer Science, Michigan Technological University, Houghton, MI
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Year:
1988

Citing 12
Cited 0

The cosmic cube

Communications of the ACM - Special section on computer architecture
Operating system concepts (2nd ed.)

Operating system concepts (2nd ed.)
How to share memory in a distributed system

Journal of the ACM (JACM)
Memory coherence in shared virtual memory systems

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The S/Net's Linda kernel

ACM Transactions on Computer Systems (TOCS)
The integration of virtual memory management and interprocess communication in Accent

ACM Transactions on Computer Systems (TOCS)
Virtual Memory

ACM Computing Surveys (CSUR)
Implementing remote procedure calls

ACM Transactions on Computer Systems (TOCS)
Performing remote operations efficiently on a local computer network

Communications of the ACM
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Accent: A communication oriented network operating system kernel

SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
A large scale, homogeneous, fully distributed parallel machine, I

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most hypercube programs are structured so that all nodes contain an identical copy of the node program, as well as a complete copy of the node operating system program. This is a tremendous waste of memory, which ends up limiting the size and complexity of hypercube application programs. One way around this problem is to implement a virtual memory on the hypercube, whereby one copy of the node and operating system program is distributed among all the nodes of the hypercube and each node performs demand paging for the pages not resident in that node. Since almost none of the existing hypercubes have the hardware to support a virtual memory, this must be done in software. In this paper, we discuss a feasibility study of a hypercube virtual memory for executable code based on an implementation which requires no hardware support. We also explain the general principles involved in this type of virtual memory, and discuss how the features and restrictions of a hypercube architecture affect the implementation. In particular we show, via simulation results from real hypercube applications, ways to reduce the paging traffic in the hypercube.