Fast-fault-tolerant parallel communication and on-line maintenance using information dispersal

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fast-fault-tolerant parallel communication and on-line maintenance using information dispersal

Full text

Pdf (1.11 MB)

Source

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

Island of Crete, Greece

Pages: 378 - 387

Year of Publication: 1990

ISBN:0-89791-370-1

Author

Y.-D. Lyuu

Aiken Computation Laboratory, Harvard University, Cambridge, MA

Sponsors

IEEE-CS : Computer Society
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
CTI : Computer Technology Inst.
EATCS : European Association for Theoretical Computer Science
Computer Tech Inst. : Computer Technology Institute

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 14, Citation Count: 2

Additional Information:

references cited by 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/97444.97705 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	R. Aleliunas, Randomized parallel communication (Preliminary Version), Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.60-72, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806683]
	2	Chernoff, H. "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations." Ann. Math. Statist., 23 (1952), 493- 507.
	3	Hardy, G.H., and E.M. Wright. An Introduction to the Theory of Numbers. 5th ed. Oxford: Oxford University Press, 1979.
	4	J. Hastad , T. Leighton, Fast computation using faulty hypercubes, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.251-263, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73031]
	5	Kai Hwang , Faye A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, Inc., New York, NY, 1990
	6	Katzman, J.A. "The Tandem 16: A Fault- Tolerant Computing System." In Computer Structures: Principles and Examples. Siewiorek, D.P., C.G. Bell, and A. Newell. New York: McGraw- Hill, 1982.
	7	Leighton, F.T., B. Maggs, and S. Rao. "Universal Packet Routing Algorithms." In Proc. 29th Annu. IEEE Syrup. Found. Comput. Sci., 1988, pp. 256- 269.
	8	Lyuu, Y.-D. "Fast Fault-Tolerant Parallel Communication with Low Congestion and On-Line Maintenance Using Information Dispersal." Technical Report TR-19-89, Aiken Computation Lab., Harvard University, October 1989.
	9	Pippenger, N. "Parallel Communication with Limited Buffers." In Proc. 25th Annu. IEEE Syrup. Found. Comput. Sci., 1984, pp. 127-136.
	10	Preparata, F.P., "Holographic Dispersal and Recovery of Information." IEEE Trans. on Information Theory, IT-35, No. 5 (September 1989), 1123-1124.
	11	Michael O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of the ACM (JACM), v.36 n.2, p.335-348, April 1989 [doi>10.1145/62044.62050]
	12	Raghavan, P. "Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs." In Proc. 27th Annu. IEEE Syrup. Found. Comput. Sci., 1986, pp. 10-18.
	13	Ranade, A.G. "How to Emulate Shared Memory." In Proc. 28th Annu. IEEE Syrup. Found. Comput. Sci., 1987, pp. 185-194.
	14	Siewiorek, D.P., and R.S. Swarz. The Theory and Practice of Reliable System Design. Bedford, Mass." Digital, 1982.
	15	Thinking Machines Corp. "Connection Machine Model CM-2 Technical Summary." Thinking Machines Technical Report HA87-4, Cambridge, Mass., April 1987.
	16	Eli Upfal, Efficient schemes for parallel communication, Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.55-59, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806682]
	17	Valiant, L.G. "A Scheme for Fast Parallel Communication." SIAM J. Comput., 11, No. 2 (May 1982), 350-361.
	18	L. G. Valiant , G. J. Brebner, Universal schemes for parallel communication, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.263-277, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802479]

CITED BY 2

	William Aiello , Baruch Awerbuch , Bruce Maggs , Satish Rao, Approximate load balancing on dynamic and asynchronous networks, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.632-641, May 16-18, 1993, San Diego, California, United States
	Tom Leighton, Methods for message routing in parallel machines, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.77-96, May 04-06, 1992, Victoria, British Columbia, Canada