Memory ushering in a scalable computing cluster

Author

Barak, A. ; Braverman, A.

Author_Institution

Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

fYear

1997

fDate

10-12 Dec 1997

Firstpage

211

Lastpage

224

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

Keywords

local area networks; network operating systems; reconfigurable architectures; resource allocation; software performance evaluation; storage management; time-sharing systems; MOSIX; cluster wide resource allocation; high performance applications; main memory; mainframes; massively parallel processing; memory ushering; multi-user environments; multicomputer operating system; scalable computing cluster; simulations; time-sharing environments; Application software; Availability; Clustering algorithms; Computer networks; Computer science; High performance computing; Operating systems; Resource management; Round robin; Time sharing computer systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on

Conference_Location

Melbourne, Vic.

Print_ISBN

0-7803-4229-1

Type

conf

DOI

10.1109/ICAPP.1997.651492

Filename

651492