What designers of bus and network architectures should know about hypercubes

IEEE Transactions on Computers

Volumn 52, Issue 4, 2003, Pages 525-544

  LaForge, Laurence E ^a   Korver, Kirk F ^a   Fadali, M Sami ^b  

^a Right Stuff of Tahoe Incorporated   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

C cubes; Configuration architectures; Hamming graphs; Hypercube fault tolerance; Hypercube latency; K cubes; Lee distance; Moore bound; Moore graphs; Performability; Quorums

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; THEOREM PROVING;

CLIQUE-BASED HYPERCUBES; HAMMING DISTANCE; LEE DISTANCE; MOORE BOUND; MOORE GRAPHS; MULTIVARIATE OPTIMIZATION; PERFORMABILITY; QUORUMS;

COMPUTER ARCHITECTURE;

EID: 0037963273     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1190592     Document Type: Article

References (44)

1. J.R. Armstrong and F.G. Gray, "Fault Diagnosis in a Boolean n Cube of Microprocessors," IEEE Trans. Computers, vol. 30, no. 8, pp. 587-590, Aug. 1981.
2. A. Avizienis, "On the Hundred Year Spacecraft," Proc. First NASA/DOD Workshop Evolvable Hardware, pp. 233-239, July 1999.
3. A. Avizienis, "Toward Systematic Design of Fault-Tolerant Systems," Computer, pp. 51-58, Apr. 1997.
4. P. Banerjee, S.-Y. Kuo, and W.K. Fuchs, "Reconfigurable Cube-Connected Cycles Architectures," Proc. 16th Int'l Symp. Fault Tolerant Computing, pp. 286-291, July 1986.
5. J.-C. Bermond, C. Delorme, and J.-J. Quisquater, "Strategies for Interconnection Networks, Some Results from Graph Theory," J. Parallel and Distributed Computing, vol. 3, pp. 433-449, 1986.
6. J.-C. Bermond and B. Bollobás, "The Diameter of Graphs-A Survey," Congressus Numerantium, vol. 32, pp. 3-37, 1981.
7. N. Biggs, Algebraic Graph Theory, second ed. New York: Cambridge Univ. Press, 1996.
8. B. Bollobás, Extremal Graph Theory. London: Academic Press, 1978.
9. B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of k-Ary n-Cubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1021-1030, Aug. 1995.
10. A.E. Brouwer, A.M. Cohen, and A. Neumaier, Distance-Regular Graphs. Berlin: Springer-Verlag, 1989.
11. G. Chartrand and L. Lesniak, Graphs and Diagraphs, second ed. Belmont, Calif.: Wadsworth, Inc., 1986.
12. Y.-Y. Chen and S.J. Upadhyaya, "Reliability, Reconfiguration, and Spare Allocation Issues in Binary Tree Architectures Based on Multiple-Level Redundancy," IEEE Trans. Computers, vol. 42, no. 6, pp. 713-723, June 1993.
13. S. Dutt and J.P. Hayes, "On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures," IEEE Trans. Computers, vol. 39, no. 4, pp. 490-503, Apr. 1990.
14. R.W. Hamming, Coding and Information Theory, second ed. Upper Saddle River, N.J.: Prentice Hall, 1986.
15. F. Harary, "The Maximum Connectivity of a Graph," Proc. Nat'l Academy of Science, vol. 48, pp. 1142-1146, 1962.
16. B.R. Haverkort and I.G. Niemegeers, "Performability Modelling Tools and Techniques," Performance Evaluation, vol. 25, pp. 17-40, 1996.
17. J.P. Hayes, "A Graph Model for Fault Tolerant Computing Systems," IEEE Trans. Computers, vol. 25, no. 9, pp. 875-884, Sept. 1976.
18. J. Hecht, "Breaking the Metro Bottleneck," Technology Rev., pp. 48-53, June 2001.
19. A.J. Hoffman and R.R. Singleton, "On Moore Graphs with Diameters 2 and 3," IBM J. Research and Development, vol. 4, pp. 497-504, 1960.
20. A. Itai, Y. Perl, and Y. Shiloach, "The Complexity of Finding Maximum Disjoint Paths with Length Constraints," Networks, vol. 12, pp. 277-286, 1982.
21. J.M. Kumar and L.M. Patniak, "Extended Hypercube: A Hierarchical Iterconnection Network of Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 1, pp. 45-57, Jan. 1992.
22. C.-L. Kwan and S. Toida, "Optimal Fault-Tolerant Realizations of Some Classes of Hierarchical Tree Systems," Proc. 11th Ann. Symp. Fault-Tolerant Computing, pp. 176-178, June 1981.
23. L.E. LaForge, "Self-Healing Avionics for Starships," Proc. IEEE 2000 Aerospace Conf., Mar. 2000. http://faculty.erau.edu/laforgel/.
24. L.E. LaForge, "Architectures and Algorithms for Self-Healing Autonomous Spacecraft," Phase I report, NASA Inst. for Advanced Concepts, Jan. 2000, revised Feb. 2000. http://faculty.erau.edu/laforgel/ and http://niac.usra.edu.
25. L.E. LaForge, "Fault Tolerant Physical Interconnection of X2000 Computational Avionics," document number JPL D-16485, Jet Propulsion Laboratory, Pasadena, Calif., Aug. 1998, revised Oct. 1999. http://knowledge.jpl.nasa.gov/adssdlib/ and http://faculty.erau.edu/laforge/.
26. L.E. LaForge, "Configuration of Locally Spared Arrays in the Presence of Multiple Fault Types," IEEE Trans. Computers, vol. 48, no. 4, pp. 398-416, Apr. 1999. http://faculty.erau.edu/laforgel/.
27. L.E. LaForge, K. Huang, and V.K. Agarwal, "Almost Sure Diagnosis of Almost Every Good Element," IEEE Trans. Computers, vol. 43, no. 3, pp. 295-305, Mar. 1994.
28. L.E. LaForge and K.F. Korver, "Algorithmic Method and Computer System for Synthesizing Self-Healing Networks, Bus Structures, and Connectivities," US Patent 60/261,863 pending, Jan. 2001.
29. L.E. LaForge and K.F. Forver, "Mutual Test and Diagnosis: Architectures and Algorithms for Spacecraft Avionics," Proc. IEEE 2000 Aerospace Conf., Mar. 2000.
30. L.E. LaForge and K.F. Forver, "Graph-Theoretic Fault Tolerance for Spacecraft Bus Avionics," Proc. IEEE 2000 Aerospace Conf., Mar. 2000.
31. T. Leighton and C.E. Leiserson, "Wafer-Scale Integration of Systolic Arrays," IEEE Trans. Computers, vol. 34, no. 5, pp. 448-461, May 1985.
32. D.G. Leeper, "A Long-Term View of Short-Range Wireless," Computer, pp. 39-44, June 2001.
33. E.F. Moore and C.E. Shannon, "Reliable Circuits Using Less Reliable Relays, Part I," J. Franklin Inst., vol. 262, pp. 191-208, Sept. 1956.
34. U.S.R. Murty and K. Vijayan, "On Accessibility in Graphs," Sakhya Ser. A, vol. 26, pp. 299-302, 1964.
35. H. Nabli and B. Sericola, "Performability Analysis: A New Algorithm," IEEE Trans. Computers, vol. 45, no. 4, pp. 491-494, Apr. 1996.
36. O. Ore, Theory of Graphs. Providence: Am. Math. Soc. Publications, 1962.
37. F.P. Preparata and J. Vallemin, "The Cube-Connected Cycles, a Versatile Network for Parallel Computation," Comm. ACM, pp. 30-39, May 1981.
38. M. Sampels, E-mail communication to L.E. LaForge, Nov. 1999.
39. M. Sampels, "Large Networks with Small Diameter," Proc. Graph-Theoretic Concepts in Computer Science, 23rd Int'l Workshop, R.H. Möhring, ed., pp. 288-302, Oct. 1997.
40. J.W. Surbelle and R.J. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths," Networks, vol. 14, pp. 325-336, 1984.
41. G.B. Thomas, Calculus and Analytic Geometry, fourth ed., p. 623. Reading, Mass.: Addison Wesley, 1969.
42. J. Wu, "Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes," IEEE Trans. Computers, vol. 44, no. 5, pp. 702-706, May 1995.
43. M.R. Zargham, Computer Architecture: Single and Parallel Systems. Upper Saddle River, NJ.: Prentice Hall, 1996.
44. S.Q. Zheng and S. Latifi, "Optimal Simulation of Linear Multi-processor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 612-619, June 1996.