This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Summation and Routing on a Partitioned Optical Passive Stars Network with Large Group Size
December 2003 (vol. 14 no. 12)
pp. 1275-1285
Amitava Datta, IEEE Computer Society

Abstract—In a Partitioned Optical Passive Stars (POPS) network, n=dg processors are divided into g groups of d processors each, and such a POPS network is denoted by POPS(d,g). There is an optical passive star (OPS) coupler between every pair of groups. Hence, a POPS(d,g) requires g^{2} couplers. It is likely that, in a practical system, the number of couplers will be less than the number of processors, i.e., d>\sqrt n>g and the number of groups will be smaller than the number of processors in a group. Hence, it is important to design fast algorithms for basic operations on such POPS networks with large group size. We present fast algorithms for data sum, prefix sum, and permutation routing on a POPS(d,g) such that d>\sqrt n>g. Our data sum and prefix sum algorithms improve upon the best known algorithms for these problems. Permutation routing can be solved on a POPS network by simulating a hypercube sorting algorithm. Our algorithm for permutation routing is more efficient compared to this simulated hypercube sorting algorithm.

[1] K. Batcher, Sorting Networks and Their Applications Proc. AFIPS Spring Joint Computing Conf., vol. 32, pp. 307-314, 1968.
[2] P. Berthomé and A. Ferreira, “Improved Embeddings in POPS Networks through Stack-Graph Models,” Proc. Third Int'l Workshop on Massively Parallel Processing Using Optical Interconnections, pp. 130-135, 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. 40-52, 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. 1901-1612, 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. 193-203, 1990.
[6] G. Graventreter and R. Melhem, “Realizing Common Communication Patterns in Partitioned Optical Passive Star (POPS) Networks,” EEE Trans. Computers, pp. 998-1,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. 637-647, 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. 77-98, Kluwer Academic Publishers, 1998.
[13] D. Nassimi and S. Sahni, An Optimal Routing Algorithm for Mesh-Connected Parallel Computers J. ACM, vol. 27, no. 1, pp. 6-29, 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. 739-748, 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. 249-264, 2001.

Index Terms:
Optical computing, partitioned optical passive stars network, data sum, prefix sum, permutation routing.
Citation:
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. 1275-1285, Dec. 2003, doi:10.1109/TPDS.2003.1255639
Usage of this product signifies your acceptance of the Terms of Use.