Fundamental Algorithms for the Array with Reconfigurable Optical Buses

  • Sanguthevar Rajasekaran
  • Sartaj Sahni
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 468)


In this chapter we present a survey of algorithms that have been developed for packet routing, sorting, and selection on the AROB (Array with Reconfigurable Optical Buses) model. The algorithms to be considered are both randomized and deterministic.


Time Slot Optical Interconnection Radix Sort Partial Permutation Fundamental Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


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

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Sanguthevar Rajasekaran
    • 1
  • Sartaj Sahni
    • 1
  1. 1.Department of Computer and Information Science and EngineeringUniversity of FloridaGainesville

Personalised recommendations