Bill Aiello
- 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 A rchilectares, pages 55-64, July 1990. Google Scholar
Digital Library
- 2.M. Baumslag, 1990. Personal communication.Google Scholar
- 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.Google ScholarDigital Library
- 4.S. N. Bhatt and J. Cal. Take a walk, grow a tree. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 469- 478, 1988.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 6.S. N. Bhatt, D. Greenberg, F. T. Leighton, and P. Liu. Tight bounds for on-line tree embeddings. In Proceedings of the 2nd Annual SIAM Symposium on Discrete Algorithms, pages 344- 350, Jan. 1991. Google ScholarDigital Library
- 7.J. Bruck, R. Cypher, and D. Soroker. Running algorithms efficiently on faulty hypercubes. In Proceedings of the 1990 A CM Symposium on Parallel Algorithms and Architectures, pages 37- 44, July 1990. Google ScholarDigital Library
- 8.D. S. Greenberg and S. N. Bhatt. Routing multiple paths in hypercubes. In Proceedings of the 1990 A CM Symposium on Parallel Algorithms and Architectures, pages 45-54, July 1990. Google ScholarDigital Library
- 9.R. W. Ilamming. Error detecting and error correcting codes. Bell System Technical Journal, 29:147-160, 1950.Google ScholarCross Ref
- 10.J. Hastad, T. Leighton, and M. Newman. Fast computation using faulty hypercubes. In Pro. ceedings of the 21st Annual A CM Symposium on Theory of Compuling, pages 251-263, May 1989. Google Scholar
- 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 Compuler Science, pages 221-230. IEEE, Oct. 1988.Google ScholarDigital Library
- 12.F. T. Leighton, M. Newman, A. Ranade, and E. Schwabe. Dynamic tree embeddings in butterflies and hypercubes. In Proceedings of the 1989 A CM Symposium on Parallel Algorithms and Architectures, pages 224-234, June 1989. Google ScholarDigital Library
- 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.Google Scholar
- 14.D. Peleg and J. Ullman. An optimal synchronizer for the hypercube. SIAM Journal on Computing, 18(2) :740-747, 1989. Google ScholarDigital Library
- 15.W. Stahnke. Primitive binary polynomials. Mathematics of Computation, 27(124):977-980, Oct. 1973.Google ScholarCross Ref
Index Terms
- Coding theory, hypercube embeddings, and fault tolerance
Recommendations
Subcube Fault Tolerance in Hypercube Multiprocessors
In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take ...
Hamming Codes, Hypercube Embeddings, and Fault Tolerance
In this paper, we devise a special $1$-error-correcting code that enables us to embed the graph product of an $N/\log N$-node hypercube and a $\log N$-node complete graph into in an $N$-node hypercube with constant load, dilation, and congestion. We ...
Fault Tolerance in Multiprocessor Systems Without Dedicated Redundancy
An algorithm called RAFT (recursive algorithm for fault tolerance) for achieving fault tolerance in multiprocessor systems is described. Through the use of a combination of dynamic space- and time- redundancy techniques, RAFT achieves fault tolerance in ...
Comments