Efficient deadlock-free routing

Baruch Awerbuch; Shay Kutten; David Peleg

doi:10.1145/112600.112616

Efficient deadlock-free routing

Baruch Awerbuch, Shay Kutten, David Peleg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

This paper deals with store-and-forward deadlocks in communication networks. The goal is to design deadlock-free routing schemes with small overhead in communication and space. Our main contribution is designing efficient protocols that are superior to existing ones in terms of their performance.

Original language	English
Title of host publication	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	177-188
Number of pages	12
ISBN (Print)	0897914392
DOIs	https://doi.org/10.1145/112600.112616
State	Published - 1 Jul 1991
Externally published	Yes
Event	10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 - Montreal, Canada Duration: 19 Aug 1991 → 21 Aug 1991

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991
Country/Territory	Canada
City	Montreal
Period	19/08/91 → 21/08/91

Bibliographical note

Publisher Copyright:
© 1991 ACM.

Funding

*Dept. of Mathematics and Lab. for Com puter Science, M. I.T., Cambridge, MA 02139. Supported by Air Force Contract TNDGAFOSR-86-0078, ARO contract DAAL03-86-K-0171, NSF contract CCR861 1442, and a special grant from IBM. Part of the work was done while visiting IBM T.J. Watson Research Center. tIBM T*J. Watson Research

Funders	Funder number
National Science Foundation	CCR861 1442
Army Research Office	DAAL03-86-K-0171
International Business Machines Corporation
Air Force Institute of Technology	TNDGAFOSR-86-0078

Access to Document

10.1145/112600.112616

Cite this

@inproceedings{6133630182b640d4a62378d690b474d3,

title = "Efficient deadlock-free routing",

abstract = "This paper deals with store-and-forward deadlocks in communication networks. The goal is to design deadlock-free routing schemes with small overhead in communication and space. Our main contribution is designing efficient protocols that are superior to existing ones in terms of their performance.",

author = "Baruch Awerbuch and Shay Kutten and David Peleg",

note = "Publisher Copyright: {\textcopyright} 1991 ACM.; 10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 ; Conference date: 19-08-1991 Through 21-08-1991",

year = "1991",

month = jul,

day = "1",

doi = "10.1145/112600.112616",

language = "אנגלית",

isbn = "0897914392",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "177--188",

booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

Awerbuch, B, Kutten, S & Peleg, D 1991, Efficient deadlock-free routing. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 177-188, 10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991, Montreal, Canada, 19/08/91. https://doi.org/10.1145/112600.112616

Efficient deadlock-free routing. / Awerbuch, Baruch; Kutten, Shay; Peleg, David.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 1991. p. 177-188 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient deadlock-free routing

AU - Awerbuch, Baruch

AU - Kutten, Shay

AU - Peleg, David

PY - 1991/7/1

Y1 - 1991/7/1

N2 - This paper deals with store-and-forward deadlocks in communication networks. The goal is to design deadlock-free routing schemes with small overhead in communication and space. Our main contribution is designing efficient protocols that are superior to existing ones in terms of their performance.

AB - This paper deals with store-and-forward deadlocks in communication networks. The goal is to design deadlock-free routing schemes with small overhead in communication and space. Our main contribution is designing efficient protocols that are superior to existing ones in terms of their performance.

UR - http://www.scopus.com/inward/record.url?scp=85029498591&partnerID=8YFLogxK

U2 - 10.1145/112600.112616

DO - 10.1145/112600.112616

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85029498591

SN - 0897914392

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 177

EP - 188

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991

Y2 - 19 August 1991 through 21 August 1991

ER -

Efficient deadlock-free routing

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this