DocumentCode :
1093552
Title :
Processor allocation strategies for modified hypercubes
Author :
Ziavras, S.G. ; Haravu, N.G.
Author_Institution :
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
Volume :
141
Issue :
3
fYear :
1994
fDate :
5/1/1994 12:00:00 AM
Firstpage :
196
Lastpage :
204
Abstract :
Modified hypercubes (MHs) have been proposed as building blocks for hypercube-based parallel systems that support the application of incremental growth techniques. In contrast, implementing the standard hypercube cannot be expanded in practice. However, processor allocation for MHs is a more difficult task due to a slight deviation in their topology from that of the standard hypercube. The paper proposes two strategies to solve the processor allocation problem for MHs. The proposed strategies are characterised by perfect subcube recognition ability and superior performance. Furthermore, two existing processor allocation strategies for standard hypercube networks, namely the buddy and free-list strategies, are shown to be ineffective for MHs, in the light of their inability to recognise many available subcubes. A comparative analysis that involves the buddy strategy and the new strategies is carried out using simulation results
Keywords :
hypercube networks; multiprocessing programs; resource allocation; buddy strategies; free-list strategies; incremental growth techniques; modified hypercubes; parallel systems; perfect subcube recognition; processor allocation strategies; simulation results;
fLanguage :
English
Journal_Title :
Computers and Digital Techniques, IEE Proceedings -
Publisher :
iet
ISSN :
1350-2387
Type :
jour
DOI :
10.1049/ip-cdt:19941036
Filename :
287063
Link To Document :
بازگشت