Abstract
Many problems can be solved more efficiently on a mesh of trees network than on a mesh. Until now it has been an open problem whether the mesh of trees is always at least as fast as the mesh. In this paper, we present an emulation of N-node meshes on O(N)-node meshes of trees with constant slowdown, even though any embedding of a mesh into a mesh of trees requires dilation Ω(log N). This demonstrates that the mesh of trees is strictly more powerful than the mesh. As an application, we show how to construct an optimal O(√N) sorting algorithm for the mesh of trees that improves on the best previously known algorithm by a logarithmic factor.
This work was supported by the Graduiertenkolleg ”Controllability of Complex Systems” (DFG Vo 287/5-2)
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. N. Bhatt, F. R. K. Chung, J.-W. Hong, F. T. Leighton, and A. L Rosenberg. Optimal simulations by butterfly networks. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 192–204, May 1988.
Christos Kaklamanis, Danny Krizanc, and Satish Rao. New graph decompositions and fast emulations in hypercubes and butterflies. In 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 93), pages 325–334. ACM SIGACT, ACM SIGARCH, ACM Press, June 1993.
Christos Kaklamanis, Danny Krizanc, and Satish Rao. Universal emulations with sublogarithmic slowdown. In Proceedings of the 34th IEEE Symposium Foundations of Computer Science (FOCS), pages 341–350, 1993.
Richard R. Koch, F. T. Leighton, Bruce Maggs, Satish B. Rao, and Arnold L. Rosenberg. Work-preserving emulations of fixed-connection networks. In Proceedings of the 21st Symposium on Theory of Computation, pages 227–240, May 1989. Extended abstract.
M. Kunde. Routing and sorting on mesh-connected arrays. In J. Reif, editor, Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, volume 319 of Lecture Notes in Computer Science, pages 423–433. Springer-Verlag, July 1988.
F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes, volume I. Morgan Kaufmann, San Mateo, CA 94403, 1992.
Tom Leighton, Bruce Maggs, and Ramesh Sitamaran. On the fault tolerance of some popular bounded-degree networks. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 542–552, October 1992.
Friedhelm Meyer auf der Heide. Efficient simulations among several models of parallel computers. SIAM Journal on Computing, 15(1):106–119, February 1986.
Friedhelm Meyer auf der Heide and Rolf Wanka. Time-optimal simulations of networks by universal parallel computers. In Proceedings of the 6th STACS, pages 120–131, 1989.
C. Schnorr and A. Shamir. An optimal sorting algorithm for mesh connected computers. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 255–263, May 1986.
Eric J. Schwabe. On the computational equivalence of hypercube-derived networks. In 2nd Annual ACM Symposium on Parallel Algorithms and Arichitectures, pages 388–397. ACM, ACM Press, July 1990.
C. Thompson and H. Kung. Sorting on a mesh-connected parallel computer. Communications of the ACM, 20(4):263–271, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Achilles, AC. (1995). Optimal emulation of meshes on meshes of trees. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020465
Download citation
DOI: https://doi.org/10.1007/BFb0020465
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive