chapter

Optimal routing algorithms for mesh-connected processor arrays (extended abstract)

Authors:

D. Krizanc,

S. Rajasekaran,

T. TsantilasAuthors Info & Claims

VLSI Algorithms and Architectures

August 1988

Pages 411 - 422

Published: 01 August 1988 Publication History

Abstract

No abstract available.

Cited By

View all

Rehrmann RMonien BLüling RDiekmann RBlelloch G(1996)On the communication throughput of buffered multistage interconnection networksProceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures10.1145/237502.237521(152-161)Online publication date: 24-Jun-1996
https://dl.acm.org/doi/10.1145/237502.237521
Kaklamanis CKrizanc DRao SSnyder L(1993)Hot-potato routing on processor arraysProceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures10.1145/165231.376321(273-282)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/165231.376321
Kaklamanis CKrizanc DSnyder L(1992)Optimal sorting on mesh-connected processor arraysProceedings of the fourth annual ACM symposium on Parallel algorithms and architectures10.1145/140901.140907(50-59)Online publication date: 1-Jun-1992
https://dl.acm.org/doi/10.1145/140901.140907
Show More Cited By

Index Terms

Optimal routing algorithms for mesh-connected processor arrays (extended abstract)
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Multithread Reconfiguration Algorithm for Mesh-Connected Processor Arrays
PDCAT '12: Proceedings of the 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies

Mesh-connected processor array is a popular architecture used in parallel processing. Extensive studies have been conducted on reconfiguration algorithms for the processor arrays with faults, but few work is on parallel algorithm to accelerate the ...
Testing and reconfiguration techniques for vlsi processor arrays
Parallel reconfiguration algorithms for mesh-connected processor arrays

Effective fault tolerance techniques are essential for improving the reliability of multiprocessor systems. At the same time, fault tolerance must be achieved at high speed to meet the real-time constraints of embedded systems. While parallelism has ...

Comments

Information & Contributors

Information

Published In

VLSI Algorithms and Architectures

August 1988

476 pages

ISBN:0387968180

Editors:
J. H. Rief
Duke Univ., Durham, NC
,
G. Goos
Univ. Karlsruhe, Karlsruhe, W. Germany
,
J. Hartmanis
Cornell Univ., Ithaca, NY

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 August 1988

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Rehrmann RMonien BLüling RDiekmann RBlelloch G(1996)On the communication throughput of buffered multistage interconnection networksProceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures10.1145/237502.237521(152-161)Online publication date: 24-Jun-1996
https://dl.acm.org/doi/10.1145/237502.237521
Kaklamanis CKrizanc DRao SSnyder L(1993)Hot-potato routing on processor arraysProceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures10.1145/165231.376321(273-282)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/165231.376321
Kaklamanis CKrizanc DSnyder L(1992)Optimal sorting on mesh-connected processor arraysProceedings of the fourth annual ACM symposium on Parallel algorithms and architectures10.1145/140901.140907(50-59)Online publication date: 1-Jun-1992
https://dl.acm.org/doi/10.1145/140901.140907
Kaufmann MRajasekaran SSibeyn JSnyder L(1992)Matching the bisection bound for routing and sorting on the meshProceedings of the fourth annual ACM symposium on Parallel algorithms and architectures10.1145/140901.140905(31-40)Online publication date: 1-Jun-1992
https://dl.acm.org/doi/10.1145/140901.140905
Makedon FSimvonis AHwang CBrice R(1991)Many-to-one packet routing on the meshProceedings of the 19th annual conference on Computer Science10.1145/327164.327281(280-288)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/327164.327281
Kunde MLeighton T(1991)Balanced routingProceedings of the third annual ACM symposium on Parallel algorithms and architectures10.1145/113379.113403(260-271)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/113379.113403
Kaklamanis CKrizanc DNarayanan LTsantilas TLeighton T(1991)Randomized sorting and selection on mesh-connected processor arrays (preliminary version)Proceedings of the third annual ACM symposium on Parallel algorithms and architectures10.1145/113379.113381(17-28)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/113379.113381
Kaklamanis CKrizanc DTsantilas TLeighton F(1990)Tight bounds for oblivious routing in the hypercubeProceedings of the second annual ACM symposium on Parallel algorithms and architectures10.1145/97444.97453(31-36)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/97444.97453
Leighton FLeighton F(1990)Average case analysis of greedy routing algorithms on arraysProceedings of the second annual ACM symposium on Parallel algorithms and architectures10.1145/97444.97448(2-10)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/97444.97448
Kunde MTensi T(1989)Multi-packet-routing on mesh connected arraysProceedings of the first annual ACM symposium on Parallel algorithms and architectures10.1145/72935.72971(336-343)Online publication date: 1-Mar-1989
https://dl.acm.org/doi/10.1145/72935.72971

View Options

View options

Get Access

Login options

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

Abstract

Cited By

Index Terms

Recommendations

Multithread Reconfiguration Algorithm for Mesh-Connected Processor Arrays

Testing and reconfiguration techniques for vlsi processor arrays

Parallel reconfiguration algorithms for mesh-connected processor arrays

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations