Summation and routing on a partitioned optical passive stars network with large group size

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 12, 2003, Pages 1275-1285

  Datta, Amitava ^a   Soundaralakshmi, Subbiah ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Data sum; Optical computing; Partitioned optical passive stars network; Permutation routing; Prefix sum

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FIBER OPTIC NETWORKS; OPTICAL DATA PROCESSING; PARALLEL PROCESSING SYSTEMS;

HYPERCUBE SORTING ALGORITHM; OPTICAL PASSIVE STAR COUPLER; PARTITIONED OPTICAL PASSIVE STARS NETWORK;

INTERCONNECTION NETWORKS;

EID: 0742268965     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1255639     Document Type: Article

References (16)

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 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. Gravenstreter and R. Melhem, "Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks," IEEE Trans. Computers, vol. 47, no. 9, pp. 998-1013, Sept. 1998.
7. G. Gravenstreter, R. Melhem, D. Chiarulli, S. Levitan, and J. Teza, "The Partitioned Optical Passive Stars (POPS) Topology," Proc. Ninth Int'l Parallel Processing Symp., pp. 4-10, 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 Communications, 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 Passive Stars Network," IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 7, pp. 720-728, July 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.