research-article

Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

Authors:

Sanguthevar Rajasekaran,

Sartaj SahniAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 8, Issue 11

Pages 1123 - 1132

https://doi.org/10.1109/71.642947

Published: 01 November 1997 Publication History

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.

References

[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.

Digital Library

[4]

Y. Ben-Asher D. Peleg R. Ramaswami and A. Schuster, "The Power of Reconfiguration," J. Parallel and Distributed Computing, pp. 139-153, 1991.

Digital Library

[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.

Digital Library

[8]

M. Geréb-Graus and T. Tsantilas, "Efficient Optical Communication in Parallel Computers," Proc. Symp. Parallel Algorithms and Architectures, pp. 41-48, 1992.

Digital Library

[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.

Digital Library

[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.

Digital Library

[12]

J. Jang and V.K. Prasanna, "An Optimal Sorting Algorithm on Reconfigurable Mesh," Proc. Int'l Parallel Processing Symp., pp. 130-137, 1992.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[20]

M. Nigam and S. Sahni, "Sorting n Numbers on n × 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.

Digital Library

[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.

Digital Library

[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.

Digital Library

Cited By

He MWu XZheng S(2009)An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus systemComputers and Electrical Engineering10.1016/j.compeleceng.2008.11.02035:6(951-965)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1016/j.compeleceng.2008.11.020
Rajasekaran S(2005)Efficient Parallel Hierarchical Clustering AlgorithmsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2005.7216:6(497-502)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.1109/TPDS.2005.72
Wang YHorng SWu C(2005)Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus SystemIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2005.3316:3(193-206)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1109/TPDS.2005.33
Show More Cited By

Index Terms

Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses

Recommendations

Randomized Routing, Selection, and Sorting on the OTIS-Mesh

The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In this paper we present efficient algorithms for packet routing, sorting, and ...
(C) Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses
ICPP '96: Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2

Abstract: We present deterministic algorithms for integer sorting and on-line packet routing on arrays with reconfigurable optical buses. The main objective is to identify the mechanisms specific to this type of architecture which allow building ...
Fast sorting algorithms on reconfigurable array of processors with optical buses
ICPADS '96: Proceedings of the 1996 International Conference on Parallel and Distributed Systems

The Reconfigurable Array with Spanning Optical Buses (RASOB) has recently received a lot of attention from the research community. By taking advantage of the unique properties of optical transmission, the RASOB provides flexible reconfiguration and ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 8, Issue 11

November 1997

95 pages

ISSN:1045-9219

Editor:
Duncan H. Lawrie
Univ. of Illinois at Urbana-Champaign, Urbana

Issue’s Table of Contents

Copyright © Copyright © 1997 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 November 1997

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

He MWu XZheng S(2009)An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus systemComputers and Electrical Engineering10.1016/j.compeleceng.2008.11.02035:6(951-965)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.1016/j.compeleceng.2008.11.020
Rajasekaran S(2005)Efficient Parallel Hierarchical Clustering AlgorithmsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2005.7216:6(497-502)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.1109/TPDS.2005.72
Wang YHorng SWu C(2005)Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus SystemIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2005.3316:3(193-206)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1109/TPDS.2005.33
Bourgeois APan YPrasad S(2005)Constant time fault tolerant algorithms for a linear array with a reconfigurable pipelined bus systemJournal of Parallel and Distributed Computing10.1016/j.jpdc.2004.11.00265:3(374-381)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1016/j.jpdc.2004.11.002
Datta A(2004)Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus SystemThe Journal of Supercomputing10.1023/B:SUPE.0000032783.66123.6329:3(303-317)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1023/B%3ASUPE.0000032783.66123.63
Katsinis CNabet B(2004)A Scalable Interconnection Network Architecture for Petaflops ComputingThe Journal of Supercomputing10.1023/B:SUPE.0000009318.91562.b027:2(103-128)Online publication date: 1-Feb-2004
https://dl.acm.org/doi/10.1023/B%3ASUPE.0000009318.91562.b0
Bader D(2004)An improved, randomized algorithm for parallel selection with an experimental studyJournal of Parallel and Distributed Computing10.1016/j.jpdc.2004.06.01064:9(1051-1059)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1016/j.jpdc.2004.06.010
Chen LPan Y(2003)Faster sorting on a linear array with a reconfigurable pipelined bus systemProceedings of the 2003 international conference on Parallel and distributed processing and applications10.5555/1761566.1761595(209-219)Online publication date: 2-Jul-2003
https://dl.acm.org/doi/10.5555/1761566.1761595
Li JPan YShen H(2003)More Efficient Topological Sort Using Reconfigurable Optical BusesThe Journal of Supercomputing10.1023/A:102208071326724:3(251-258)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1023/A%3A1022080713267
Vaidyanathan RTrahan JLu C(2003)Degree of scalabilityParallel Computing10.1016/S0167-8191(02)00164-329:1(95-109)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.1016/S0167-8191%2802%2900164-3
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents