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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationSupercomputing - 1st International Conference, Proceedings
PublisherSpringer Verlag
Pages68-79
Number of pages12
Volume297 LNCS
ISBN (Print)9783540189916
DOIs
Publication statusPublished - 1988 Jan 1
Externally publishedYes
Event1st International Conference on Supercomputing, 1987 - Athens, Greece
Duration: 1987 Jun 81987 Jun 12

Publication series

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

Other

Other1st International Conference on Supercomputing, 1987
CountryGreece
CityAthens
Period87/6/887/6/12

Fingerprint

Parallel Computers
Contention
Hot Spot
Shared Memory
Switches
Data storage equipment
Switch
Multistage Interconnection Networks
Concurrent
Traffic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Lee, K. H. (1988). Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. In Supercomputing - 1st International Conference, Proceedings (Vol. 297 LNCS, 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, Kyung Ho.

Supercomputing - 1st International Conference, Proceedings. Vol. 297 LNCS 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 proceedingConference contribution

Lee, KH 1988, Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. in Supercomputing - 1st International Conference, Proceedings. vol. 297 LNCS, 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 KH. Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. In Supercomputing - 1st International Conference, Proceedings. Vol. 297 LNCS. Springer Verlag. 1988. p. 68-79. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-18991-2_5
Lee, Kyung Ho. / Another combining scheme to reduce hot spot contention in large scale shared memory parallel computers. Supercomputing - 1st International Conference, Proceedings. Vol. 297 LNCS 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 = "Lee, {Kyung Ho}",
year = "1988",
month = "1",
day = "1",
doi = "10.1007/3-540-18991-2_5",
language = "English",
isbn = "9783540189916",
volume = "297 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "68--79",
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, Kyung Ho

PY - 1988/1/1

Y1 - 1988/1/1

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

UR - http://www.scopus.com/inward/citedby.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

VL - 297 LNCS

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

PB - Springer Verlag

ER -