Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers

Gyungho Lee

doi:10.1007/3-540-18991-2_5

Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers

Gyungho Lee

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

Concurrent requests to a shared variable by many processors on a shared memory machine can create contention that will be serious enough to stall large machines. This idea has been formalized in the “hot spot” traffic [PfNo85], where a fixed fraction of memory requests is for a single shared variable. “Combining”, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating the contention. Lee, Kruskal, and Kuck [LeKK86] introduced the idea of “k-way combining”, which shows that the effectiveness of combining depends on k, the maximum possible number of requests combined into a single request at a switch. This paper introduces a scheme to remedy k-way combining in order to avoid the contention without incurring impractically large storages in switches of multistage interconnection networks.

Original language	English
Title of host publication	Supercomputing - 1st International Conference, Proceedings
Editors	Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Elias N. Houstis
Publisher	Springer Verlag
Pages	68-79
Number of pages	12
ISBN (Print)	9783540189916
DOIs	https://doi.org/10.1007/3-540-18991-2_5
Publication status	Published - 1988
Event	1st International Conference on Supercomputing, 1987 - Athens, Greece Duration: 1987 Jun 8 → 1987 Jun 12

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	297 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	1st International Conference on Supercomputing, 1987
Country/Territory	Greece
City	Athens
Period	87/6/8 → 87/6/12

Bibliographical note

Publisher Copyright:
© 1988, Springer-Verlag.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-18991-2_5

Cite this

Lee, G. (1988). Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. In T. S. Papatheodorou, C. D. Polychronopoulos, & E. N. Houstis (Eds.), Supercomputing - 1st International Conference, Proceedings (pp. 68-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-18991-2_5

Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. / Lee, Gyungho.
Supercomputing - 1st International Conference, Proceedings. ed. / Theodore S. Papatheodorou; Constantine D. Polychronopoulos; Elias N. Houstis. Springer Verlag, 1988. p. 68-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lee, G 1988, Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. in TS Papatheodorou, CD Polychronopoulos & EN Houstis (eds), Supercomputing - 1st International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 297 LNCS, Springer Verlag, pp. 68-79, 1st International Conference on Supercomputing, 1987, Athens, Greece, 87/6/8. https://doi.org/10.1007/3-540-18991-2_5

Lee G. Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. In Papatheodorou TS, Polychronopoulos CD, Houstis EN, editors, Supercomputing - 1st International Conference, Proceedings. Springer Verlag. 1988. p. 68-79. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-18991-2_5

Lee, Gyungho. / Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. Supercomputing - 1st International Conference, Proceedings. editor / Theodore S. Papatheodorou ; Constantine D. Polychronopoulos ; Elias N. Houstis. Springer Verlag, 1988. pp. 68-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{54a7eea68cae46a98611ec8d13f43be5,

title = "Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers",

abstract = "Concurrent requests to a shared variable by many processors on a shared memory machine can create contention that will be serious enough to stall large machines. This idea has been formalized in the “hot spot” traffic [PfNo85], where a fixed fraction of memory requests is for a single shared variable. “Combining”, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating the contention. Lee, Kruskal, and Kuck [LeKK86] introduced the idea of “k-way combining”, which shows that the effectiveness of combining depends on k, the maximum possible number of requests combined into a single request at a switch. This paper introduces a scheme to remedy k-way combining in order to avoid the contention without incurring impractically large storages in switches of multistage interconnection networks.",

author = "Gyungho Lee",

note = "Publisher Copyright: {\textcopyright} 1988, Springer-Verlag.; 1st International Conference on Supercomputing, 1987 ; Conference date: 08-06-1987 Through 12-06-1987",

year = "1988",

doi = "10.1007/3-540-18991-2_5",

language = "English",

isbn = "9783540189916",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "68--79",

editor = "Papatheodorou, {Theodore S.} and Polychronopoulos, {Constantine D.} and Houstis, {Elias N.}",

booktitle = "Supercomputing - 1st International Conference, Proceedings",

}

TY - GEN

T1 - Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers

AU - Lee, Gyungho

PY - 1988

Y1 - 1988

N2 - Concurrent requests to a shared variable by many processors on a shared memory machine can create contention that will be serious enough to stall large machines. This idea has been formalized in the “hot spot” traffic [PfNo85], where a fixed fraction of memory requests is for a single shared variable. “Combining”, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating the contention. Lee, Kruskal, and Kuck [LeKK86] introduced the idea of “k-way combining”, which shows that the effectiveness of combining depends on k, the maximum possible number of requests combined into a single request at a switch. This paper introduces a scheme to remedy k-way combining in order to avoid the contention without incurring impractically large storages in switches of multistage interconnection networks.

AB - Concurrent requests to a shared variable by many processors on a shared memory machine can create contention that will be serious enough to stall large machines. This idea has been formalized in the “hot spot” traffic [PfNo85], where a fixed fraction of memory requests is for a single shared variable. “Combining”, in which several requests for the same variable can be combined into a single request, has been suggested as an effective method of alleviating the contention. Lee, Kruskal, and Kuck [LeKK86] introduced the idea of “k-way combining”, which shows that the effectiveness of combining depends on k, the maximum possible number of requests combined into a single request at a switch. This paper introduces a scheme to remedy k-way combining in order to avoid the contention without incurring impractically large storages in switches of multistage interconnection networks.

UR - http://www.scopus.com/inward/record.url?scp=0040140623&partnerID=8YFLogxK

U2 - 10.1007/3-540-18991-2_5

DO - 10.1007/3-540-18991-2_5

M3 - Conference contribution

AN - SCOPUS:0040140623

SN - 9783540189916

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 68

EP - 79

BT - Supercomputing - 1st International Conference, Proceedings

A2 - Papatheodorou, Theodore S.

A2 - Polychronopoulos, Constantine D.

A2 - Houstis, Elias N.

PB - Springer Verlag

T2 - 1st International Conference on Supercomputing, 1987

Y2 - 8 June 1987 through 12 June 1987

ER -

Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers

Abstract

Publication series

Other

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this