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 language | English |
---|---|
Title of host publication | 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 |
Editors | Wanlei Zhou, Andrzej Goscinski, Michael Hobbs |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 211-224 |
Number of pages | 14 |
ISBN (Electronic) | 0780342291, 9780780342293 |
DOIs | |
State | Published - 1997 |
Event | 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 - Melbourne, Australia Duration: 10 Dec 1997 → 12 Dec 1997 |
Publication series
Name | 1997 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 |
---|
Conference
Conference | 3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997 |
---|---|
Country/Territory | Australia |
City | Melbourne |
Period | 10/12/97 → 12/12/97 |
Bibliographical note
Publisher Copyright:© 1997 IEEE.