This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
November 1997 (vol. 8 no. 11)
pp. 1123-1132
ASCII Text
x 
 
Sanguthevar Rajasekaran, Sartaj Sahni, "Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123-1132, November, 1997.
 
 
BibTex
x
 
@article{ 10.1109/71.642947,
author = {Sanguthevar Rajasekaran and Sartaj Sahni},
title = {Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {8},
number = {11},
issn = {1045-9219},
year = {1997},
pages = {1123-1132},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.642947},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IS - 11
SN - 1045-9219
SP1123
EP1132
EPD - 1123-1132
A1 - Sanguthevar Rajasekaran,
A1 - Sartaj Sahni,
PY - 1997
KW - Reconfigurable networks
KW - optical computing
KW - mesh-connected computers
KW - comparison problems
KW - interprocessor communication
KW - sorting.
VL - 8
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—In this paper, we present efficient algorithms for sorting, selection, and packet routing on the AROB (Array with Reconfigurable Optical Buses) model. One of our sorting algorithms sorts n general keys in O(1) time on an AROB of size $n^\epsilon \times n$ for any constant $\epsilon > 0.$ We also show that selection from out of n elements can be done in randomized O(1) time employing n processors. Our routing algorithm can route any h-relation in randomized O(h) time. All these algorithms are clearly optimal.

[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. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139-153, Oct. 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. MacLenzie, and Q.F. Stout, "Selection on the Reconfigurable Mesh," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 38-45, 1992.
[11] T.H. 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, Mar. 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 N×N," Proc. European Workshop Parallel Computing, pp. 16-27, 1992.
[17] R. Melhem, D. Chiarulli, and S. Levitan, “Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems,” The Computer J., vol. 32, no. 4, pp. 362-369, 1989.
[18] R. Miller,V.K. Prasanna Kumar,D.I. Reisis, and Q.F. Stout,“Parallel computations on reconfigurable meshes,” IEEE Trans. on Computers, pp. 678-692, June 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. Rajashekaran,“Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting and Selection,” Manuscript, Dept. of CIS, Univ. of Pennsylvania, Oct. 1993. Also, appears at the First Ann. European Symp. on Algorithms, 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. of Int’l Parallel Processing Symp., pp. 79-83, Apr. 1993.
[30] L.G. Valiant, “General Purpose Parallel Architectures,” Handbook of Theoretical Computer Science, J. van Leeuwen, ed., pp. 944-971, NorthHolland, 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, May 1981.

Index Terms:
Reconfigurable networks, optical computing, mesh-connected computers, comparison problems, interprocessor communication, sorting.
Citation:
Sanguthevar Rajasekaran, Sartaj Sahni, "Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 11, pp. 1123-1132, Nov. 1997, doi:10.1109/71.642947
Usage of this product signifies your acceptance of the Terms of Use.