
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Amitava Datta, Subbiah Soundaralakshmi, "Summation and Routing on a Partitioned Optical Passive Stars Network with Large Group Size," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 12, pp. 12751285, December, 2003.  
BibTex  x  
@article{ 10.1109/TPDS.2003.1255639, author = {Amitava Datta and Subbiah Soundaralakshmi}, title = {Summation and Routing on a Partitioned Optical Passive Stars Network with Large Group Size}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {14}, number = {12}, issn = {10459219}, year = {2003}, pages = {12751285}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2003.1255639}, 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  Summation and Routing on a Partitioned Optical Passive Stars Network with Large Group Size IS  12 SN  10459219 SP1275 EP1285 EPD  12751285 A1  Amitava Datta, A1  Subbiah Soundaralakshmi, PY  2003 KW  Optical computing KW  partitioned optical passive stars network KW  data sum KW  prefix sum KW  permutation routing. VL  14 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In a
[1] K. Batcher, Sorting Networks and Their Applications Proc. AFIPS Spring Joint Computing Conf., vol. 32, pp. 307314, 1968.
[2] P. Berthomé and A. Ferreira, “Improved Embeddings in POPS Networks through StackGraph Models,” Proc. Third Int'l Workshop on Massively Parallel Processing Using Optical Interconnections, pp. 130135, 1996.
[3] P. Berthomé, J. Cohen, and A. Ferreira, Embedding Tori in Partitioned Optical Passive Stars Networks Proc. Fourth Int'l Colloquium on Structural Information and Comm. Complexity, pp. 4052, 1997.
[4] D. Chiarulli, S. Levitan, R. Melhem, J. Teza, and G. Gravenstreter, Partitioned Optical Passive Star (POPS) Multiprocessor Interconnection Networks with Distributed Control J. Lightwave Technology, vol. 14, no. 7, pp. 19011612, 1996.
[5] R. Cypher and G. Plaxton, Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers Proc. 22nd Ann. ACM Symp. Theory of Computing, pp. 193203, 1990.
[6] G. Graventreter and R. Melhem, “Realizing Common Communication Patterns in Partitioned Optical Passive Star (POPS) Networks,” EEE Trans. Computers, pp. 9981,013, 1998.
[7] G. Gravenstreter, R. Melhem, D. Chiarulli, S. Levitan, and J. Teza, "The Partitioned Optical Passive Stars (POPS) Topology," Proc. Ninth IEEE Int'l Parallel Processing Symp., Apr. 1995.
[8] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
[9] J. Lenfant, Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations IEEE Trans. Computers, vol. 27, no. 7, pp. 637647, July 1978.
[10] A. Mei, Personal Communication, Feb. 2002.
[11] A. Mei and R. Rizzi, Routing Permutations in Partitioned Optical Passive Stars Networks Proc. 16th Int'l Parallel and Distributed Processing Symp., Apr. 2002.
[12] R. Melhem, G. Gravenstreter, D. Chiarulli, and S. Levitan, The Communication Capabilities of Partitioned Optical Passive Star Networks Parallel Computing Using Optical Interconnections, K. Li, Y. Pan, and S. Zheng, eds., pp. 7798, Kluwer Academic Publishers, 1998.
[13] D. Nassimi and S. Sahni, An Optimal Routing Algorithm for MeshConnected Parallel Computers J. ACM, vol. 27, no. 1, pp. 629, 1980.
[14] S. Sahni, The Partitioned Optical Passive Stars Network: Simulations and Fundamental Operations IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 7, pp. 739748, July 2000.
[15] S. Sahni, “Matrix Multiplication and Data Routing Using a Partitioned Optical Stars Network,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 7, 2000.
[16] S. Sahni, Models and Algorithms for Optical and Optoelectronic Parallel Computers Int'l J. Foundations of Computer Science, vol. 12, no. 3, pp. 249264, 2001.