Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults

IEEE Transactions on Computers

Volumn 43, Issue 7, 1994, Pages 841-848

  Banerjee, Prithviraj ^a   Peercy, Michael ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Fault tolerance; hypercubes; meshes; performance; reconfiguration; simulation

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; ERROR CORRECTION; PROGRAM PROCESSORS; RELIABILITY; SYSTEMS ANALYSIS; TOPOLOGY;

FAULT TOLERANCE; HYPERCUBES; MESHES; SPARE PROCESSORS;

COMPUTER HARDWARE;

EID: 0028464805     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.293264     Document Type: Article

References (29)

1. C. L. Seitz, “The cosmic cube,” Commun. ACM, vol. 28, pp. 22-33, Jan. 1985.
2. W. J. Dally and C. L. Seitz, “The torus routing chip,'’ Distributed Computing, vol. 1, pp. 187-196, 1986.
3. D. A. Rennels, “On implementing fault tolerance in binary hypercubes,” in Proc. 16th Int. Symp. Fault-Tolerant Computing, July 1986, pp. 344-349.
4. P. Banerjee, J. T. Rahmeh, C. Stunkel, V. S. S. Nair, K. Roy, and J. A. Abraham, “An evaluation of system-level fault tolerance on the Intel hypercube multiprocessor,” in Proc. 18th Int. Symp. Fault-Tolerant Computing, June 1988, pp. 362-367.
5. S. C. Chau and A. L. Leistman, “A proposal for a fault-tolerant binary hypercube architecture,” in Proc. 19th Int. Symp. Fault Tolerant Computing, Chicago, IL, June 1989, pp. 323-330.
6. M. S. Alam and R. G. Melham, “An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes,” IEEE Trans. Parallel Distrib. Syst., vol. 3, pp. 117-126, Jan. 1991.
7. E. Chow, H. Madan, J. Peterson, D. Grunwald, and D. Reed, “Hyperswitch network for the hypercube com- puter,” in Proc. 15th Int. Symp. Comput. Architecture, May 1988, pp. 90-99.
8. S. F. Nugent, ' x2018; ' x2018;The iPSC/2 direct-connect communications technology,” in Proc. 3rd Conf. Hypercube Concurrent Comput. and Applicat., Jan. 1988, pp. 51-60.
9. P. Kermani and L. Kleinrock, “Virtual cut-through: A new computer communication switching technique,” Comput. Netw., vol. 3, pp. 267-286, Sept. 1979.
10. T. C. Lee and J. P. Hayes, “Routing and broadcasting in faulty hypercube computers,” in Proc. 3rd Conf. Hypercube Concurrent Comput. and Applicat., Jan. 1988, pp. 346-354.
11. M.-S. Chen and K. G. Shin, “Depth-first search approach for fault-tolerant routing in hypercube multicomputers,” IEEE Trans. Parallel Distrib. Syst., vol. 2, pp. 152-159, Apr. 1990.
12. J. M. Gordon and Q. F. Stout, “Hypercube message routing in the presence of faults,” in Proc. 3rd Conf. Hypercube Concurrent Comput. and Applicat., Jan. 1988, pp. 318-327.
13. H. Badr and S. Podar, “An optimal shortest-path routing policy for network computers with regular mesh-connected topologies,” IEEE Trans. Comput., vol. 38, pp. 1362—1371, Oct. 1989.
14. M. Peercy and P. Banerjee, “Distributed algorithms for shortest-path, deadlock-free routing and broadcasting in arbitrarily faulty hypercubes,” in Proc. 20th Int. Symp. Fault-Tolerant Computing, June 1990, pp. 218-225.
15. P. Banerjee, “Reconfiguring a hypercube in the presence of faults,” in Proc. 4th Conf. Hypercube Concurrent Comput. and Applicat., Mar. 1989, pp. 200-207.
16. P. Banerjee, ”Strategies for reconfiguring hypercubes under faults,” in Proc. 20th Int. Symp. Fault-Tolerant Computing, June 1990, pp. 210-217.
17. J. Hsu and P. Banerjee, “Performance measurements and trace-driven simulation of parallel CAD and numeric applications on hypercube multicomputers,” IEEE Trans. Parallel Distrib. Syst., vol. 3, no. 4, pp. 451-464, July 1992.
18. M. Livingston and Q. F. Stout, “Distributing resources in hypercube computers,” in Proc. 3rd Conf Hypercube Concurrent Comput. and Applicat., Pasadena, CA, Jan. 1988, pp. 222-231.
19. A. L. N. Reddy, P. Banerjee, and S. G. Abraham, “I/O embedding in hypercubes,” in Proc. 17th Int. Conf Parallel Processing, St. Charles, IL, Aug. 15-19, 1988, pp. 331-338.
20. J. Wakerly, Error Detecting Codes, Self-Checking Circuits and Applications. New York: Elsevier North Holland, 1978.
21. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewoods Cliffs, NJ: Prentice-Hall, 1982.
22. P. Banerjee and M. Peercy, “Design and evaluation of hardware strategies for reconfiguring hypercubes and meshes under faults,” Coordinated Science Lab. Tech. Rep., 1992.
23. H. D. Schwetman, “CSIM: A C-based, process-oriented simulation language,” Tech. Rep. PP-080-85, Austin, TX, 1985.
24. G. C. Fox, M. A. Johnson, G. A. Lyzenga, S. W. Otto, and J. K. Salmon, Solving Problems on Concurrent Processors. Englewood Cliffs, NJ: Prentice-Hall, 1989.
25. A. Pothen, S. Jha, and U. Vemulapati, “Orthogonal facotrization on a distributed memory multiprocessor,” in Proc. 2nd SIAM Conf Hypercube Comput. and Appicat., 1987, pp. 587-596.
26. M. Gupta and P. Banerjee, “Demonstration of automated data partitioning techniques in parallelizing compilers for distributed memory multiprocessors,” IEEE Trans. Parallel Distrib. Syst., vol. 3, no. 2, pp. 179-193, Mar. 1992.
27. K. P. Belkhale and P. Banerjee, “PACE2: An improved parallel VLSI extractor with parametric extraction,” in Proc. Int. Conf. Comput.-Aided Design, Santa Clara, CA, Nov. 1989, pp. 526-530.
28. J. Sargent and P. Banerjee, “A parallel row-based algorithm for standard cell placement with integrated error control,” in Proc. 26th Design Automation Conf, Las Vegas, NV, June 1989, pp. 590-594.
29. S. Patil and P. Banerjee, “A parallel branch and bound approach to test generation,” IEEE Trans. Comput.-Aided Design of Circuits and Syst., vol. 9, pp. 313-322, Mar. 1990.