This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References and Suggested Reading
Chlebus, B. S., and M. Kukawka, “A Guide to Sorting on the Mesh-Connected Processor Array,” Computers and Artificial Intelligence, Vol. 9, pp. 599–610, 1990.
Kunde, M., “Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound,” Proc. Symp. Foundations of Computer Science, 1991, pp. 141–150.
Leighton, T., “Tight Bounds on the Complexity of Parallel Sorting,” IEEE Trans. Computers, Vol. 34, No. 4, pp. 344–354, April 1985.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan-Kaufmann, 1992.
Nigam, M., and S. Sahni, “Sorting n 2 Numbers on n×n Meshes,” IEEE Trans. Parallel and Distributed Systems, Vol. 6, No. 12, pp. 1221–1225, December 1995.
Scherson, I., S. Sen, and A. Shamir, “Shear-sort: A True Two-Dimensional Sorting Technique for VLSI Networks,” Proc. Int. Conf. Parallel Processing, 1986, pp. 903–908.
Schnorr, C.P. and A. Shamir, “An Optimal Sorting Algorithm for Mesh Connected Computers,” Proc. Symp. Theory of Computing, 1986, pp. 255–263.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Sorting on a 2D Mesh or Torus. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_9
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive