Embedding and reconfiguration of spanning trees in faulty hypercubes

IEEE Transactions on Parallel and Distributed Systems

Volumn 10, Issue 3, 1999, Pages 211-222

  Avresky, Dimiter R ^a,b  

^a IEEE   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE UNBALANCED SPANNING TREES (CUST); GENERAL SPANNING TREES (GST); HYPERCUBE NETWORKS;

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; FAULT TREE ANALYSIS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0032659763     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.755820     Document Type: Article

References (27)

1. K. Altawil and D.R. Avresky, "Reconfiguration of Spanning Trees in Faulty Hypercubes," Proc. 23rd Int'l Conf. Parallel Processing, pp. II319-II323, Aug. 1994.
2. D.R. Avresky and K.M. Altawil, "Reconfiguration of Faulty Hypercubes," Lecture Notes in Computer Science 852, pp. 529-545. Springer-Verlag, 1994.
3. S.G. Aki, The Design and Analysis of Parallel Algorithms. Prentice Hall Int'l, Inc., 1989.
4. A. Bagchi and S. Hakimi, "Data Transfers in Broadcast Networks," IEEE Trans. Computers, vol. 41, no. 7, pp. 842-847, July 1992.
5. P. Banerjee, "Strategies for Reconfiguring Hypercubes Under Faults," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 210-217, June 1990.
6. J.L. Bentley, "A Parallel Algorithm for Constructing Minimum Spanning Trees," J. Algorithms, vol. 1, no. 1, pp. 51-59, Mar. 1980.
7. A. Bagchi, S. Hakimi, J. Mitchem, and E. Schmeichel, "Parallel Algorithms for Gossiping by Mail, " Information Processing Letters, vol. 34, pp. 197-202, Apr. 1990.
8. D. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 263-275, 1991.
9. J. Bruck, R. Cypher, and D. Soroker, "Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes," IEEE Trans. Computers, vol. 43, no. 10, pp. 1,210-1,220, Oct. 1994.
10. J. Bruck, R. Cypher, and D. Soroker, "Tolerating Faults in Hypercubes Using Subcube Partitioning," IEEE Trans. Computers, vol. 41, no. 5, pp. 599-605, May 1992.
11. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, pp. 498-513. McGraw-Hill, 1990.
12. M.Y. Chen and S. Lee, "Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 3, pp. 277-288, Mar. 1993.
13. K. Efe and K. Ramaiyer, "Congestion and Fault Tolerance of Binary Tree Embeddings on Hypercube," Proc. Fifth Int'l. Parallel Processing Symp., 1991.
14. G. Frederickson, "Data Structures for On-Line Updating of Minimum Spanning Trees with Applications," SIAM J. Computing, vol. 14, no. 4, Nov. 1985.
15. R. Gallager, P. Humblet, and P. Spira, "A Distributed Algorithm for Minimum Weight Spanning Trees," ACM Trans. Programmable Languages and Systems, vol. 5, no. 1, pp. 66-77, Jan. 1983.
16. R. Jain. The Art of Computer Systems Performance Analysis. John Wiley and Sons, Inc., 1991.
17. S. Johnsson, and C. Ho, "Optimum Broadcasting and Personalized Communication in Hypercubes," IEEE Trans. Computers, vol. 38, no. 9, pp. 197-202, Sept. 1989.
18. M. Peercy and P. Banerjee, "Distributed Algorithms for Shortest-Path, Deadlock-Free Routing and Broadcasting in Arbitrarily Faulty Hypercubes," Proc. 20th Int'l Symp. Fault Tolerant Computing, pp. 218-225, June 1990.
19. S. Ravindran and A. Gibbons, "Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube," Information Processing Letters, vol. 45, pp. 321-325, Apr. 1993.
20. A. Sen, A. Sengupta, and S. Bandyopadhyay, "On Some Topological Properties of Hypercube, Incomplete Hypercube and Supercube," Proc. Seventh Int'l. Parallel Processing Symp., 1993.
21. A. Sen, A. Sengupta, and S. Bandyopadhyay, " On the Routing Problem in Faulty Supercubes," Information Processing Letters, vol. 42, pp. 39-46, Apr. 1992.
22. G. Stamoulis and J. Tsitsiklis, "An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube," Information Processing Letters, vol. 46, pp. 219-224, July 1993.
23. G. Stamoulis and J. Tsitsiklis, "Efficient Routing Schemes for Multiple Broadcasts in Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 7, pp. 725-739, July 1993.
24. A. Wagner, "Embedding All Binary Trees in the Hypercube," J. Parallel and Distributed Computing, vol. 18, pp. 33-43, 1993.
25. W.W. White, "Mapping General Trees and Graphs into the Hypercube," Proc. ISCA Int'l Conf. Parallel and Distributed Computing, pp. 157-161, 14-16 Oct. 1993.
26. P. Yang and C. Raghavendra, "Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes," Proc. Sixth Int'l. Parallel Processing Symp., pp. 2-9, 1992.
27. P. Yang and C. Raghavendra, "Reconfiguration of Binary Trees in Faulty Hypercubes," Proc. Seventh Int'l Parallel Processing Symp., pp. 401-405, 1993.