Skip to main content
SpringerLink
Log in
Book cover

Parallel Processing of Discrete Problems pp 181–195Cite as

Basic Algorithms on Parallel Optical Models of Computing

  • Chapter

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 106))

Abstract

In this paper we identify some of the optical models of computing that have been proposed and survey algorithms for fundamental problems. Problems considered include prefix computation, packet routing, selection, sorting, and matrix operations.

This work is supported, in part, by an NSF Grant CCR-9596065 and an EPA Grant R 825 293-01-0.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

  3. R. Boppana, The Average-Case Parallel Complexity of Sorting, Information Processing Letters 33 (1989), pp. 145–146.

    Article  MathSciNet  MATH  Google Scholar 

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

  5. R. Cole, Parallel Merge Sort, SIAM Journal on Computing 17 (1988), pp. 770–785.

    Article  MathSciNet  MATH  Google Scholar 

  6. R.W. Floyd and R.L. Rivest, Expected Time Bounds for Selection, Communications of the ACM 18(3) (1975), pp. 165–172.

    Article  MATH  Google Scholar 

  7. M. Geréb-Graus and T. Tsantilas, Efficient Optical Communication in Parallel Computers, in Proc. ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 41–48.

    Google Scholar 

  8. L. Goldberg, M. Jerrum, T. Leighton, and S. Rao, A Doubly-Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer, in Proc. ACM Symposium on Parallel Algorithms and Architectures, 1993, pp. 300–309.

    Google Scholar 

  9. W. Hendrick, O. Kibar, P. Marchand, C. Fan, D.V. Blerkom, F. MC-Cormick, I. Cokgor, M. Hansen, and S. Esener, Modeling and Optimization of the Optical Transpose Interconnection System, in Optoelectronic Technology Center, Program Review, Cornell University, September 1995.

    Google Scholar 

  10. E. Horowitz and S. Sahni and S. Rajasekaran, Computer Algorithms, Computer Science Press, 1998.

    Google Scholar 

  11. J. Jang and V.K. Prasanna, An Optimal Sorting Algorithm on Reconfigurable Mesh, in Proc. International Parallel Processing Symposium, 1992, pp. 130–137.

    Google Scholar 

  12. J. Jenq and S. Sahni, Reconfigurable Mesh Algorithms for Image Shrinking, Expanding,Clustering, and Template Matching, in Proc. International Parallel Processing Symposium, 1991, pp. 208–215.

    Google Scholar 

  13. T. Leighton Introduction to Parallel Algorithms and Architectures: ArraysTrees-Hypercubs, Morgan-Kaufmann Publishers, 1992.

    Google Scholar 

  14. T. Leighton, Tight Bounds on the Complexity of Parallel Sorting, IEEE Transactions on Computers C-34(4) (1985), pp. 344–354.

    Article  MathSciNet  Google Scholar 

  15. R. Lin, S. Olariu, Reconfigurable Buses with Shift Switching: Concepts and Applications, IEEE Transactions on Parallel and Distributed Systems 6(1) (1995), pp. 93–102.

    Article  Google Scholar 

  16. R. Lin, S. Olariu, J.L. Schwine, and J. Zhang, Sorting in 0(1) Time on a Reconfigurable Mesh of Size N x N, in Proc. European Workshop on Parallel Computing, 1992, pp. 16–27.

    Google Scholar 

  17. G.C. Marsden, P.J. Marchand, P. Harvey, and S.C. Esener, Optical Transpose Interconnection System Architectures, Optic Letters 18(3) (1993), pp. 1083–1085, July 1993.

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. R. Miller, V.K. Prasanna-Kumar, D. Reisis and Q.F. Stout, Meshes with Reconfigurable Buses, IEEE Transactions on Computers 42 (1993), pp. 678–692.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  21. M. Nigam and S. Sahni, Sorting n Numbers on n x n Reconfigurable Meshes with Buses, in Proc. International Parallel Processing Symposium, 1993, pp. 174–181.

    Google Scholar 

  22. S. Olariu, J.L. Schwing and J. Zhang, Integer Problems on Reconfigurable Meshes,with Applications, in Proc. 1991 Allerton Conference 4 (1991), pp. 821–830.

    Google Scholar 

  23. Y. Pan, Order Statistics on Optically Interconnected Multiprocessor Systems, in Proc. First International Workshop on Massively Parallel Processing Using Optical Interconnections, 1994, pp. 162–169.

    Google Scholar 

  24. S. Pavel and S.G. Akl Matrix Operations using Arrays with Reconfigurable Optical Buses, manuscript, 1995.

    Google Scholar 

  25. S. Rajasekaran, Meshes with Fixed and Reconfigurable Buses: Packet Routing, Sorting and Selection, in Proc. First Annual European Symposium on Algorithms, Springer-Verlag Lecture Notes in Computer Science 726, 1993, pp. 309–320. Also see IEEE Transactions on Computers 45(5) (1996), pp. 529–539.

    Google Scholar 

  26. S. Rajasekaran, Sorting and Selection on Interconnection Networks, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science 21 (1995), pp. 275–296.

    MathSciNet  Google Scholar 

  27. S. Rajasekaran, k — k Routing, k — k Sorting, and Cut Through Routing on the Mesh, Journal of Algorithms 19 (1995), pp. 361–382.

    Article  MathSciNet  MATH  Google Scholar 

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

  29. S. Rajasekaran and S. Sahni, Randomized Routing, Selection, and Sorting on the OTIS-Mesh, manuscript, 1997.

    Google Scholar 

  30. 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) (1997).

    Google Scholar 

  31. S. Rajasekaran and Th. Tsantilas,Optimal Routing Algorithms for Mesh Connected Processor Arrays, Algorithmica 8 (1992), pp. 21–38.

    Article  MathSciNet  MATH  Google Scholar 

  32. S. Rao and T. Tsantilas, Optical Interprocessor Communication Protocols, in Proc. Workshop on Massively Parallel Processing Using Optical Interconnections, 1994, pp. 266–274.

    Google Scholar 

  33. S. Sahni and C. Wang, BPC Permutations on the OTIS-Mesh OptoeIectronic Computer, in Proc. The Fourth International Conference on Massively Parallel Processing Using Optical Interconnections (MPPOI’97), 1997, pp. 130–135.

    Google Scholar 

  34. S. Sahni and C. Wang, Basic Algorithms on the OTIS-Mesh Optoelectronic Computer, Manuscript, 1997.

    Google Scholar 

  35. R.K. Thiruchelvan, J.L. Trahan, and R. Vaidyanathan, On the Power of Segmenting and Fusing Buses, in Proc. International Parallel Processing Symposium, 1993, pp. 79–83.

    Google Scholar 

  36. L.G. Valiant, General Purpose Parallel Architectures, in Handbook of Theoretical Computer Science: Vol. A (J. van Leeuwen, ed.), North Holland, 1990.

    Google Scholar 

  37. L.G. Valiant and G.J. Brebner, Universal Schemes for Parallel Communication, in Proc. 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 263–277.

    Google Scholar 

  38. F. Zane, P. Marchand, R. Paturi, S. Esener, Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS), in Proc. Third International Conference on Massively Parallel Processing Using Optical Interconnections (MPPOI’96), 1996, pp. 114–121.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science and Engg., University of Florida, Gainesville, Florida, 32611, USA

    Sanguthevar Rajasekaran

Authors
  1. Sanguthevar Rajasekaran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization Industrial and Systems Engineering Department, University of Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Rajasekaran, S. (1999). Basic Algorithms on Parallel Optical Models of Computing. In: Pardalos, P.M. (eds) Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1492-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1492-2_8

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7165-9

  • Online ISBN: 978-1-4612-1492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation