DocumentCode
1090893
Title
Bit decision table for hypercube decomposition
Author
Chang, C. Hwa ; Dediu, H.H.
Author_Institution
Dept. of Electr. Eng., Tufts Univ., Medford, MA, USA
Volume
28
Issue
8
fYear
1992
fDate
4/9/1992 12:00:00 AM
Firstpage
736
Lastpage
738
Abstract
A new algorithm for subcube assignment and decomposition is introduced to solve the fragmentation problem in hypercube (n-cube) processor allocation. The sharing density vector introduced in the prime cube graph strategy is used as a vehicle to develop the new algorithm. A bit decision table is devised to provide the key parameters for determining the decomposition. It is proven that the result of the algorithm is at least 22% better than the sharing density vector approach.
Keywords
hypercube networks; search problems; bit decision table; fragmentation problem; hypercube decomposition; prime cube graph strategy; processor allocation; sharing density vector; subcube assignment;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19920466
Filename
133105
Link To Document