Effects of network contention on processor allocation strategies

Sherry Q. Moore; Lionel M. Ni

doi:10.1109/IPPS.1996.508068

Effects of network contention on processor allocation strategies

Sherry Q. Moore^*, Lionel M. Ni

^*Corresponding author for this work

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

12 Citations (Scopus)

Abstract

Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important. Our simulation considers both mesh- and MIN-based wormhole parallel computers, the communication characteristics of individual applications, and the impact due to communication software latency. We show that for systems with high software latency, there is no need of contention-free processor allocation policies. However, if the software latency is very small or the message size is very long, contention-free allocation policies should be developed.

Original language	English
Pages (from-to)	268-273
Number of pages	6
Journal	IEEE Symposium on Parallel and Distributed Processing - Proceedings
DOIs	https://doi.org/10.1109/IPPS.1996.508068
Publication status	Published - 1996
Externally published	Yes
Event	Proceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA Duration: 15 Apr 1996 → 19 Apr 1996

Access to Document

10.1109/IPPS.1996.508068

Cite this

@article{dc809571dbe6494bbfdcab9c01a9d84b,

title = "Effects of network contention on processor allocation strategies",

abstract = "Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important. Our simulation considers both mesh- and MIN-based wormhole parallel computers, the communication characteristics of individual applications, and the impact due to communication software latency. We show that for systems with high software latency, there is no need of contention-free processor allocation policies. However, if the software latency is very small or the message size is very long, contention-free allocation policies should be developed.",

author = "Moore, \{Sherry Q.\} and Ni, \{Lionel M.\}",

year = "1996",

doi = "10.1109/IPPS.1996.508068",

language = "English",

pages = "268--273",

journal = "IEEE Symposium on Parallel and Distributed Processing - Proceedings",

issn = "1063-6374",

note = "Proceedings of the 1996 10th International Parallel Processing Symposium ; Conference date: 15-04-1996 Through 19-04-1996",

}

TY - JOUR

T1 - Effects of network contention on processor allocation strategies

AU - Moore, Sherry Q.

AU - Ni, Lionel M.

PY - 1996

Y1 - 1996

N2 - Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important. Our simulation considers both mesh- and MIN-based wormhole parallel computers, the communication characteristics of individual applications, and the impact due to communication software latency. We show that for systems with high software latency, there is no need of contention-free processor allocation policies. However, if the software latency is very small or the message size is very long, contention-free allocation policies should be developed.

AB - Various processor allocation strategies have been proposed for scalable parallel computers (SPCs). These strategies try to maximize the overall system utilization and, in the mean time, try to avoid network contention among different processor partitions. This paper provides an intensive simulation study investigating whether contention-free processor allocation strategies are indeed important. Our simulation considers both mesh- and MIN-based wormhole parallel computers, the communication characteristics of individual applications, and the impact due to communication software latency. We show that for systems with high software latency, there is no need of contention-free processor allocation policies. However, if the software latency is very small or the message size is very long, contention-free allocation policies should be developed.

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

U2 - 10.1109/IPPS.1996.508068

DO - 10.1109/IPPS.1996.508068

M3 - Conference article published in journal

AN - SCOPUS:0029700417

SN - 1063-6374

SP - 268

EP - 273

JO - IEEE Symposium on Parallel and Distributed Processing - Proceedings

JF - IEEE Symposium on Parallel and Distributed Processing - Proceedings

T2 - Proceedings of the 1996 10th International Parallel Processing Symposium

Y2 - 15 April 1996 through 19 April 1996

ER -

Effects of network contention on processor allocation strategies

Abstract

Access to Document

Other files and links

Fingerprint

Cite this