Contention-free 2D-mesh cluster allocation in hypercubes

Author

Turner, Stephen W. ; Ni, Lionel M. ; Cheng, Betty H C

Author_Institution

Ford Syst. Integration Center, Allen Park, MI, USA

Volume

44

Issue

8

fYear

1995

fDate

8/1/1995 12:00:00 AM

Firstpage

1051

Lastpage

1055

Abstract

Traditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper presents a 2D-mesh cluster allocation strategy for hypercubes. The proposed auxiliary free list processor allocation strategy can efficiently allocate 2D-mesh dusters without size constraints, can reduce average job turnaround time compared with that based on subcube allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlock-free E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization

Keywords

hypercube networks; 2D-mesh cluster allocation strategy; auxiliary free list processor allocation strategy; communication interference; contention-free 2D-mesh cluster allocation; deadlock-free E-cube routing; hypercubes; subcube allocation strategies; Algorithm design and analysis; Computer science; Hypercubes; Interference constraints; Network topology; Partial differential equations; Reflective binary codes; Routing; System recovery;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.403722

Filename

403722