Processor allocation for a class of hypercube-like supercomputers

Nagasimha G. Haravu, Sotirios G. Ziavras

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Modified hypercubes (MHs) [20] have been proposed as the building blocks of hypercube-based parallel systems that support incremental growth techniques. In contrast, systems comprising the standard hypercube can not be expanded in practice. Processor allocation for MHs is a more difficult task due to a slight deviation in their topology from that of the hypercube. This paper addresses the processor allocation problem for MHs and proposes two strategies which are based, partially or entirely, on a table look-up approach. The proposed strategies are characterized by a perfect subcube recognition ability and a superior performance. Further, two existing processor allocation strategies for pure hypercubes, namely the buddy and free list strategies, are shown to be ineffective for MHs, in the light of their inability to recognize many available subcubes.

Original languageEnglish (US)
Title of host publicationProceedings of the 1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992
EditorsRobert Werner
PublisherAssociation for Computing Machinery
Pages740-749
Number of pages10
ISBN (Electronic)0818626305
DOIs
StatePublished - Dec 1 1992
Event1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992 - Minneapolis, United States
Duration: Nov 16 1992Nov 20 1992

Publication series

NameProceedings of the International Conference on Supercomputing
VolumePart F129723

Other

Other1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992
CountryUnited States
CityMinneapolis
Period11/16/9211/20/92

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Processor allocation for a class of hypercube-like supercomputers'. Together they form a unique fingerprint.

Cite this