This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Basic Operations on the OTIS-Mesh Optoelectronic Computer
December 1998 (vol. 9 no. 12)
pp. 1226-1236

Abstract—In this paper, we develop algorithms for some basic operations—broadcast, window broadcast, prefix sum, data sum, rank, shift, data accumulation, consecutive sum, adjacent sum, concentrate, distribute, generalize, sorting, random access read and write—on the OTIS-Mesh [1] model. These operations are useful in the development of efficient algorithms for numerous applications [2].

[1] S. Sahni and C.-F. Wang, “BPC Permutations on the OTIS-Mesh Optoelectronic Computer,” Proc. Fourth Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '97), pp. 130-135, 1997.
[2] S. Ranka and S. Shani,Hypercube Algorithms for Image Processing and Pattern Recognition. New York: Springer-Verlag, 1990.
[3] G.C. Marsden, P.J. Marchand, P. Harvey, and S.C. Esener, "Optical Transpose Interconnection System Architectures," Optics Letters, vol. 18, no. 13, pp. 1,083-1,085, July1 1993.
[4] A. Krishnamoorthy, P. Marchand, F. Kiamilev, and S. Esener, "Grain-Size Considerations for Optoelectronic Multistage Interconnection Networks," Applied Optics, vol. 31, no. 26, Sept. 1992.
[5] C.-F. Wang and S. Sanhi, "OTIS Optoelectronic Computers," Parallel Computation Using Optical Interconnections, K. Li, Y. Pan, and S.Q. Zhang, eds. Kluwer Academic, 1998.
[6] F. Zane, P. Marchand, R. Paturi, and S. Esener, “Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS),” Proc. Second Int'l Conf. Massively Parallel Processing Using Optical Interconnections (MPPOI '96), pp. 114-121, 1996.
[7] S. Sahni and C.F. Wang, "BPC Permutations on the OTIS-Hypercube Optoelectronic Computer," Informatica, to appear, 1998.
[8] D. Nassimi and S. Sahni,“An optimal routing algorithm for mesh-connected parallel computers,”J. ACM, pp. 6–29, 1980.
[9] S. Rajasekeran and S. Sahni, “Randomized Routing, Selection, and Sorting on the Otis-Mesh,” IEEE Trans. Parallel And Distributed Systems, vol. 9, no. 9, pp. 833-840, Sept. 1998.
[10] D. Nassimi and S. Sahni, "Data Broadcasting in SIMD Computer," IEEE Trans. Computers, vol. 30, no. 2, pp. 101-107, Feb. 1981.
[11] C. Fennema, A. Hanson, E. Riseman, J.R. Beveridge, and R. Kumar, "Model-Directed Mobile Robot Navigation," IEEE Trans. Systems, Man, and Cybernetics, vol. 20, no. 6, pp. 1,352-1,369, Nov./Dec. 1990.
[12] T. Leighton, "Tight Bounds on the Complexity of Parallel Sorting," IEEE Trans. Computers, vol. 34, no. 4, pp. 344-354, Apr. 1985.

Index Terms:
OTIS-Mesh, optoelectronic, broadcast, window broadcast, prefix sum, data sum, rank, shift, data accumulation, consecutive sum, adjacent sum, concentrate, distribute, generalize, sorting, random access read, random access write.
Citation:
Chih-Fang Wang, Sartaj Sahni, "Basic Operations on the OTIS-Mesh Optoelectronic Computer," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 12, pp. 1226-1236, Dec. 1998, doi:10.1109/71.737698
Usage of this product signifies your acceptance of the Terms of Use.