Efficient deadlock-free routing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient deadlock-free routing

Full text

Pdf (907 KB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the tenth annual ACM symposium on Principles of distributed computing table of contents

Montreal, Quebec, Canada

Pages: 177 - 188

Year of Publication: 1991

ISBN:0-89791-439-2

Authors

Baruch Awerbuch	Dept. of Mathematics and Lab. for Computer Science, M.I.T., Cambridge, MA
Shay Kutten	IBM T.J. Watson Research Center, Yorktown, Heights, NY
David Peleg	Department of Applied Mathematics and Computer, Science, The Weizmann Institute, Rehovot, 76100, Israel

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 19, Citation Count: 4

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/112600.112616 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.

	AAG87	Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. 28th IEEE Syrup. on Foundations of Computer Science, pages 358-370. IEEE, October 1987.
	AM86	B. Awerbuch and S. Micali. Dynamic deadlock resolution protocols. in Proc. 27th IEEE Syrup. on Foundations of Computer Science. IEEE, November 1986.
	BT84	Gabriel Bracha , Sam Toueg, A distributed algorithm for generalized deadlock detection, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.285-301, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806756]
	CJS87	I. Cidon, J. Jaffe, and M. Sidi. Distributed store-and forward deadlock detection and resolution algorithms. IEEE Trans. on Commun., COM- 35:1139-1145, May 1987.
	CM82	K. M. Chandy , J. Misra, A distributed algorithm for detecting resource deadlocks in distributed systems, Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.157-164, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806693]
	G81	K.D. Giinther. Prevention of deadlocks in packet-switched data trans.- port systems. IEEE Trans. on Commun., COM-29:512-524, May 1981.
	GHS83	R. G. Gallager , P. A. Humblet , P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.66-77, Jan. 1983 [doi>10.1145/357195.357200]
	Gop84	I.S. Gopal. Prevention of store-andforward deadlock in computer networks. Research Report RC-10677, IBM Yorktown, August 1984.
	JS89	J.M. Jaffe and M. Sidi. Distributed deadlock resolution in store-and forward networks. Algorithmica, 4, 1989.
	KKM85	E. Korach , S. Kutten , S. Moran, A modular technique for the design of efficient distributed leader finding algorithms, Proceedings of the fourth annual ACM symposium on Principles of distributed computing, p.163-174, August 1985, Minaki, Ontario, Canada [doi>10.1145/323596.323611]
	Mar82	James Martin , Kathleen Kavanagh Chapman , CORPORATE Inc. The Arben Group, SNA: IBM's networking solution, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	MM79	D.A. Menascoe and R. Muntz. Locking and deadlock detection ifi distributed databases. IEEE Trans. on Software Eng., SE-5:195-202, 1979.
	MM84	Don P. Mitchell , Michael J. Merritt, A distributed algorithm for deadlock detection and resolution, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.282-284, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806755]
	MS80	P.M. Merlin and P.J. Schweitzer. Deadlock avoidance in store-andforward networks i: Store and forward deadlock. IEEE Trans. on Commun., COM-28:345-352, March 1980.
	Obe82	Ron Obermarck, Distributed deadlock detection algorithm, ACM Transactions on Database Systems (TODS), v.7 n.2, p.187-208, June 1982 [doi>10.1145/319702.319717]
	TU81	S. Toueg and J.D. Ullman. Deadlockfree packet switching networks. SIAM J. on Comput., 10:594-611, 1981.

CITED BY 4

	Robert Cypher , Luis Gravano, Requirements for deadlock-free, adaptive packet routing, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, p.25-33, August 10-12, 1992, Vancouver, British Columbia, Canada
	Ambrose K. Laing , Robert Cypher, Deadlock-free routing in arbitrary networks via the flattest common supersequence method, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.55-66, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Jean-Claude Bermond , Miriam Di Ianni , Michele Flammini , Stéphane Pérennès, Deadlock prevention by acyclic orientations, Discrete Applied Mathematics, v.129 n.1, p.31-47, 15 June 2003
	J. Błażewicz , D. P. Bovet , J. Brzeziński , G. Gambosi , M. Talamo, Optimal Centralized Algorithms for Store-And-Forward Deadlock Avoidance, IEEE Transactions on Computers, v.43 n.11, p.1333-1338, November 1994