Memory ushering in a scalable computing cluster

A. Barak, A. Braverman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

Scalable computing clusters (SCC) are becoming an alternative to mainframes and MPP's for the execution of high performance, demanding applications in multi-user, time-sharing environments. In order to better utilize the multiple resources of such systems, it is necessary to develop means for cluster wide resource allocation and sharing, that will make an SCC easy to program and use. This paper presents the details of a memory ushering algorithm among the nodes of an SCC. This algorithm allows a node which has exhausted its main memory to use available memory in other nodes. The paper first presents results of simulations of several algorithms for process placement to nodes. It then describes the memory ushering algorithm of the MOSIX multicomputer operating system for an SCC and its performance.

Original languageEnglish
Title of host publication1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
EditorsWanlei Zhou, Andrzej Goscinski, Michael Hobbs
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages211-224
Number of pages14
ISBN (Electronic)0780342291, 9780780342293
DOIs
StatePublished - 1997
Event3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 - Melbourne, Australia
Duration: 10 Dec 199712 Dec 1997

Publication series

Name1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997

Conference

Conference3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997
Country/TerritoryAustralia
CityMelbourne
Period10/12/9712/12/97

Bibliographical note

Publisher Copyright:
© 1997 IEEE.

Fingerprint

Dive into the research topics of 'Memory ushering in a scalable computing cluster'. Together they form a unique fingerprint.

Cite this