
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Paraskevi Fragopoulou, Selim G. Akl, "EdgeDisjoint Spanning Trees on the Star Network with Applications to Fault Tolerance," IEEE Transactions on Computers, vol. 45, no. 2, pp. 174185, February, 1996.  
BibTex  x  
@article{ 10.1109/12.485370, author = {Paraskevi Fragopoulou and Selim G. Akl}, title = {EdgeDisjoint Spanning Trees on the Star Network with Applications to Fault Tolerance}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {2}, issn = {00189340}, year = {1996}, pages = {174185}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.485370}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  EdgeDisjoint Spanning Trees on the Star Network with Applications to Fault Tolerance IS  2 SN  00189340 SP174 EP185 EPD  174185 A1  Paraskevi Fragopoulou, A1  Selim G. Akl, PY  1996 KW  Communication algorithm KW  edgedisjoint trees KW  fault tolerance KW  interconnection network KW  parallel algorithm KW  spanning tree KW  star network. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—Data communication and fault tolerance are important issues in parallel computers in which the processors are interconnected according to a specific topology. One way to achieve fault tolerant interprocessor communication is by exploiting and effectively utilizing the disjoint paths that exist between pairs of source and destination nodes. In this paper, we construct
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The star graph: An attractive alternative to the hypercube," Proc. Int'l Conf. Parallel Processing, pp. 393400, St. Charles, Ill., 1987.
[2] S.B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs," Proc. Int'l Conf. Supercomputing, pp. 270276,San Francisco, 1987.
[3] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[4] P. Berthomé, A. Ferreira, and S. Perennes, "Optimal Information Dissemination in Star and Pancake Networks," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 720724, Dec. 1993.
[5] D. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 263275, 1991.
[6] K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 3138, Jan. 1994.
[7] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three disjoint path paradigms in star networks," Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 400406, 1991.
[8] P. Fragopoulou and S.G. Akl, “Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions,” J. Parallel and Distributed Computing, vol. 24, pp. 5571, 1995.
[9] P. Fraigniaud and C.T. Ho, "Arcdisjoint spanning trees on the cube connected cycles network," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 225229, St. Charles, Ill., 1991.
[10] P. Fraigniaud, "Faulttolerant gossiping on hypercube multicomputers," Proc. EDMCC2, pp. 463472, Munich, 1991.
[11] L. Gargano, U. Vaccaro, and A. Vozella, “FaultTolerant Routing in the Star and Pancake Interconnection Networks,” Information Processing Letters, vol. 45, pp. 315320, Apr. 1993.
[12] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,2491,268, Sept. 1989.
[13] J. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Characterization of node disjoint (parallel) paths in star graphs," Proc. Int'l Parallel Processing Symp., pp. 404409,Anaheim, Calif., 1991.
[14] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389396, July 1992.
[15] P. Ramanathan and K.G. Shin, "Reliable Broadcast in Hypercube Multicomputers," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6541,657, Dec. 1988.