Contention-free 2D-mesh cluster allocation in hypercubes

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

doi:10.1109/ICPP.1993.181

Contention-free 2D-mesh cluster allocation in hypercubes

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

Research output: Contribution to journal › Conference article published in journal › peer-review

4 Citations (Scopus)

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 clusters 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 deadlockfree E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.

Original language	English
Article number	4134196
Pages (from-to)	125-129
Number of pages	5
Journal	Proceedings of the International Conference on Parallel Processing
Volume	2
DOIs	https://doi.org/10.1109/ICPP.1993.181
Publication status	Published - 1993
Externally published	Yes
Event	1993 International Conference on Parallel Processing, ICPP 1993 - Syracuse, United States Duration: 16 Aug 1993 → 20 Aug 1993

Bibliographical note

Publisher Copyright:
© 1993 IEEE.

Access to Document

10.1109/ICPP.1993.181

Cite this

@article{f959efe62b3e454b8e91985e538aefab,

title = "Contention-free 2D-mesh cluster allocation in hypercubes",

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 clusters 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 deadlockfree E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.",

author = "Turner, \{Stephen W.\} and Ni, \{Lionel M.\} and Cheng, \{Betty H.C.\}",

note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 International Conference on Parallel Processing, ICPP 1993 ; Conference date: 16-08-1993 Through 20-08-1993",

year = "1993",

doi = "10.1109/ICPP.1993.181",

language = "English",

volume = "2",

pages = "125--129",

journal = "Proceedings of the International Conference on Parallel Processing",

issn = "0190-3918",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Contention-free 2D-mesh cluster allocation in hypercubes

AU - Turner, Stephen W.

AU - Ni, Lionel M.

AU - Cheng, Betty H.C.

PY - 1993

Y1 - 1993

N2 - 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 clusters 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 deadlockfree E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.

AB - 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 clusters 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 deadlockfree E-cube routing. The proposed auxiliary free list strategy can be easily implemented on hypercube multicomputers to increase processor utilization.

UR - https://www.scopus.com/pages/publications/0041008036

U2 - 10.1109/ICPP.1993.181

DO - 10.1109/ICPP.1993.181

M3 - Conference article published in journal

AN - SCOPUS:0041008036

SN - 0190-3918

VL - 2

SP - 125

EP - 129

JO - Proceedings of the International Conference on Parallel Processing

JF - Proceedings of the International Conference on Parallel Processing

M1 - 4134196

T2 - 1993 International Conference on Parallel Processing, ICPP 1993

Y2 - 16 August 1993 through 20 August 1993

ER -

Contention-free 2D-mesh cluster allocation in hypercubes

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this