Article

Free access

On hot-spot contention in interconnection networks

Authors:

N. M. Patel,

P. G. HarrisonAuthors Info & Claims

SIGMETRICS '88: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Pages 114 - 123

https://doi.org/10.1145/55595.55609

Published: 01 May 1988 Publication History

PDF eReader

Abstract

A major component of a parallel machine is its interconnection network, which provides concurrent communication between the processing elements. It is common to use a multi-stage interconnection network (MIN) which is constructed using crossbar switches and introduces not only contention for destination addresses but also additional contention for internal switches. Both types of contention are increased when non-local communication across a MIN becomes concentrated on a certain destination address, for example when a frequently-accessed data structure is stored entirely in one element of a distributed memory. Such an address, often called a hot-spot, affects the blocking probability of paths to other destination addresses because of the shared internal switches. This paper describes an analytical model of hot-spot contention and quantifies its effect on the performance of a MIN with a circuit switching communication protocol. We obtain performance measures for a MIN in which partial paths are held during path building and one destination address is more frequently chosen by incoming traffic than other addresses.

References

[1]

K.M. Chandy, U. Herzog, L. Woo, "Parametric Analysis of Queueing Networks", IBM J. Res. Develop., January, 1975.

Google Scholar

[2]

G.A. Cope, "The Modelling of Circuit-switched Multi-stage Interconnection Networks", MSc Thesis, imperial College, 1987.

Google Scholar

[3]

P.j. Courtois, "Decomposability", Academic Press, 1977.

Google Scholar

[4]

J. Darlington, M. J. Reeve, "ALICE : A Multiprocessor Reduction Machine for the Parallel Evaluation of Applicative Languages", ACM/MIT Conference on Functional Programming Languages and Computer Architecture, 1981.

Digital Library

Google Scholar

[5]

P.G. Harrison, A.J. Field "Performance Modelling of Parallel Computer Architectures", in Proc. Performance '86 and ACM Sigmetrics 1986, May 1986. pp. 18- 27.

Digital Library

Google Scholar

[6]

P.G. Harrison, N.M. Patel, "The Representation of Switching Networks in Queueing Models of Parallel Systems", in Proc. 12th Annual International Symposium on Computer Performance Modelling, December 1987, Brussels, Belgium.

Digital Library

Google Scholar

[7]

P.G. Harrison, M.J. Reeve, "The Parallel Graph Reduction Machine, ALICE", In Proc. Workshop on Graph Reduction, Santa Fe, September, 1986, to be published in LNCS series, Springer-Verlag.

Digital Library

Google Scholar

[8]

Digital Optics :Application to Computing and Communications. DTI JOERS (Joint Opto-Electronic Research Scheme) proposal, Issue 2, March 1986.

Google Scholar

[9]

J.R. Jump, D.M. Dias, "Analysis and Simulation of Buffered Delta Networks", IEEE Trans on Computers, Vol. C-29, No.9, September 1980, pp. 791-801.

Google Scholar

[10]

P.J. Kuehn, "Approximate Analysis of General Queueing Networks by Decomposition", IEEE Trans. Comm., COM-27,1, 1979.

Google Scholar

[11]

D. Mitra, R. Cieslak, "Randomized Parallel Communications", Proc. 1986 International Conference on Parallel Processing, August 1986, pp. 224-230.

Google Scholar

[12]

J.H. Patel, "Processor-Memory Interconnections for Multi- Processors", 6th Annual Symposium on Computer Architecture, 1979.

Digital Library

Google Scholar

[13]

G.F. Pfister, V.A. Norton, "Hotspot Contention and Combing in Multi-stage Interconnection Networks", Proc. 1985 International Conference on Parallel Processing, August 1985, pp. 790-797.

Google Scholar

[14]

H.J. Siegel, "interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies", Lexington Books, 1985.

Digital Library

Google Scholar

Cited By

View all

Tzeng N(1992)A Cost-Effective Combining Structure for Large-Scale Shared-Memory MultiprocessorsIEEE Transactions on Computers10.1109/12.17731241:11(1420-1429)Online publication date: 1-Nov-1992
https://dl.acm.org/doi/10.1109/12.177312
Lin TKleinrock L(1991)Performance analysis of finite-buffered multistage interconnection networks with a general traffic patternACM SIGMETRICS Performance Evaluation Review10.1145/107972.10798019:1(68-78)Online publication date: 2-Apr-1991
https://dl.acm.org/doi/10.1145/107972.107980
Lin TKleinrock LKeller T(1991)Performance analysis of finite-buffered multistage interconnection networks with a general traffic patternProceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems10.1145/107971.107980(68-78)Online publication date: 2-Apr-1991
https://dl.acm.org/doi/10.1145/107971.107980
Show More Cited By

Index Terms

On hot-spot contention in interconnection networks

Recommendations

On hot-spot contention in interconnection networks

A major component of a parallel machine is its interconnection network, which provides concurrent communication between the processing elements. It is common to use a multi-stage interconnection network (MIN) which is constructed using crossbar switches ...
Hot-Spot Contention in Binary Hypercube Networks

Consideration is given to the impact of hot-spot contention in distributed-memory multicomputer systems. Since the binary hypercube network offers a reasonable compromise between network cost and performance, two hypercube-based static interconnection ...
High-radix interconnection networks

Comments

Information & Contributors

Information

Published In

SIGMETRICS '88: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems

May 1988

282 pages

ISBN:0897912543

DOI:10.1145/55595

Chairman:
C. U. Smith
L&S Computer Technology

ACM SIGMETRICS Performance Evaluation Review Volume 16, Issue 1
May 1988
266 pages
ISSN:0163-5999
DOI:10.1145/1007771
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1988

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMETRICS88

Sponsor:

SIGMETRICS

SIGMETRICS88: SIGMetrics '88 Conference on Measurement and Modeling of computer Systems

May 24 - 27, 1988

New Mexico, Santa Fe, USA

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
316
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)14

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tzeng N(1992)A Cost-Effective Combining Structure for Large-Scale Shared-Memory MultiprocessorsIEEE Transactions on Computers10.1109/12.17731241:11(1420-1429)Online publication date: 1-Nov-1992
https://dl.acm.org/doi/10.1109/12.177312
Lin TKleinrock L(1991)Performance analysis of finite-buffered multistage interconnection networks with a general traffic patternACM SIGMETRICS Performance Evaluation Review10.1145/107972.10798019:1(68-78)Online publication date: 2-Apr-1991
https://dl.acm.org/doi/10.1145/107972.107980
Lin TKleinrock LKeller T(1991)Performance analysis of finite-buffered multistage interconnection networks with a general traffic patternProceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems10.1145/107971.107980(68-78)Online publication date: 2-Apr-1991
https://dl.acm.org/doi/10.1145/107971.107980
Patel N(1991)New protocol for multistage interconnection networksIEE Proceedings E Computers and Digital Techniques10.1049/ip-e.1991.0035138:4(269)Online publication date: 1991
https://doi.org/10.1049/ip-e.1991.0035
Liu JShin KChang C(1995)Prevention of Congestion in Packet-Switched Multistage Interconnection NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.3823226:5(535-541)Online publication date: 1-May-1995
https://dl.acm.org/doi/10.1109/71.382322
Bianchini LeBlanc (1994)Eager combiningProceedings of the 1994 6th IEEE Symposium on Parallel and Distributed Processing10.1109/SPDP.1994.346165(204-213)Online publication date: 26-Oct-1994
https://dl.acm.org/doi/10.1109/SPDP.1994.346165

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On hot-spot contention in interconnection networks

Hot-Spot Contention in Binary Hypercube Networks

High-radix interconnection networks