
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
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. 15571571, 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 = {00189340}, year = {2006}, pages = {15571571}, 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  JOUR JO  IEEE Transactions on Computers TI  Online Permutation Routing in Partitioned Optical Passive Star Networks IS  12 SN  00189340 SP1557 EP1571 EPD  15571571 A1  Alessandro Mei, A1  Romeo Rizzi, PY  2006 KW  Optical interconnections KW  partitioned optical passive star network KW  permutation routing. VL  55 JA  IEEE Transactions on Computers ER   
[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. 7080, 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. 410, 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. 9981013, Sept. 1998.
[4] R.G. Melhem, G. Gravenstreter, D. Chiarulli, and S. Levitan, The Communication Capabilities of Partitioned Optical Passive Star Networks, pp. 7798. 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. 739748, July 2000.
[6] F. Cao, “Reliability Analysis of Partitioned Optical Passive Stars Networks,” Proc. 22nd IEEE Conf. Local Computer Networks (LCN '97), pp. 470475, 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. 12751285, 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. 95104, 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. 720728, July 2000.
[10] P. Berthomé and A. Ferreira, “Improved Embeddings in POPS Networks through StackGraph Models,” Proc. Third Int'l Workshop Massively Parallel Processing Using Optical Interconnections, pp.130135, 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. 847852, Sept. 2003.
[13] K. Batcher, “Sorting Networks and Their Applications,” Proc. AFIPS Spring Joint Computing Conf., vol. 32, pp. 307314, 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.19, 1983.
[18] M. Ajtai, J. Komlos, and S. Szemeredi, “Sorting in $c\log n$ Parallel Steps,” Combinatorica, vol. 3, no. 1, pp. 119, 1983.
[19] A. Borodin, P. Raghavan, B. Schieber, and E. Upfal, “How Much Can Hardware Help Routing?” J. ACM, vol. 44, no. 5, pp. 726741, 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. 130145, 1985.
[21] A.C. Yao, “Probablistic Computations: Towards a Unified Measure of Complexity,” Proc. 17th IEEE Symp. Foundations of Computer Science (FOCS), pp. 222227, 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. McGrawHill, 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. WileyInterscience Series in Discrete Math. and Optimization, 2000.
[26] D. Dubashi and A. Panconesi, “Concentration of Measure for the Analysis of Randomised Algorithms,” manuscript, 2005.