Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1990: Foundations of Software Technology and Theoretical Computer Science pp 149–160Cite as

Efficient parallel algorithms for optical computing with the DFT primitive

  • Parallel Algorithms
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 472))

Abstract

The optical computing technology offers new challenges to the algorithm designers since it can perform an n-point DFT computation in only unit time. Note that DFT is a non-trivial computation in the PRAM model. We develop two new models, DFT-VLSIO and DFT-Circuit, to capture this characteristic of optical computing. We also provide two paradigms for developing parallel algorithms in these models. Efficient parallel algorithms for many problems including polynomial and matrix computations, sorting and string matching are presented. The sorting and string matching algorithms are particularly noteworthy. Almost all of these algorithms are within a polylog factor of the optical computing (VLSIO) lower bounds derived in [BR87] and [TR90].

The research of J. Reif was supported in part by DARPA/ARO contract DAAL03-88-K-0195, Air Force Contract AFOSR-87-0386, DARPA/ISTO contract N00014-88-K-0458, NASA subcontract 550-63 of primecontract NAS5-30428. A. Tyagi was supported by NSF Grant #MIP-8806169, NCBS&T Grant #89SE04 and a Junior Faculty Development award from UNC, Chapel Hill.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. C. Agarwal and C. S. Burrus. Fast One-Dimensional Digital Convolution by Multidimensional Techniques. IEEE Trans. on Acoustics, Speech and Signal Processing, ASSP-22(1):1–10, February 1974.

    Google Scholar 

  2. M. Ajtai, J. Komlos, and E. Szemeredi. An O(n log n) Sorting Network. Combinatorica, 3:1–19, 1983.

    Google Scholar 

  3. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly Parallelizable Problems. In Proceedings of ACM Symposium on Theory of Computing, pages 309–319. ACM-SIGACT, 1989.

    Google Scholar 

  4. R. Barakat and J. Reif. Lower Bounds on the Computational Efficiency of Optical Computing Systems. Applied Optics, 26:1015–1018, March 1987.

    Google Scholar 

  5. R. Cole. Parallel Merge Sort. SIAM Journal of Computing, 17(4):770–785, August 1988.

    Google Scholar 

  6. D. Coppersmith and S. Winograd. Matrix Multiplication via Arithmetic Progressions. In Proceedings of ACM Symposium on Theory of Computing, pages 1–6. ACM-SIGACT, 1987.

    Google Scholar 

  7. D. G. Feitelson. Optical Computing, A Survey for Computer Scientists. MIT Press, 1988.

    Google Scholar 

  8. S. Fortune and J. Wyllie. Parallelism in Random Access Machines. In Proceedings of ACM Symposium on Theory of Computing, pages 114–118. ACM-SIGACT, 1978.

    Google Scholar 

  9. D. Gabor. Light and Information. In E. Wolf, editor, Progress in Optics, pages 111–153. North-Holland, Amsterdam, Holland., 1961.

    Google Scholar 

  10. J. W. Goodman. Architectural Development of Optical Data Processing Systems. Journal of Electrical and Electronics Engineering — IE Aust. and IREE Aust., 2(3):139–149, September 1982.

    Google Scholar 

  11. V. P. Heuring, H. F. Jordan, and J. Pratt. A Bit-Serial Architecture for Optical Computing. Technical Report OCS Technical Report 88-01a, Optoelectronic Computing Center, University of Colorado, Boulder, March 1988.

    Google Scholar 

  12. J. L. Horner. Optical Signal Processing. Academic Press, 1987.

    Google Scholar 

  13. J. L. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan-Kaufmann, 1990.

    Google Scholar 

  14. K. Iizuka. Engineering Optics, volume 35 of Springer Series in Optical Sciences. Springer-Verlag, second edition, 1983.

    Google Scholar 

  15. H. F. Jordan. Pipelined Digital Optical Computing. Technical OCS Technical Report 89-34, Optoelectronic Computing Center, University of Colorado, Boulder, 1989.

    Google Scholar 

  16. M. V. Klein and T. E. Furtak. Optics. John Wiley & Sons: New York, second edition, 1986.

    Google Scholar 

  17. T. Kailath, S. Y. Kung, and M. Morf. Displacement Ranks of Matrices and Linear Equations. J. Math. Anal. Appl., 68(2):395–407, April 1979.

    Google Scholar 

  18. S. R. Kosaraju, October 1989. personal communication.

    Google Scholar 

  19. H.T. Kung. Let's Design Algorithms for VLSI Systems. In Proceedings of the Caltech Conference on Advanced Research in VLSI: Architecture, Design, Fabrication, pages 65–90. Caltech, January 1979.

    Google Scholar 

  20. F. T. Leighton and A. L. Rosenberg. Three-Dimensional Circuit Layouts. SIAM Journal on Computing, 15(3):793–813, March 1986.

    Google Scholar 

  21. E. S. Maniloff, K. M. Johnson, and J. Reif. Holographic Routing Network for Parallel Processing Machines. In Proceedings of SPIE International Congress on Optical Science and Engineering. SPIE, April 1989.

    Google Scholar 

  22. M. Morf and T. Kailath. Recent Results in Least-Squares Estimation Theory. Ann. Econ. and Soc. Meas., 6(3):261–274, 1977.

    Google Scholar 

  23. V. Pan and J. Reif. Efficient Parallel Solution of Linear Systems. In Proceedings of the ACM Symposium on Theory of Computing, pages 143–152. ACM-SIGACT, 1985. also to appear as Fast and efficient parallel solution of dense linear systems in Computers and Mathematics with Applications.

    Google Scholar 

  24. V. Pan and J. Reif. Some Polynomial and Toeplitz Matrix Computations. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 173–184. IEEE, 1987.

    Google Scholar 

  25. F. P. Preparata. Optimal Three-Dimensional VLSI Layouts. Math. Systems Theory, 16:1–8, 1983.

    Google Scholar 

  26. I. Parberry and G. Schnitger. Parallel Computation with Threshold Functions. Journal of Computer and System Sciences, 36(3):278–301, June 1988.

    Google Scholar 

  27. J. Reif and S. Tate. On Threshold Circuits and Polynomial Computation. In Proceedings of 2nd Structure in Complexity Theory Conference. ACM-SIGACT, 1987. Revised version: On Threshold Circuits and Efficient, Constant Depth Polynomial Computation, August 1988.

    Google Scholar 

  28. J. Reif and L. Valiant. A Logarithmic Time Sort on Linear Size Networks. Journal of the Association for Computing Machinery, 34(1):60–76, January 1987.

    Google Scholar 

  29. W. J. Savitch and M. Stimson. Time Bounded Random Access Machines with Parallel Processing. Journal of the ACM, 26:103–118, 1979.

    Google Scholar 

  30. C.D. Thompson. Area-Time Complexity for VLSI. In Proceedings of ACM Symposium on Theory of Computing. ACM-SIGACT, 1979.

    Google Scholar 

  31. C. D. Thompson. A Complexity Theory for VLSI. PhD thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, 1980.

    Google Scholar 

  32. A. Tyagi and J. Reif. Energy Complexity of Optical Computations. In Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing. IEEE, December 1990. to appear.

    Google Scholar 

  33. J. Vuillemin. A Combinatorial Limit to the Computing Power of VLSI Circuits. IEEE Transactions on Computers, pages 294–300, March 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, 27706, Durham, NC

    John Reif

  2. Department of Computer Science, University of North Carolina, 27599-3175, Chapel Hill, NC

    Akhilesh Tyagi

Authors
  1. John Reif
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akhilesh Tyagi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reif, J., Tyagi, A. (1990). Efficient parallel algorithms for optical computing with the DFT primitive. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-53487-3_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53487-7

  • Online ISBN: 978-3-540-46313-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation