Abstract
Mesh connected computers have become attractive models of computing because of their varied special features. In this paper we consider two variations of the mesh model: 1) a mesh with fixed buses, and 2) a mesh with reconfigurable buses. Both these models have been the subject matter of extensive previous research. We solve numerous important problems related to packet routing, sorting, and selection on these models. In particular, we provide lower bounds and very nearly matching upper bounds for the following problems on both these models: 1) Routing on a linear array; and 2) k-k routing, k-k sorting, and cut through routing on a 2D mesh for any k≥12. In addition we present greedy algorithms for 1-1 routing, k-k routing, cut through routing, and k-k sorting that are better on average and supply matching lower bounds. We also show that sorting can be performed in logarithmic time on a mesh with fixed buses. As a consequence we present an optimal randomized selection algorithm. Further, we provide a selection algorithm for the mesh with reconfigurable buses whose time bound is significantly better than the existing ones. Most of our algorithms have considerably better time bounds than known algorithms for the same problems.
This research was supported in part by an NSF Research Initiation Award CCR-92-09260 and an ARO grant DAAL03-89-C-0031.
Preview
Unable to display preview. Download preview PDF.
References
Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, The Power of Reconfiguration, Journal of Parallel and Distributed Computing, 1991, pp. 139–153.
Y-C. Chen, W-T. Chen, and G-H. Chen, Efficient Median Finding and Its Application to Two-Variable Linear Programming on Mesh-Connected Computers with Multiple Broadcasting, Journal of Parallel and Distributed Computing 15, 1992, pp. 79–84.
D.P. Doctor and D. Krizanc, Three Algorithms for Selection on the Reconfigurable Mesh, Technical Report TR-219, School of Computer Science, Carleton University, February 1993.
E. Hao, P.D. McKenzie and Q.F. Stout, Selection on the Reconfigurable Mesh, Proc. Frontiers of Massively Parallel Computation, 1992.
J. Jang, H. Park, and V.K. Prasanna, A Fast Algorithm for Computing Histograms on a Reconfigurable Mesh, Proc. Frontiers of Massively Parallel Computing, 1992, pp. 244–251.
C. Kaklamanis, D. Krizanc, L. Narayanan, and Th. Tsantilas, Randomized Sorting and Selection on Mesh Connected Processor Arrays, Proc. ACM Symposium on Parallel Algorithms and Architectures, 1991.
V.K.P. Kumar and C.S. Raghavendra, Array Processor with Multiple Broadcasting, Journal of Parallel and Distributed Computing 4, 1987, pp. 173–190.
T. Leighton, Average Case Analysis of Greedy Routing Algorithms on Arrays, in Proc. ACM Symposium on Parallel Algorithms and Architectures, pp. 2–10, July 1990.
J. Y-T. Leung and S. M. Shende, Packet Routing on Square Meshes with Row and Column Buses, in Proc. IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, Dec. 1991, pp. 834–837.
R. Miller, V.K. Prasanna-Kumar, D. Reisis, and Q.F. Stout, Meshes with Reconfigurable Buses, in Proc. 5th MIT Conference on Advanced Research in VLSI, 1988, pp. 163–178.
S. Rajasekaran, Randomized Parallel Selection, Proc. Tenth International Conference on Foundations of Software Technology and Theoretical Computer Science, 1990. Springer-Verlag Lecture Notes in Computer Science 472, pp. 215–224.
S. Rajasekaran, k-k Routing, k-k Sorting, and Cut Through Routing on the Mesh, Technical Report, Department of CIS, University of Pennsylvania, Philadelphia, PA 19104, October 1991.
S. Rajasekaran, Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection, Technical Report MS-CIS-92-56, Department of CIS, Univ. of Pennsylvania, July 1992.
S. Rajasekaran and T. McKendall, Permutation Routing and Sorting on the Reconfigurable Mesh, Technical Report MS-CIS-92-36, Department of Computer and Information Science, University of Pennsylvania, May 1992.
S. Rajasekaran and Th. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Algorithmica, vol. 8, 1992, pp. 21–38.
Q.F. Stout, Mesh-Connected Computers with Broadcasting, IEEE Trans. Computers 32, 1983, pp. 826–830.
L.G. Valiant, Parallelism in Comparison Problems, SIAM Journal on Computing, vol. 14, 1985, pp. 348–355.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasekaran, S. (1993). Mesh connected computers with fixed and reconfigurable buses: Packet routing, sorting, and selection. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_66
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive