Sorting, selection, and routing on the Array with Reconfigurable Optical Buses

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 11, 1997, Pages 1123-1132

  Rajasekaran, Sanguthevar ^a,b   Sahni, Sartaj ^a,b  

^a IEEE   (United States)

^b University of Florida   (United States)

Author keywords

Comparison problems; Interprocessor communication; Mesh connected computers; Optical computing; Reconfigurable networks; Sorting

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; OPTICAL DEVICES; PARALLEL ALGORITHMS; RANDOM PROCESSES; SORTING;

ARRAY WITH RECONFIGURABLE OPTICAL BUSES (AROB);

PARALLEL PROCESSING SYSTEMS;

EID: 0031276998     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.642947     Document Type: Article

References (31)

1. R.J. Anderson and G.L. Miller, "Optical Communication for Pointer Based Algorithms," Technical Report CRI-88-14, Computer Science Dept. Univ. of Southern California, 1988.
2. M. Baumslag and F. Annexstein, "A Unified Framework for Off-Line Permutation Routing in Parallel Networks," Mathematical Systems Theory, vol. 24, pp. 233-251, 1991.
3. P. Beame and J. Hastad, "Optimal Bounds for Decision Problems on the CRCW PRAM," J. ACM, vol. 36, no. 3, pp. 643-670, 1989.
4. Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, pp. 139-153, 1991.
5. R. Bopanna, "A Lower Bound for Sorting on the Parallel Comparison Tree," Information Processing Letters, 1989.
6. H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals Math. Statistics, vol. 2, pp. 241-256, 1952.
7. R.W. Floyd and R.L. Rivest, "Expected Time Bounds for Selection," Comm. ACM, vol. 18, no. 3, pp. 165-172, 1975.
8. M. Geréb-Graus and T. Tsantilas, "Efficient Optical Communication in Parallel Computers," Proc. Symp. Parallel Algorithms and Architectures, pp. 41-48, 1992.
9. L. Goldberg, M. Jerrum, T. Leighton, and S. Rao, "A Doubly-Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer," Proc. Symp. Parallel Algorithms and Architectures, pp. 300-309, 1993.
10. E. Hao, P.D. McKenzie, and Q.F. Stout, "Selection on the Reconfigurable Mesh," Proc. Frontiers of Massively Parallel Computation, pp. 38-45, 1992.
11. E. Horowitz and S. Sahni, Fundamentals of Computer Algorithms. Computer Science Press, 1978.
12. J. Jang and V.K. Prasanna, "An Optimal Sorting Algorithm on Reconfigurable Mesh," Proc. Int'l Parallel Processing Symp., pp. 130-137, 1992.
13. J. Jenq and S. Sahni, "Reconfigurable Mesh Algorithms for Image Shrinking, Expanding, Clustering, and Template Matching," Proc. Int'l Parallel Processing Symp., pp. 208-215, 1991.
14. T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, no. 4, pp. 344-354, Apr. 1985.
15. R. Lin and S. Olariu, "Reconfigurable Buses with Shift Switching: Concepts and Applications," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 1, pp. 93-102, Jan. 1995.
16. R. Lin, S. Olariu, J.L. Schwine, and J. Zhang, "Sorting in O(1) Time on a Reconfigurable Mesh of Size Nx N," Proc. European Workshop Parallel Computing, pp. 16-27, 1992.
17. R.G. Melhem, D.M. Chiarulli, and S.P. Levitan, "Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems," Computer J., vol. 32, no. 4, pp. 362-369, 1989.
18. R. Miller, V.K. Prasanna-Kumar, D. Reisis, and Q.F. Stout, "Meshes with Reconfigurable Buses," IEEE Trans. Computers, vol. 42, pp. 678-692, 1993.
19. D. Nassimi and S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms," IEEE Trans. Computers, vol. 30, no. 5, pp. 332-340, May 1981.
20. 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.
21. S. Olariu, J.L. Schwing, and J. Zhang, "Integer Problems on Reconfigurable Meshes, with Applications," Proc. 1991 Allerton Conf., vol. 4, pp. 821-830, 1991.
22. Y. Pan, "Order Statistics on Optically Interconnected Multiprocessor Systems," Proc. First Int'l Workshop Massively Parallel Processing Using Optical Interconnections, pp. 162-169, 1994.
23. S. Pavel and S.G. Akl, "Matrix Operations Using Arrays with Reconfigurable Optical Buses," manuscript, 1995.
24. S. Rajasekaran, "Meshes with Fixed and Reconfigurable Buses: Packet Routing, Sorting and Selection," Proc. First Ann. European Symp. Algorithms, Lecture Notes in Computer Science, vol. 726, pp. 309-320. Springer-Verlag, 1993.
25. S. Rajasekaran, "Sorting and Selection on Interconnection Networks," Proc. DIMACS Workshop Interconnection Networks and Mapping and Scheduling Parallel Computation, 1995.
26. S. Rajasekaran and J.H. Reif, "Derivation of Randomized Sorting and Selection Algorithms," Parallel Algorithm Derivation and Program Transformation, R. Paige, J.H. Reif, and R. Wachter, eds. , pp. 187-205. Kluwer Academic, 1993.
27. S. Rao and T. Tsantilas, "Optical Interprocessor Communication Protocols," Proc. Workshop Massively Parallel Processing Using Optical Interconnections, pp. 266-274, 1994.
28. S. Sahni, "Data Manipulation on the Distributed Memory Bus Computer," Parallel Processing Letters, 1995.
29. R.K. Thiruchelvan, J.L. Trahan, and R. Vaidyanathan, "On the Power of Segmenting and Fusing Buses," Proc. Int'l Parallel Processing Symp., pp. 79-83, 1993.
30. L.G. Valiant, "General Purpose Parallel Architectures," Handbook of Theoretical Computer Science, vol. A, J. van Leeuwen, ed. North Holland, 1990.
31. L.G. Valiant and G.J. Brebner, "Universal Schemes for Parallel Communication," Proc. 13th Ann.ACM Symp. Theory of Computing, pp. 263-277, 1981.