Packet routing and selection on the POPS network

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 10, Issue , 2004, Pages 81-88

  Rajasekaran, Sanguthevar ^a   Davila, Jaime ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Packet routing; Partial permutation routing; Partitioned optical passive star (POPS) network; Randomized algorithms; Selection; Sparse enumeration sort

Indexed keywords

PACKET ROUTING; PARTIAL PERMUTATION ROUTING; PARTITIONED OPTICAL PASSIVE STARS (POPS) NETWORKS; RANDOMIZED ALGORITHMS; SPARSE ENUMERATION SORT;

ALGORITHMS; BROADCASTING; COMPUTER NETWORKS; COMPUTER SIMULATION; PROBABILITY; ROUTERS; SET THEORY; TOPOLOGY;

PACKET NETWORKS;

EID: 4544376737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2004.1316083     Document Type: Conference Paper

References (18)

1. P. Berthome and A. Ferreira, Improved embeddings in POPS networks through stackgraph models, Proc. Third IEEE International Workshop on Massively Parallel Processing Using Optical Interconnections, 1996, pp. 130135.
2. D. Chiarulli, S. Levitan, R. Melhem, J. Teza, and G. Gravenstreter, Multiprocessor interconnection networks using partitioned optical passive star (POPS) topologies and distributed control, Proc. IEEE First International Workshop on Massively Parallel Processing Using Optical Interconnections, 1994, pp. 70-80.
3. A. Datta and S. Soundaralakshmi, Summation and routing on a partitioned optical passive stars network with large group size, IEEE Transactions on Parallel and Distributed Systems 14(12), 2003, pp. 1-11.
4. A. Datta and S. Soundaralakshmi, Fast merging and sorting on a partitioned optical passive stars network, Proc. Workshop in honor of Thomas Ottmann, 2002.
5. Floyd, R.W., and Rivest, R.L., 'Expected Time Bounds for Selection,' Communications of the ACM, vol. 18, no.3, 1975, pp. 165-172.
6. G. Graventreter and R. Melhem, Realizing common communication patterns in partitioned optical passive star (POPS) networks, IEEE Transactions on Computers, 1998, pp. 998-1013.
7. G. Graventreter, R. Melhem, D. Chiarulli, S. Levitan, and J. Teza, The partitioned optical passive stars (POPS) topology, Proc. 9th IEEE International Parallel Processing Symposium, 1995, pp. 4-10.
8. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, W. H. Freeman Press, 1998.
9. A. Mei and R. Rizzi, Routing permutations in partitioned optical passive stars networks, Proc. 16th International Parallel and Distributed Processing Symposium, 2002.
10. R. Melhem, G. Graventreter, D. Chiarulli, and S. Levitan, The communication capabilities of partitioned optical passive star networks, in Parallel Computing Using Optical Interconnections, edited by K. Li, Y. Pan, and S. Zheng, Kluwer Academic Publishers, 1998, pp. 77-98.
11. S. Rajasekaran, Sorting and selection on interconnection networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 21, 1995, pp. 275-296.
12. S. Rajasekaran, Computing on optical models, in Randomization Methods in Algorithm Design, edited by P.M. Pardalos, S. Rajasekaran, and J. Rolim, AMS Press, 1999, pp. 239-249.
13. S. Rajasekaran and J.H. Reif, Derivation of randomized sorting and selection algorithms, in Parallel Algorithm Derivation and Program Transformation, Edited by R. Paige, J.H. Reif, and R. Wachter, Kluwer Academic Publishers, 1993, pp. 187-205.
14. S. Rajasekaran and S. Sahni, Fundamental Algorithms for the Array with Reconfigurable Optical Buses, in Parallel Computation Using Optical Interconnections, edited by K. Li, Y. Pan, and S. Q. Zheng, Kluwer Academic Publishers, 1998, pp. 185-204.
15. S. Sahni, The partitioned optical passive stars network: Simulations and fundamental operations, IEEE Transactions on Parallel and Distributed Systems, 11(7), 2000, pp. 739-748.
16. S. Sahni, Matrix multiplication and data routing using a partitioned optical stars network, IEEE Transactions on Parallel and Distributed Systems, 11(7), 2000, pp. 720-728.
17. L.G. Valiant, General Purpose Parallel Architectures, in Handbook of Theoretical Computer Science: Vol. A (J. van Leeuwen, ed.), North Holland, 1990.
18. L.G. Valiant and G.J. Brebner, Universal Schemes for Parallel Communication, Proc. 13th Annual ACM Symposium on Theory of Computing, 1981, pp. 263-277.