Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Processor allocation for a class of hypercube-like supercomputers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Haravu, N.G. ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Ziavras, S.G.

Modified hypercubes (MHs) have been proposed as the building blocks of hypercube-based parallel systems that support incremental growth techniques. In contrast, systems comprising the standard hypercube cannot 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. The authors address the processor allocation problem for MHs and propose two strategies which are based, partially or entirely, on a table lookup approach. The proposed strategies are characterized by a perfect subcube recognition ability and a superior performance. Furthermore, 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

Published in:

Supercomputing '92., Proceedings

Date of Conference:

16-20 Nov 1992