DocumentCode
975709
Title
A new graph approach to minimizing processor fragmentation in hypercube multiprocessors
Author
Yang, Qing ; Wang, Hong
Author_Institution
Dept. of Electr. Eng., Rhode Island Univ., Kingston, RI, USA
Volume
4
Issue
10
fYear
1993
fDate
10/1/1993 12:00:00 AM
Firstpage
1165
Lastpage
1171
Abstract
The authors propose a new approach for subcube and noncubic processor allocations for hypercube multiprocessors. The main idea is to represent available processors in the system by means of a prime cube graph (PC-graph). The PC-graph maintains the inter-relationships between free subcubes and hence reduces both internal and external processor fragmentations. Their simulation results show that the PC-graph approach outperforms the existing allocation strategies by 25% to 50% under certain load conditions
Keywords
digital simulation; hypercube networks; multiprocessing systems; performance evaluation; graph approach; hypercube multiprocessors; minimizing processor fragmentation; prime cube graph; simulation; Application software; Availability; Binary trees; Computational modeling; Concurrent computing; Costs; High performance computing; Hypercubes; Nonlinear equations; Topology;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.246077
Filename
246077
Link To Document