Article

Free access

Increasing network bandwidth on meshes

Authors:

Jerry Stamatopoulos,

Jon A. SolworthAuthors Info & Claims

SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

Pages 336 - 345

https://doi.org/10.1145/181014.181442

Published: 01 August 1994 Publication History

Abstract

In bandwidth limited computers, such as meshes and tori, it is important to achieve high bandwidth across the bisection. Traditional techniques achieve bandwidth in the range of 30–70%. We show how to use barriers, in particular Integrated Network Barriers to achieve high bandwidth utilization which is arbitrarily close to 100%. This technique also provides low latency and fairness to processors. Moreover, it works globally and therefore is not dependent on local approximations of network traffic.

References

[1]

Robert Alverson, David Callahan, Daniel Cummings, Brian Koblenz, Allan Porterfield, and Burton Smith. The tera computer system. In Proceedings of Supercomputing '90, pages 1-6. ACM, 1990.

Digital Library

[2]

Mohan Ahuja. Flush primatives for asynchronous distributed systems, in information Processing Letters, 1990.

Digital Library

[3]

Rajendra V. Boppana and Suresh Chalasani. A comparison of adaptive wormhole routing algorithms. In Proceedings o} the 20th Annual International Symposium on Computer Architecture, pages 351-360, May 1993.

Digital Library

[4]

Yitzhak Birk, Phillip B. Gibbons, Jorge L. C. Sanz, and Danny Soroker. A simple mechanism for efficient barrier synchronization in MIMD machines. In Proceedings of the 1990 International Conference on Parallel Processing, 1990.

[5]

Gianfranco Bilardi and Franco P. Preparata. Horizons of parallel computation. Technical Report CS-93-20, Deparment of Computer Science, Brown University, May 1993.

Digital Library

[6]

intel Corporation. A touchstone delta system description. Technical report, Intel, 1991.

[7]

Christopher J. Glass and Lionel Li. The turn model for adaptive routing. In Proceedings of the 19th Annual International Symposium on Computer Architecture, May 1992.

Digital Library

[8]

W. Daniel Hillis. The Connection Machine. The MIT Press, Cambridge, Mass., 1985.

Digital Library

[9]

P. Kermani and Leonard Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3, 1979.

[10]

Manoj Kumar and Gregory F. Pfister. The onset of hot spot contention, in International Conference on Parallel Processing, pages 28-34, August 1986.

[11]

S.S. Lain and M. Reiser. Congestion control of store-and-forward networks by input buffer limits- an analysis. IEEE Trans. on Communications, 27(1), January 1979.

[12]

Michael D. Noakes, Deborah A. Wallach, and William J. Dally. The j-machine multicomputer: An architectural evaluation, in Proceedings of the POth Annual International Symposium on Computer Architecture, May 1993.

Digital Library

[13]

Abhiram G. Ranade. How to emulate shared memory. In Proceedings on FOCS, pages 185- 194, 1987.

Digital Library

[14]

C.L. Seitz, W. C. Athas, C. M. Flaig, A. J. Martin, J. Seizovic, C. S. Steele, and W.-K. Su. The architecture and programming of the ametek series 2010 multicomputer. In Proceedings of the Third Con/erence on Hypercube concurrent Computers and Applications, volume I, pages 33-36. ACM, January 1988.

Digital Library

[15]

Burton J. Smith. Architecture and applications of the HEP multiprocessor computer system. Real Time Signal Processing IV, Proceedings of SPIE, 298:241-248, 1981.

[16]

Steven L. Scott and Gurindar S. Sohi. Using feedback to control tree saturation in multistage interconnection networks, in International Symposium on Computer Architecture, pages 167-176, May 1989.

Digital Library

[17]

Jon A. Solworth and Jerry Stamatopoulos. Integrated network barriers for D-dimensional meshes. In IFIP Working Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism, pages 179-190, Orlando, Florida, January 1993.

Digital Library

Cited By

Solworth J(2002)Integrated Network BarriersIEEE Transactions on Parallel and Distributed Systems10.1109/71.99581413:4(337-348)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1109/71.995814
Kavas AEr-El DFeitelson D(2001)Using multicast to pre-load jobs on the ParPar clusterParallel Computing10.1016/S0167-8191(00)00101-027:3(315-327)Online publication date: 1-Feb-2001
https://dl.acm.org/doi/10.1016/S0167-8191%2800%2900101-0
Hinrichs S(1996)Synchronization elimination in the deposit modelProceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing10.1109/ICPP.1996.538563(87-94)Online publication date: 1996
https://doi.org/10.1109/ICPP.1996.538563
Show More Cited By

Index Terms

Increasing network bandwidth on meshes

Recommendations

Providing cost-effective on-chip network bandwidth in GPGPUs
ICCD '12: Proceedings of the 2012 IEEE 30th International Conference on Computer Design (ICCD 2012)

Network-on-chip (NoC) bandwidth has a significant impact on overall performance in throughput-oriented processors such as GPG-PUs. Although it has been commonly assumed that high NoC bandwidth can be provided through abundant on-chip wires, we show that ...
Increasing the throughput of an adaptive router in network-on-chip (NoC)
CODES+ISSS '06: Proceedings of the 4th international conference on Hardware/software codesign and system synthesis

In this paper, we propose a simple and efficient mechanism to increase the throughput of an adaptive router in Network-on-Chip (NoC). One of the most serious disadvantages of fully adaptive wormhole routers is its performance degradation due to the ...
Multi-mapping Meshes: A New Communicating Fabric for Networks-on-Chip
ICPADS '10: Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems

Traditional mesh is a popular interconnection architecture for Networks-on-Chip (NoCs). However, with the trend towards larger number of cores in chip multiprocessors, it is unable to stand the fast-growing diameter and average distance in meshes. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '94: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures

August 1994

374 pages

ISBN:0897916719

DOI:10.1145/181014

Chairmen:
Lawrence Snyder
Univ. of Washington, Seattle
,
Charles E. Leiserson
Massachusetts Institute of Technology, Cambridge

Copyright © 1994 ACM.

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]

Sponsors

European Comp Soc: European Computer Society
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

6SPAA94

Sponsor:

European Comp Soc
SIGACT
SIGARCH

6SPAA94: 6th Annual ACM Symposium on Parallel Algorithms and Architectures

June 27 - 29, 1994

New Jersey, Cape May, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
33
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Solworth J(2002)Integrated Network BarriersIEEE Transactions on Parallel and Distributed Systems10.1109/71.99581413:4(337-348)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1109/71.995814
Kavas AEr-El DFeitelson D(2001)Using multicast to pre-load jobs on the ParPar clusterParallel Computing10.1016/S0167-8191(00)00101-027:3(315-327)Online publication date: 1-Feb-2001
https://dl.acm.org/doi/10.1016/S0167-8191%2800%2900101-0
Hinrichs S(1996)Synchronization elimination in the deposit modelProceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing10.1109/ICPP.1996.538563(87-94)Online publication date: 1996
https://doi.org/10.1109/ICPP.1996.538563
Stamatopoulos JSolworth JLeiserson C(1995)Universal congestion control for meshesProceedings of the seventh annual ACM symposium on Parallel algorithms and architectures10.1145/215399.215438(165-174)Online publication date: 20-Jul-1995
https://dl.acm.org/doi/10.1145/215399.215438

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents