OSA's Digital Library

Applied Optics

Applied Optics


  • Vol. 27, Iss. 9 — May. 1, 1988
  • pp: 1734–1741

Two-dimensional optical Clos interconnection network and its uses

Shing-Hong Lin, Thomas F. Krile, and John F. Walkup  »View Author Affiliations

Applied Optics, Vol. 27, Issue 9, pp. 1734-1741 (1988)

View Full Text Article

Enhanced HTML    Acrobat PDF (1045 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



A 2-D optical three-stage Clos interconnection network, which is made up of a number of feasible crossbars of medium size, is implemented for dynamic data communications. The network is nonblocking and can handle a large number of communication lines (compared with crossbar networks of realizable size). Both one-to-one and one-to-many routing algorithms are discussed. Applications based on the Clos network are proposed for SIMD (single instruction multiple data) parallel computations and four-level programmable logic arrays (PLAs).

© 1988 Optical Society of America

Original Manuscript: July 20, 1987
Published: May 1, 1988

Shing-Hong Lin, Thomas F. Krile, and John F. Walkup, "Two-dimensional optical Clos interconnection network and its uses," Appl. Opt. 27, 1734-1741 (1988)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. A. A. Sawchuk, B. K. Jenkins, “Dynamic Optical Interconnections for Parallel Processors,” Proc. Soc Photo-Opt. Instrum. Eng. 625, 143 (1986).
  2. C. Clos, “A Study of Non-Blocking Switching Networks,” Bell Syst. Tech. J. 32, 406 (1953).
  3. T. Y. Feng, “A Survey of Interconnection Networks,” in Computer Special Issue on Interconnection Networks (Dec.1981).
  4. A. W. Lohmann, W. Stork, G. Stucke, “Optical Perfect Shuffle,” Appl. Opt. 25, 1530 (1986). [CrossRef] [PubMed]
  5. S. H. Lin, T. F. Krile, J. F. Walkup, “A 2-D Optical Multistage Interconnection Network,” Proc. Soc. Photo-Opt. Instrum. Eng.752, (1987), in press.
  6. A network is nonblocking if, regardless of what state the network is currently in, any pair of idle input–output terminals can be connected without having to reroute any existing connections.
  7. A network is called a rearrangeable network if it can perform all possible connections between inputs and outputs by rearranging its existing connections. However a rearrangeable network can still be blocking.
  8. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic (Academic, New York, 1968).
  9. H. J. Siegel, “A Model of SIMD Machines and a Comparison of Various Interconnection Networks,” IEEE Trans. Comput. C-28, 907 (1979). [CrossRef]
  10. M. C. Pease, “An Adaptation of the Fast Fourier Transform for Parallel Processing,” J. Assoc. Comput. Mach. 15, 252 (1968). [CrossRef]
  11. M. Karpovsky, “Multilevel Logic Networks,” IEEE Trans. Comput. C-36, 215 (1987). [CrossRef]
  12. A. C. Walker, “Application of Bistable Optical Logic Gate Arrays to All-Optical Digital Parallel Processing,” Appl. Opt. 25, 1578 (1986). [CrossRef] [PubMed]
  13. S. T. Hung, S. K. Tripathi, “Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks,” IEEE Trans. Comput. C-35, 591 (1986). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited