Distributed processor allocation in large PC clusters

Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions, we are investigating a distributed a...

Full description

Saved in:
Bibliographic Details
Published inHigh Performance Distributed Computing (HPDC-9, 2000): 9th IEEE International Symposium pp. 288 - 289
Main Authors De Rose, C.A.F., Heiss, H.-U., Navaux, P.A.O.
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.01.2000
Subjects
Online AccessGet full text
ISBN9780769507835
0769507832
ISSN1082-8907
DOI10.1109/HPDC.2000.868661

Cover

More Information
Summary:Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions, we are investigating a distributed approach to the processor allocation problem in large distributed memory machines. A contiguous and a noncontiguous version of a distributed dynamic processor allocation strategy are proposed and studied. Simulations compare the performance of the proposed strategies with that of well-known centralized algorithms. We also present the results of experiments on a Simens hpcline Primergy Server with 96 nodes that show distributed allocation is feasible with current technologies.
Bibliography:SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
content type line 25
ISBN:9780769507835
0769507832
ISSN:1082-8907
DOI:10.1109/HPDC.2000.868661