Mesh connected computers with fixed and reconfigurable buses: Packet routing and sorting

IEEE Transactions on Computers

Volumn 45, Issue 5, 1996, Pages 529-539

  Rajasekaran, Sanguthevar ^a  

^a University of Florida   (United States)

Author keywords

K K routing; K K sorting; Mesh; Mesh with fixed buses; Mesh with reconfigurable buses; Packet routing; Parallel computing; Randomized algorithms; Reconfigurable networks; Sorting

Indexed keywords

EID: 0007722585     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.509905     Document Type: Article

References (34)

1. D. Angluin and L.G. Valiant, "Fast Probabilistic Algorithms for Hamiltonian Paths and Matchings," J. Computer and Systems Science, vol. 18, pp. 155-193, 1979.
2. Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, pp. 139-153, 1991.
3. H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals of Mathematical Statistics, vol. 23, pp. 493-507, 1952.
4. J.C. Cogolludo and S. Rajasekaran, "Permutation Routing on Reconfigurable Meshes," Proc. Int'l Symp. Algorithms and Computation, Lecture Notes in Computer Science 762, pp. 157-166, Springer-Verlag, 1993.
5. J. Jang and V.K. Prasanna, "An Optimal Sorting Algorithm on Reconfigurable Mesh," Proc. Int'l Parallel Processing Symp., pp. 130-137, 1992.
6. J. Jenq and S. Sahni, "Histogramming on a Reconfigurable Mesh Computer," Proc. Int'l Parallel Processing Symp., pp. 425-432, 1992.
7. C. Kaklamanis and D. Krizanc, "Optimal Sorting on Mesh Connected Processor Arrays," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 50-59, 1992.
8. M. Kaufmann, S. Rajasekaran, and J. Sibeyn, "Matching the Bisection Bound for Routing and Sorting on the Mesh," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 31-40, 1992.
9. D. Krizanc, S. Rajasekaran, and S. Shende, "A Comparison of Meshes with Static Buses and Unidirectional Wrap-Arounds," Parallel Processing Letters, vol. 3, no. 2, pp. 109-114, June 1993.
10. V.K.P. Kumar and C.S. Raghavendra, "Array Processor with Multiple Broadcasting," J. Parallel and Distributed Computing, vol. 4, pp. 173-190, 1987.
11. M. Kunde, "Concentrated Regular Data Streams on Grids: Sorting and Routing Near to the Bisection Bound," Proc. IEEE Symp. Foundations of Computer Science, pp. 141-150, 1991.
12. T. Leighton, "Average Case Analysis of Greedy Routing Algorithms on Arrays," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 2-10, July 1990.
13. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, San Mateo, Calif.: Morgan-Kaufmann, 1992.
14. T. Leighton, F. Makedon, and I.G. Tollis, "A 2n - 2 Step Algorithm for Routing in an n x n Array with Constant Size Queues," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 328-335, 1989.
15. J.Y-T. Leung and S.M. Shende, "Packet Routing on Square Meshes with Row and Column Buses," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 834-837, Dec. 1991.
16. R. Miller, V.K. Prasanna-Kumar, D. Reisis, and Q.F. Stout, "Meshes with Reconfigurable Buses," Proc. Fifth MIT Conf. Advanced Research in VLSI, pp. 163-178, 1988.
17. M. Nigam and S. Sahni, "Sorting n Numbers on n x n Reconfigurable Meshes with Buses," Proc. Int'l Parallel Processing Symp., pp. 174-181, 1993.
18. S. Olariu, J.L. Schwing, and J. Zhang, "Fundamental Algorithms on Reconfigurable Meshes," Proc. 29th Allerton Conf. Comm., Control, and Computing, pp. 811-820, 1991.
19. C.S. Raghavendra and V.K.P. Kumar, "Permutations on Illiac IV-Type Networks," IEEE Trans. Computers, vol. 35, pp. 662-669, 1986.
20. S. Rajasekaran, "Sorting and Selection on Interconnection Networks," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 21, pp. 275-296, 1995.
21. S. Rajasekaran, "Randomized Parallel Selection," Proc. 10th Int'l Conf. Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 472, pp. 215-224, Springer-Verlag, 1990.
22. S. Rajasekaran, "k - k Routing, k - k Sorting, and Cut Through Routing on the Mesh," to appear, J. Algorithms, 1995.
23. S. Rajasekaran, "Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection," Proc. First Ann. European Symp. Algorithms, Lecture Notes in Computer Science 726, pp. 309-320, Springer-Verlag, 1993.
24. S. Rajasekaran and T. McKendall, "Permutation Routing and Sorting on the Reconfigurable Mesh," Technical Report MS-CTS-92-36, Dept. of Computer and Information Science, Univ. of Pennsylvania, May 1992.
25. S. Rajasekaran and R. Overholt, "Constant Queue Routing on a Mesh," Proc. Symp. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 480, pp. 444-455, Springer-Verlag, 1990.
26. Also in J. Parallel and Distributed Computing, vol. 15, pp. 160-166, 1992.
27. S. Rajasekaran, and M. Raghavachari, "Optimal Randomized Algorithms for Multipacket and Cut Through Routing on the Mesh," J. Parallel and Distributed Computing, vol. 26, pp. 257-260, 1995.
28. S. Rajasekaran and J.H. Reif, "Derivation of Randomized Sorting and Selection Algorithms," Parallel Algorithm Derivation And Program Transformation, Paige, Reif, and Wachter, eds., pp.187-205, Kluwer Academic, 1993.
29. S. Rajasekaran and Th. Tsantilas, "Optimal Routing Algorithms for Mesh-Connected Processor Arrays," Algorithmica, 8, pp. 21-38, 1992.
30. J.H. Reif and L.G. Valiant, "A Logarithmic Time Sort for Linear Size Networks," J. ACM, vol. 34, no. 1, pp. 60-76, 1987.
31. C.P. Schnorr and A. Shamir, "An Optimal Sorting Algorithm for Mesh Connected Computers," Proc. 18th ACM Symp. Theory of Computing, pp. 255-263, 1986.
32. A. Schuster, "Dynamic Reconfiguring Networks for Parallel Computers: Algorithms and Complexity Bounds," PhD thesis, Computer Science Dept., Technion-Israel Inst. of Technology, Aug. 1991.
33. Q.F. Stout, "Meshes with Multiple Buses," Proc. IEEE Symp. Foundations of Computer Science, pp. 264-273, 1986.
34. L.G. Valiant, "Parallelism in Comparison Problems," SIAM J. Computing, vol. 14, pp. 348-355, 1985.