By Topic

H-lattice: a geometric model for processor allocation in hypercubes

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
$33 $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)
Fan Wu ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Ching-Chi Hsu

The H-lattice is a geometric model for describing the construction and occupied configuration of the hypercube multiprocessors. In addition, it can model the faulty hypercube in the presence of faulty processors and/or links. The H-lattice scheme, based on this model, can allocate fault free subcubes for various allocations, such as first/best/worst/next fit, and subcube inclusion/ exclusion allocations, in a more simple and efficient manner than ever. In this scheme, the viewpoint of the minimum destroyed degree is introduced to select the best-fit subcube, which is proved to be better than that of other schemes. Mathematical analyses and simulation are also derived to demonstrate the efficiency of the proposed scheme

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996