H-lattice: a geometric model for processor allocation in hypercubes
Resource
Algorithms and Architectures for Parallel Processing, 1996. ICAPP '96. 1996 IEEE Second International Conference on
Journal
Algorithms and Architectures for Parallel Processing, 1996. ICAPP '96. 1996 IEEE Second International Conference on
Pages
-
Date Issued
1996-06
Date
1996-06
Author(s)
Wu, Fan
Hsu, Ching-Chi
DOI
N/A
Abstract
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.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00562857.pdf
Size
37.42 KB
Format
Adobe PDF
Checksum
(MD5):c4e9b3d54b13ca2dfe7255369f49914d