article

Free access

An optimal routing algorithm for mesh-connected Parallel computers

Authors:

David Nassimi,

Sartaj SahniAuthors Info & Claims

Journal of the ACM (JACM), Volume 27, Issue 1

Pages 6 - 29

https://doi.org/10.1145/322169.322172

Published: 01 January 1980 Publication History

PDF eReader

References

[1]

BARNES, G H, ET AL The ILLIAC IV computer. IEEE Trans Comptrs C-17, 8 (1968), 746-757

Google Scholar

[2]

BATCHER, K E Sorting networks and their apphcauons Proc AFIPS 1968 SJCC, Vol 32, AFIPS Press, Montvale, N J, pp 307-314

Google Scholar

[3]

BENES, V E MathematzcaI Theory of Connecting Networks and Telephone Traffic Academic Press, New York, 1965

Google Scholar

[4]

CSANKY, L Fast parallel matrix mvers~on algorithms 16th Annual IEEE Symp on Foundauons of Computer Sctence, Berkeley, Cahf, 1975, pp 11-12

Google Scholar

[5]

FLYNN, M j Very h~gh-speed computing systems. Proc IEEE 54 (1966), 1901-1909

Google Scholar

[6]

GENTLEMAN, W M, Some complexity results for matrix computauons on parallel processors J A CM 25. 1 (Jan 1978), 112-115

Crossref

Google Scholar

[7]

LANG, T Interconnect~ons between processors and memory modules using the shuffle-exchange network IEEE Trans Comptrs C-25, 5 (1976), 496-503

Google Scholar

[8]

LAWRIE. D E Memory-processor connectton networks Ph D Dtss, U of llhnots at Urbana-Champa~gn, Urbana, Ill, 1973

Crossref

Google Scholar

[9]

NASSIMI, D, AND SAHNI, S Bltomc sort on a mesh-connected parallel computer IEEE Trans Comptrs C- 28, 1 (1979), 2-7

Google Scholar

[10]

NASSIMI, D, AND SAHNI, S An opUmal routing algorithm for mesh-connected parallel computers Tech Rep No 78-19, U of Minnesota, Mmneapohs, Mmn, 1978

Google Scholar

[11]

ORCUTX, S E lmplementatton of permutatton functtons m Ilhac IV-type computers IEEE Trans Comptrs C-25, 9 (1976), 929-936

Google Scholar

[12]

SIEGEL, H J Analys~s techmques for SIMD machine mterconnectton networks and the effects of processor address masks IEEE Trans Comptrs C-26, 2 (1977), 153-161

Google Scholar

[13]

STONE, H S Parallel processing with the perfect shuffle IEEE Trans Comptrs C-20, 2 (1971), 153-161

Google Scholar

[14]

SWANSON, R C lnterconnecuons for parallel memories to unscramble p-ordered vectors IEEE Trans Comptrs. C-23, 11 (1974), 1105-1115

Google Scholar

[15]

THOMPSON, C D Generahzed connection networks for parallel processor mtercommumcauon IEEE Trans Comptrs C-27, 12 (1978), 1119-1125

Google Scholar

[16]

THOMPSON, C D, AND KUNG, H T Sorting on a mesh-connected parallel computer Comm.4CM 20, 4 (1977), 263-271

Crossref

Google Scholar

[17]

WAKSMAN, A A permutatton network J ACM 15, 1 (Jan 1968), 159-163

Crossref

Google Scholar

Cited By

View all

Jeong CLee D(2023)Parallel geometric algorithms on a mesh-connected computerAlgorithmica10.1007/BF018403835:1-4(155-177)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01840383
Chen RPrasanna V(2015)Automatic generation of high throughput energy efficient streaming architectures for arbitrary fixed permutations2015 25th International Conference on Field Programmable Logic and Applications (FPL)10.1109/FPL.2015.7293944(1-8)Online publication date: Sep-2015
https://doi.org/10.1109/FPL.2015.7293944
Gallopoulos EPhilippe BSameh AGallopoulos EPhilippe BSameh A(2015)Banded Linear SystemsParallelism in Matrix Computations10.1007/978-94-017-7188-7_5(91-163)Online publication date: 26-Jul-2015
https://doi.org/10.1007/978-94-017-7188-7_5
Show More Cited By

Index Terms

An optimal routing algorithm for mesh-connected Parallel computers
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems
    2. Parallel algorithms

Recommendations

An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies

A probabilistic routing policy, the Z/sup 2/ (zigzag) routing policy, is presented within the class of nonadaptive, shortest-path routing policies for regular mesh-connected topologies such as n-dimensional toroids and hypercubes. The focus of the ...
A Parallel Algorithm for Volume Projections on SIMD Mesh-Connected Computers

Projections are widely used in machine vision, volume rendering, and computer graphics. For applications with 3D volume data, we design a parallel projection algorithm on SIMD mesh-connected computers and implement the algorithm on the Parallel ...
Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies"

S. Badr and P. Podar (1989) introduced a zig-zag routing policy and showed its optimality for shortest-path routing on square or infinite grid networks with independent link failures. This paper shows that, contrary to the claim of Badr and Podar, a zig-...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 27, Issue 1

Jan. 1980

205 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322169

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1980

Published in JACM Volume 27, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

111
Total Citations
View Citations
688
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)11

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jeong CLee D(2023)Parallel geometric algorithms on a mesh-connected computerAlgorithmica10.1007/BF018403835:1-4(155-177)Online publication date: 22-Mar-2023
https://dl.acm.org/doi/10.1007/BF01840383
Chen RPrasanna V(2015)Automatic generation of high throughput energy efficient streaming architectures for arbitrary fixed permutations2015 25th International Conference on Field Programmable Logic and Applications (FPL)10.1109/FPL.2015.7293944(1-8)Online publication date: Sep-2015
https://doi.org/10.1109/FPL.2015.7293944
Gallopoulos EPhilippe BSameh AGallopoulos EPhilippe BSameh A(2015)Banded Linear SystemsParallelism in Matrix Computations10.1007/978-94-017-7188-7_5(91-163)Online publication date: 26-Jul-2015
https://doi.org/10.1007/978-94-017-7188-7_5
Bernhard PRosenkrantz D(2009)An efficient method for representing and transmitting message patterns on multiprocessor interconnection networksFundamental Problems in Computing10.1007/978-1-4020-9688-4_6(133-162)Online publication date: 2009
https://doi.org/10.1007/978-1-4020-9688-4_6
Ceterchi RPérez-Jiménez MTomescu A(2007)Simulating the bitonic sort using P systemsProceedings of the 8th international conference on Membrane computing10.5555/1781854.1781867(172-192)Online publication date: 25-Jun-2007
https://dl.acm.org/doi/10.5555/1781854.1781867
Ceterchi RPérez-Jiménez MTomescu A(2007)Simulating the Bitonic Sort Using P SystemsMembrane Computing10.1007/978-3-540-77312-2_11(172-192)Online publication date: 2007
https://doi.org/10.1007/978-3-540-77312-2_11
Clint MPerrott RHolt CStewart A(2006)The influence of hardware and software considerations on the design of synchronous parallel algorithmsSoftware: Practice and Experience10.1002/spe.438013100713:10(961-974)Online publication date: 30-Oct-2006
https://doi.org/10.1002/spe.4380131007
Tzvieli D(2006)Minimal diameter double‐loop networks. I. Large infinite optimal familiesNetworks10.1002/net.323021040321:4(387-415)Online publication date: 11-Oct-2006
https://doi.org/10.1002/net.3230210403
Rajasekaran STsantilas T(2005)An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networksFoundations of Software Technology and Theoretical Computer Science10.1007/3-540-18625-5_53(226-241)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-18625-5_53
Datta ASoundaralakshmi S(2003)Summation and routing on a partitioned optical passive stars network with large group sizeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2003.125563914:12(1275-1285)Online publication date: 1-Dec-2003
https://dl.acm.org/doi/10.1109/TPDS.2003.1255639
Show More Cited By

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.

References

Cited By

Index Terms

Recommendations

An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies

A Parallel Algorithm for Volume Projections on SIMD Mesh-Connected Computers

Comments on "An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies"

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations