Routing and sorting on mesh-connected arrays

This publication has 10 references indexed in Scilit:

• Lower bounds for sorting on mesh-connected architectures
  Acta Informatica, 1987
• An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks
  Published by Springer Nature ,1987
• The distance bound for sorting on mesh-connected processor arrays is tight
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• An optimal sorting algorithm for mesh connected computers
  Published by Association for Computing Machinery (ACM) ,1986
• Systolic Sorting on a Mesh-Connected Network
  IEEE Transactions on Computers, 1985
• An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
  IEEE Transactions on Computers, 1983
• Universal schemes for parallel communication
  Published by Association for Computing Machinery (ACM) ,1981
• The Design of Special-Purpose VLSI Chips
  Computer, 1980
• Bitonic Sort on a Mesh-Connected Parallel Computer
  IEEE Transactions on Computers, 1979
• Sorting on a mesh-connected parallel computer
  Communications of the ACM, 1977