Cost-sensitive analysis of communication protocols

Baruch Awerbuch; Alan Baratz; David Peleg

doi:10.1145/93385.93417

Cost-sensitive analysis of communication protocols

Baruch Awerbuch
, Alan Baratz
, David Peleg

Massachusetts Institute of Technology

Research output: Contribution to conference › Paper › peer-review

94 Scopus citations

Abstract

This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchronization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., constructing a minimum spanning tree, constructing a shortest path tree.

Original language	English
Pages	177-187
Number of pages	11
DOIs	https://doi.org/10.1145/93385.93417
State	Published - 1990
Externally published	Yes
Event	Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing - Quebec City, Que, Can Duration: 22 Aug 1990 → 24 Aug 1990

Conference

Conference	Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing
City	Quebec City, Que, Can
Period	22/08/90 → 24/08/90

Access to Document

10.1145/93385.93417

Cite this

@conference{59f65e4de1504581a62b2c9be62aadac,

title = "Cost-sensitive analysis of communication protocols",

abstract = "This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchronization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., constructing a minimum spanning tree, constructing a shortest path tree.",

author = "Baruch Awerbuch and Alan Baratz and David Peleg",

year = "1990",

doi = "10.1145/93385.93417",

language = "אנגלית",

pages = "177--187",

note = "Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 22-08-1990 Through 24-08-1990",

}

TY - CONF

T1 - Cost-sensitive analysis of communication protocols

AU - Awerbuch, Baruch

AU - Baratz, Alan

AU - Peleg, David

PY - 1990

Y1 - 1990

N2 - This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchronization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., constructing a minimum spanning tree, constructing a shortest path tree.

AB - This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchronization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., constructing a minimum spanning tree, constructing a shortest path tree.

UR - https://www.scopus.com/pages/publications/0025558446

U2 - 10.1145/93385.93417

DO - 10.1145/93385.93417

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0025558446

SP - 177

EP - 187

T2 - Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 22 August 1990 through 24 August 1990

ER -

Cost-sensitive analysis of communication protocols

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this