Coding theory, hypercube embeddings, and fault tolerance

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1991

Volumn , Issue , 1991, Pages 125-136

  Aiello, Bill ^a   Leighton, Tom ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; EMBEDDINGS; FAULT TOLERANCE; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

CODING THEORY; CONSTANT LOADS; HYPERCUBE; PRODUCT GRAPH; ROBUST ALGORITHM; WORST-CASE FAULTS;

GEOMETRY;

EID: 0004353039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113379.113391     Document Type: Conference Paper

References (15)

1. W. Aiello, T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 55-64, July 1990.
2. M. Baumslag, 1990. Personal communication.
3. B. Becker and H. U. Simon. How robust is the n-cube? In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 283-291, 1986.
4. S. N. Bhatt and J. Cai. Take a walk, grow a tree. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 469-478, 1988.
5. S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg. Optimal simulations of tree machines. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 274-282. IEEE, Oct. 1986.
6. S. N. Bhatt, D. Greenberg, F. T. Leighton, and P. Liu. Tight bounds for on-line tree embed-dings. In Proceedings of the 2nd Annual SIAM Symposium on Discrete Algorithms, pages 344-350, Jan. 1991.
7. J. Bruck, R. Cypher, and D. Soroker. Running algorithms efficiently on faulty hypercubes. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 37-44, July 1990.
8. D. S. Greenberg and S. N. Bhatt. Routing multiple paths in hypercubes. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 45-54, July 1990.
9. R. W. Hamming. Error detecting and error correcting codes. Bell System Technical Journal, 29:147-160, 1950.
10. J. Hastad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 251-263, May 1989.
11. R. R. Koch. Increasing the size of a network by a constant factor can increase performance by more than a constant factor. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 221-230. IEEE, Oct. 1988.
12. F. T. Leighton, M. Newman, A. Ranade, and E. Schwabe. Dynamic tree embeddings in butterflies and hypercubes. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 224-234, June 1989.
13. M. Livingston, Q. Stout, N. Graham, and F. Hararay. Subcube fault-tolerance in hypercubes. Technical Report CRL-TR-12-87, U. of Michigan Computing Research Laboratory, Sept. 1987.
14. D. Peleg and J. Ullman. An optimal synchronizer for the hypercube. SIAM Journal on Computing, 18(2):740-747, 1989.
15. W. Stahnke. Primitive binary polynomials. Mathematics of Computation, 27(124):977-980, Oct. 1973.