High throughput optical algorithms for the FFT and sorting via data packing

Keren Bergman; Geoffrey L. Burdge; David A. Carlson; Neil B. Coletti; Harry F. Jordan; Rajgopal Kannan; Kyungsook Y. Lee; Phillip R. Merkey; Paul R. Prucnal; Coke S. Reed; Douglas E. Straub

doi:10.1109/mppoi.1996.559079

High throughput optical algorithms for the FFT and sorting via data packing

Keren Bergman, Geoffrey L. Burdge, David A. Carlson, Neil B. Coletti, Harry F. Jordan, Rajgopal Kannan, Kyungsook Y. Lee, Phillip R. Merkey, Paul R. Prucnal, Coke S. Reed, Douglas E. Straub

Research output: Contribution to conference › Paper › peer-review

1 Scopus citations

Abstract

This paper demonstrates that the potential for very high speed computation provided by optical technology can be achieved for important computational problems including the fast Fourier transform and sorting. First a programming model that captures the `time-of-flight' characteristics of optical fibers and switching elements is presented. Then it is shown that the FFT and the radix sort algorithms can both be reduced to the computational kernel of `packing' intermediate data results that are continuously moving through an optical fiber. New algorithms are developed for the general packing problem, and the details of how to implement them in optics are presented. The resulting systems have the potential for operating at clock rates that are two or more orders of magnitude higher than conventional computers.

Original language	English (US)
Pages	168-176
Number of pages	9
DOIs	https://doi.org/10.1109/mppoi.1996.559079
State	Published - 1996
Event	Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96 - Maui, HI, USA Duration: Oct 27 1996 → Oct 29 1996

Other

Other	Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96
City	Maui, HI, USA
Period	10/27/96 → 10/29/96

All Science Journal Classification (ASJC) codes

General Computer Science

Access to Document

10.1109/mppoi.1996.559079

Cite this

Bergman, K., Burdge, G. L., Carlson, D. A., Coletti, N. B., Jordan, H. F., Kannan, R., Lee, K. Y., Merkey, P. R., Prucnal, P. R., Reed, C. S., & Straub, D. E. (1996). High throughput optical algorithms for the FFT and sorting via data packing. 168-176. Paper presented at Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96, Maui, HI, USA. https://doi.org/10.1109/mppoi.1996.559079

@conference{ad49fdf6d27c4618a6c787a17412e865,

title = "High throughput optical algorithms for the FFT and sorting via data packing",

abstract = "This paper demonstrates that the potential for very high speed computation provided by optical technology can be achieved for important computational problems including the fast Fourier transform and sorting. First a programming model that captures the `time-of-flight' characteristics of optical fibers and switching elements is presented. Then it is shown that the FFT and the radix sort algorithms can both be reduced to the computational kernel of `packing' intermediate data results that are continuously moving through an optical fiber. New algorithms are developed for the general packing problem, and the details of how to implement them in optics are presented. The resulting systems have the potential for operating at clock rates that are two or more orders of magnitude higher than conventional computers.",

author = "Keren Bergman and Burdge, {Geoffrey L.} and Carlson, {David A.} and Coletti, {Neil B.} and Jordan, {Harry F.} and Rajgopal Kannan and Lee, {Kyungsook Y.} and Merkey, {Phillip R.} and Prucnal, {Paul R.} and Reed, {Coke S.} and Straub, {Douglas E.}",

year = "1996",

doi = "10.1109/mppoi.1996.559079",

language = "English (US)",

pages = "168--176",

note = "Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96 ; Conference date: 27-10-1996 Through 29-10-1996",

}

Bergman, K, Burdge, GL, Carlson, DA, Coletti, NB, Jordan, HF, Kannan, R, Lee, KY, Merkey, PR, Prucnal, PR, Reed, CS & Straub, DE 1996, 'High throughput optical algorithms for the FFT and sorting via data packing', Paper presented at Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96, Maui, HI, USA, 10/27/96 - 10/29/96 pp. 168-176. https://doi.org/10.1109/mppoi.1996.559079

High throughput optical algorithms for the FFT and sorting via data packing. / Bergman, Keren; Burdge, Geoffrey L.; Carlson, David A. et al.
1996. 168-176 Paper presented at Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96, Maui, HI, USA.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

T1 - High throughput optical algorithms for the FFT and sorting via data packing

AU - Bergman, Keren

AU - Burdge, Geoffrey L.

AU - Carlson, David A.

AU - Coletti, Neil B.

AU - Jordan, Harry F.

AU - Kannan, Rajgopal

AU - Lee, Kyungsook Y.

AU - Merkey, Phillip R.

AU - Prucnal, Paul R.

AU - Reed, Coke S.

AU - Straub, Douglas E.

PY - 1996

Y1 - 1996

N2 - This paper demonstrates that the potential for very high speed computation provided by optical technology can be achieved for important computational problems including the fast Fourier transform and sorting. First a programming model that captures the `time-of-flight' characteristics of optical fibers and switching elements is presented. Then it is shown that the FFT and the radix sort algorithms can both be reduced to the computational kernel of `packing' intermediate data results that are continuously moving through an optical fiber. New algorithms are developed for the general packing problem, and the details of how to implement them in optics are presented. The resulting systems have the potential for operating at clock rates that are two or more orders of magnitude higher than conventional computers.

AB - This paper demonstrates that the potential for very high speed computation provided by optical technology can be achieved for important computational problems including the fast Fourier transform and sorting. First a programming model that captures the `time-of-flight' characteristics of optical fibers and switching elements is presented. Then it is shown that the FFT and the radix sort algorithms can both be reduced to the computational kernel of `packing' intermediate data results that are continuously moving through an optical fiber. New algorithms are developed for the general packing problem, and the details of how to implement them in optics are presented. The resulting systems have the potential for operating at clock rates that are two or more orders of magnitude higher than conventional computers.

UR - http://www.scopus.com/inward/record.url?scp=0030408895&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030408895&partnerID=8YFLogxK

U2 - 10.1109/mppoi.1996.559079

DO - 10.1109/mppoi.1996.559079

M3 - Paper

AN - SCOPUS:0030408895

SP - 168

EP - 176

T2 - Proceedings of the 1996 3rd International Conference on Massively Parallel Processing Using Optical Interconnections, MPPOI'96

Y2 - 27 October 1996 through 29 October 1996

ER -

High throughput optical algorithms for the FFT and sorting via data packing

Abstract

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this