Processor allocation in an N-cube multiprocessor using Gray codes

Journal Article · Tue Dec 01 04:00:00 EST 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.5009493· OSTI ID:5384833

Chen, M S; Shin, K G

The processor allocation problem in a n-dimensional hypercube (or an n-cube) multiprocessor is similar to the conventional memory allocation problem. The main objective in both problems is to maximize the utilization of available resources as well as minimize the inherent system fragmentation. A processor allocation strategy using the buddy system, called the buddy strategy, is discussed first and then a new allocation strategy using a Gracy code (GC), called the GC strategy, is proposed. Both are shown to be optimal but it is shown that the GC strategy outperforms the buddy strategy in detecting the availability of subcubes. The results are extended further to implement an allocation strategy using more than one GC and derive the relationship between the GC's used and the corresponding ability of detecting the availability of various subcubes. The minimal number of GC's required for complete subcube recognition in a Q/sub n/ is proved to be less than or equal to C/sup 2//sub (n/2)/.

• Research Organization: Div. of Computer Science and Engineering, Dept. of Electrical Engineering and Computer Science, Univ. of Michigan, Ann Arbor, MI 48109
• OSTI ID: 5384833
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:12; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
AVAILABILITY
COMPUTER CODES
ELECTRONIC CIRCUITS
G CODES
GRAPHS
INTEGRATED CIRCUITS
MATHEMATICAL LOGIC
MEASURING METHODS
MICROELECTRONIC CIRCUITS
PERFORMANCE