|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Sanguthevar Rajasekaran, Sartaj Sahni, "Randomized Routing, Selection, and Sorting on the OTIS-Mesh," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 833-840, September, 1998. | |||
| BibTex | x | ||
| @article{ 10.1109/71.722217, author = {Sanguthevar Rajasekaran and Sartaj Sahni}, title = {Randomized Routing, Selection, and Sorting on the OTIS-Mesh}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {9}, issn = {1045-9219}, year = {1998}, pages = {833-840}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.722217}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Parallel and Distributed Systems TI - Randomized Routing, Selection, and Sorting on the OTIS-Mesh IS - 9 SN - 1045-9219 SP833 EP840 EPD - 833-840 A1 - Sanguthevar Rajasekaran, A1 - Sartaj Sahni, PY - 1998 KW - Optical computing KW - mesh-connected computers KW - parallel algorithms KW - sorting KW - packet routing KW - selection KW - randomized algorithms. VL - 9 JA - IEEE Transactions on Parallel and Distributed Systems ER - | |||
Abstract—The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In this paper we present efficient algorithms for packet routing, sorting, and selection on the OTIS-Mesh. The diameter of an
[1] D. Angluin and L.G. Valiant, "Fast Probabilistic Algorithms for Hamiltonian Paths and Matchings," J. Computer and Systems Science, vol. 18, pp. 155-193, 1979.
[2] H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals Math. Statistics, vol. 23, pp. 493-507, 1952.
[3] W.D. Frazer and A.C. McKellar, "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting," J. ACM, vol. 17, no. 3, pp. 496-507, 1970.
[4] W. Hendrick, O. Kibar, P. Marchand, C. Fan, D.V. Blerkom, F. McCormick, I. Cokgor, M. Hansen, and S. Esener, "Modeling and Optimization of the Optical Transpose Interconnection System," Optoelectronic Technology Center, Program Review, Cornell Univ., Sept. 1995.
[5] E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms. W.H. Freeman, 1998.
[6] C. Kaklamanis and D. Krizanc,"Optimal Sorting on Mesh Connected Processor Arrays," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 50-59, 1992.
[7] G.C. Marsden, P.J. Marchand, P. Harvey, and S.C. Esener, "Optical Transpose Interconnection System Architectures," Optic Letters, vol. 18, no. 3, pp. 1,083-1,085, July 1993.
[8] S. Rajasekaran, "Sorting and Selection on Interconnection Networks," DIMACS Series Discrete Mathematics and Theoretical Computer Science, vol. 21, pp. 275-296, 1995.
[9] S. Rajasekaran and T. Tsantilas, "Optimal Routing Algorithms for Mesh Connected Processor Arrays," Algorithmica, vol. 8, pp. 21-38, 1992.
[10] S. Rajasekaran and J.H. Reif, "Derivation of Randomized Sorting and Selection Algorithms," Parallel Algorithm Derivation and Program Transformation, R. Paige, J.H. Reif, and R. Wachter, eds., pp. 187-205. Kluwer Academic, 1993.
[11] 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.
[12] S. Sahni and C. Wang, "Basic Algorithms on the OTIS-Mesh Optoelectronic Computer," manuscript, 1997.
[13] 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.