Competitive fault-tolerance in area-universal networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Competitive fault-tolerance in area-universal networks

Full text

Pdf (1.19 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures table of contents

San Diego, California, United States

Pages: 236 - 246

Year of Publication: 1992

ISBN:0-89791-483-X

Author

Sivan Toledo

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 9, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/140901.141873 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Bill Aiello , Tom Leighton, Coding theory, hypercube embeddings, and fault tolerance, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.125-136, July 21-24, 1991, Hilton Head, South Carolina, United States [doi>10.1145/113379.113391]
	2	S.N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems, Journal of Computer and System Sciences, 28(2):300-343, 1984.
	3	R. L. Greenberg. Efficient lnterconnection Schemes for VLSI and Parallel Computation. PhD thesis, Department of Electrical Engineering and computer Science, Massachusetts Institute of Technology, September 1989. MIT/LCS/TR-456.
	4	Frank Thomson Leighton, Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks, MIT Press, Cambridge, MA, 1983
	5	T. Leighton and C. E. Leiserson. Wafer-scale integration of systolic arrays. IEEE Transactions on Computers, C-34(5):448-461, 1985.
	6	T. Leighton and C. E. Leiserson. Personal communication.
	7	T. Leighton and B. Maggs. Expanders might be practical: fast algorithms for routing around faults on muhibutterflies. Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 384-389, 1989.
	8	T. Leighton, B. Maggs and S. Rao. Universal packet routing algorithms. Proceedings of the 29th Annual IEEE Symposium on the Foundations of Computer Science, pages 256-269, 1988.
	9	C. E. Leiserson. Area-Efficient VLSI Computation. ACM Doctoral Dissertation Award Series, MIT Press, Cambridge, Massachusetts, 1983.
	10	Charles E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Transactions on Computers, v.34 n.10, p.892-901, Oct. 1985
	11	Charles E. Leiserson, VLSI theory and parallel supercomputing, Proceedings of the decennial Caltech conference on VLSI on Advanced research in VLSI, p.5-16, June 1989, Cambridge, Massachusetts, United States
	12	C. Mead and M. Rem. Cost and performance of VLSI computing structures, IEEE Journal of Solid State Circuits, SC-14(2):455-462, 1979.
	13	C. H. Séquin , A. M. Despain , D. A. Patterson, Communication In X-TREE, A Modular Multiprocessor System, Proceedings of the 1978 annual conference, p.194-203, December 04-06, 1978, Washington, D.C., United States [doi>10.1145/800127.804098]
	14	C. D. Thompson. Area-time complexity for VLSI. In Caltech Conference on Very Large Scale Integration, pages 495-508, 1979.
	15	L. G. Valiant. Universality considerations in VLSI circuits. IEEE Transactions on Computers, C- 30(2):135-140, 1981.