Abstract
We present a number of computational complexity results for an optical model of computation called the continuous space machine. We also describe an implementation for an optical computing algorithm that can be easily defined within the model. Our optical model is designed to model a wide class of optical computers, such as matrix vector multipliers and pattern recognition architectures. It is known that the model solves intractable PSPACE problems in polynomial time, and NC problems in polylogarithmic time. Both of these results use large spatial resolution (number of pixels). Here we look at what happens when we have constant spatial resolution. It turns out that we obtain similar results by exploiting other resources, such as dynamic range and amplitude resolution. However, with certain other restrictions we essentially have a sequential device. Thus we are exploring the border between parallel and sequential computation in optical computing. We describe an optical architecture for the unordered search problem of finding a one in a list of zeros. We argue that our algorithm scales well, and is relatively straightforward to implement. This problem is easily parallelisable and is from the class NC. We go on to argue that the optical computing community should focus their attention on problems within P (and especially NC), rather than developing systems for tackling intractable problems.
DW acknowledges support from Junta de Andalucía grant TIC-581. TN acknowledges support from a Marie Curie Fellowship through the European Commission Framework Programme 6.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Arsenault, H.H., Sheng, Y.: An Introduction to Optics in Computers. Tutorial Texts in Optical Engineering, vol. TT8. SPIE Press, Bellingham (1992)
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural complexity II. EATCS Monographs on Theoretical Computer Science, vol. 22. Springer, Berlin (1988)
Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26(5), 1510–1523 (1997)
Bertoni, A., Mauri, G., Sabadini, N.: A characterization of the class of functions computable in polynomial time on random access machines. In: STOC, Milwaukee, Wisconsin, May 1981, pp. 168–176. ACM Press, New York (1981)
Bracewell, R.N.: The Fourier transform and its applications, 2nd edn. Electrical and electronic engineering series. McGraw-Hill, New York (1978)
Caulfield, H.J.: Space-time complexity in optical computing. Multidimensional Systems and Signal Processing 2(4), 373–378 (1991); Special issue on optical signal processing
Chandra, A.K., Stockmeyer, L.J.: Alternation. In: 17th annual symposium on Foundations of Computer Science, Houston, Texas, October 1976, pp. 98–108. IEEE, Los Alamitos (1976)
Feitelson, D.G.: Optical Computing: A survey for computer scientists. MIT Press, Cambridge (1988)
Goldschlager, L.M.: Synchronous parallel computation. PhD thesis, University of Toronto, Computer Science Department (December 1977)
Goldschlager, L.M.: A universal interconnection pattern for parallel computers. Journal of the ACM 29(4), 1073–1086 (1982)
Goodman, J.W.: Introduction to Fourier optics, 2nd edn. McGraw-Hill, New York (1996)
Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: P-completeness theory. Oxford University Press, Oxford (1995)
Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. 28th Annual ACM Symposium on Theory of Computing, May 1996, pp. 212–219 (1996)
Karp, R.M., Ramachandran, V.: Parallel algorithms for shared memory machines. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 17, vol. A, pp. 869–941. Elsevier, Amsterdam (1990)
Lenslet Labs. Enlight256. White paper report, Lenslet Ltd., 6 Galgalei Haplada St, Herzelia Pituach, 46733 Israel (November 2003)
Naughton, T., Javadpour, Z., Keating, J., Klíma, M., Rott, J.: General-purpose acousto-optic connectionist processor. Optical Engineering 38(7), 1170–1177 (1999)
Naughton, T.J.: Continuous-space model of computation is Turing universal. In: Bains, S., Irakliotis, L.J. (eds.) Critical Technologies for the Future of Computing, San Diego, California, August 2000. Proceedings of SPIE, vol. 4109, pp. 121–128 (2000)
Naughton, T.J.: A model of computation for Fourier optical processors. In: Lessard, R.A., Galstian, T. (eds.) Optics in Computing 2000, Quebec, Canada, June 2000. Proc. SPIE, vol. 4089, pp. 24–34 (2000)
Naughton, T.J., Woods, D.: Optical computing. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and System Science. Springer, Heidelberg (to appear)
Naughton, T.J., Woods, D.: On the computational power of a continuous-space optical model of computation. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 288–299. Springer, Heidelberg (2001)
Parberry, I.: Parallel complexity theory. Wiley, Chichester (1987)
Pratt, V.R., Stockmeyer, L.J.: A characterisation of the power of vector machines. Journal of Computer and Systems Sciences 12, 198–221 (1976)
Reif, J.H., Tyagi, A.: Efficient parallel algorithms for optical computing with the Discrete Fourier transform (DFT) primitive. Applied Optics 36(29), 7327–7340 (1997)
Schönhage, A.: On the power of random access machines. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 520–529. Springer, Heidelberg (1979)
Shaked, N.T., Messika, S., Dolev, S., Rosen, J.: Optical solution for bounded NP-complete problems. Applied Optics 46(5), 711–724 (2007)
Shaked, N.T., Simon, G., Tabib, T., Mesika, S., Dolev, S., Rosen, J.: Optical processor for solving the traveling salesman problem (TSP). In: Javidi, B., Psaltis, D., Caulfield, H.J. (eds.) Proc. of SPIE, Optical Information Systems IV, August 2006, vol. 63110G (2006)
Shaked, N.T., Tabib, T., Simon, G., Messika, S., Dolev, S., Rosen, J.: Optical binary-matrix synthesis for solving bounded NP-complete combinatorical problems. Optical Engineering 46(10), 108201–1–108201–11 (2007)
van Emde Boas, P.: Machine models and simulations. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol. A, Elsevier, Amsterdam (1990)
Van der Lugt, A.: Optical Signal Processing. Wiley, New York (1992)
Woods, D.: Computational complexity of an optical model of computation. PhD thesis, National University of Ireland, Maynooth (2005)
Woods, D.: Upper bounds on the computational power of an optical model of computation. In: Deng, X., Du, D. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 777–788. Springer, Heidelberg (2005)
Woods, D.: Optical computing and computational complexity. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol. 4135, pp. 27–40. Springer, Heidelberg (2006)
Woods, D., Gibson, J.P.: Complexity of continuous space machine operations. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 540–551. Springer, Heidelberg (2005)
Woods, D., Gibson, J.P.: Lower bounds on the computational power of an optical model of computation. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 237–250. Springer, Heidelberg (2005)
Woods, D., Naughton, T.J.: An optical model of computation. Theoretical Computer Science 334(1-3), 227–258 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woods, D., Naughton, T.J. (2008). Parallel and Sequential Optical Computing. In: Dolev, S., Haist, T., Oltean, M. (eds) Optical SuperComputing. OSC 2008. Lecture Notes in Computer Science, vol 5172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85673-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-85673-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85672-6
Online ISBN: 978-3-540-85673-3
eBook Packages: Computer ScienceComputer Science (R0)