Efficient deadlock-free routing

Baruch Awerbuch, Shay Kutten, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages177-188
Number of pages12
ISBN (Print)0897914392
DOIs
StatePublished - 1 Jul 1991
Externally publishedYes
Event10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 - Montreal, Canada
Duration: 19 Aug 199121 Aug 1991

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991
Country/TerritoryCanada
CityMontreal
Period19/08/9121/08/91

Bibliographical note

Publisher Copyright:
© 1991 ACM.

Fingerprint

Dive into the research topics of 'Efficient deadlock-free routing'. Together they form a unique fingerprint.

Cite this