Publication 2006 Issue No. 12 - December Abstract - Online Permutation Routing in Partitioned Optical Passive Star Networks
Online Permutation Routing in Partitioned Optical Passive Star Networks
December 2006 (vol. 55 no. 12)
pp. 1557-1571
 ASCII Text x Alessandro Mei, Romeo Rizzi, "Online Permutation Routing in Partitioned Optical Passive Star Networks," IEEE Transactions on Computers, vol. 55, no. 12, pp. 1557-1571, December, 2006.
 BibTex x @article{ 10.1109/TC.2006.202,author = {Alessandro Mei and Romeo Rizzi},title = {Online Permutation Routing in Partitioned Optical Passive Star Networks},journal ={IEEE Transactions on Computers},volume = {55},number = {12},issn = {0018-9340},year = {2006},pages = {1557-1571},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2006.202},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Online Permutation Routing in Partitioned Optical Passive Star NetworksIS - 12SN - 0018-9340SP1557EP1571EPD - 1557-1571A1 - Alessandro Mei, A1 - Romeo Rizzi, PY - 2006KW - Optical interconnectionsKW - partitioned optical passive star networkKW - permutation routing.VL - 55JA - IEEE Transactions on ComputersER -
This paper establishes the state of the art in both deterministic and randomized online permutation routing in the POPS network. Indeed, we show that any permutation can be routed online on a {\rm POPS}(d, g) network either with O({\frac{d}{g}}\log g) deterministic slots, or, with high probability, with 5c\lceil d/g \rceil + o(d/g) + O(\log\log g) randomized slots, where constant c = \exp (1 + e^{-1}) \approx 3.927. When d = \Theta(g), which we claim to be the "interesting” case, the randomized algorithm is exponentially faster than any other algorithm in the literature, both deterministic and randomized ones. This is true in practice as well. Indeed, experiments show that it outperforms its rivals even starting from as small a network as a POPS(2, 2) and the gap grows exponentially with the size of the network. We can also show that, under proper hypothesis, no deterministic algorithm can asymptotically match its performance.

[1] D. Chiarulli, S. Levitan, R.G. Melhem, J. Teza, and G. Gravenstreter, “Multiprocessor Interconnection Networks Using Partitioned Optical Passive Star (Pops) Topologies and Distributed Control,” Proc. First Int'l Workshop Massively Parallel Processing Using Optical Interconnections, pp. 70-80, 1994.
[2] G. Gravenstreter, R.G. Melhem, D. Chiarulli, S. Levitan, and J. Teza, “The Partitioned Optical Passive Star (Pops) Topology,” Proc. Ninth Int'l Parallel Processing Symp., pp. 4-10, 1995.
[3] G. Gravenstreter and R.G. Melhem, “Realizing Common Communication Patterns in Partitioned Optical Passive Stars Networks,” IEEE Trans. Computers, vol. 47, no. 9, pp. 998-1013, Sept. 1998.
[4] R.G. Melhem, G. Gravenstreter, D. Chiarulli, and S. Levitan, The Communication Capabilities of Partitioned Optical Passive Star Networks, pp. 77-98. Kluwer Academic, 1998.
[5] 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.
[6] F. Cao, “Reliability Analysis of Partitioned Optical Passive Stars Networks,” Proc. 22nd IEEE Conf. Local Computer Networks (LCN '97), pp. 470-475, 1997.
[7] A. Datta and S. Soundaralakshmi, “Summation and Routing on a Partitioned Optical Passive Stars Network with Large Group Size,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 12, pp. 1275-1285, Dec. 2003.
[8] A. Mei and R. Rizzi, “Mapping Hypercube Computations onto Partitioned Optical Passive Star Networks,” Proc. 10th IEEE/ACM Int'l Conf. High Performance Computing, pp. 95-104, Dec. 2003.
[9] 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.
[10] 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.
[11] T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
[12] A. Mei and R. Rizzi, “Routing Permutations in Partitioned Optical Passive Stars Networks,” J. Parallel and Distributed Computing, vol. 63, no. 9, pp. 847-852, Sept. 2003.
[13] K. Batcher, “Sorting Networks and Their Applications,” Proc. AFIPS Spring Joint Computing Conf., vol. 32, pp. 307-314, 1968.
[14] S. Rajasekaran and J. Davila, “Packet Routing and Selection on the Pops Network,” Proc. 10th Int'l Conf. Parallel and Distributed Systems (ICPADS '04), p. 81, 2004.
[15] R.E. Cypher and C.G. Plaxton, “Techniques for Shared Key Sorting,” Technical Report RJ 7347, IBM Almaden Research Center, http://www.cs.utexas.edu/users/plaxton/html TR.html 1990.
[16] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms. MIT Press, 2001.
[17] M. Ajtai, J. Komlos, and S. Szemeredi, “An $O(N\log N)$ Sorting Network,” Proc. 25th ACM Symp. Theory of Computing (STOC), pp.1-9, 1983.
[18] M. Ajtai, J. Komlos, and S. Szemeredi, “Sorting in $c\log n$ Parallel Steps,” Combinatorica, vol. 3, no. 1, pp. 1-19, 1983.
[19] A. Borodin, P. Raghavan, B. Schieber, and E. Upfal, “How Much Can Hardware Help Routing?” J. ACM, vol. 44, no. 5, pp. 726-741, 1997.
[20] A. Borodin and J.E. Hopcroft, “Routing, Merging, and Sorting on Parallel Models of Computation,” J. Computer and System Sciences, vol. 30, pp. 130-145, 1985.
[21] A.C. Yao, “Probablistic Computations: Towards a Unified Measure of Complexity,” Proc. 17th IEEE Symp. Foundations of Computer Science (FOCS), pp. 222-227, 1977.
[22] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995.
[23] L.E. Dubins and L.J. Savage, How to Gamble If You Must. McGraw-Hill, 1965.
[24] G.R. Grimmett and D.R. Stirzaker, Probability and Random Processes. Oxford Univ. Press, 1988.
[25] N. Alon and J.H. Spencer, The Probabilistic Method, second ed. Wiley-Interscience Series in Discrete Math. and Optimization, 2000.
[26] D. Dubashi and A. Panconesi, “Concentration of Measure for the Analysis of Randomised Algorithms,” manuscript, 2005.

Index Terms:
Optical interconnections, partitioned optical passive star network, permutation routing.
Citation:
Alessandro Mei, Romeo Rizzi, "Online Permutation Routing in Partitioned Optical Passive Star Networks," IEEE Transactions on Computers, vol. 55, no. 12, pp. 1557-1571, Dec. 2006, doi:10.1109/TC.2006.202