Communication complexity lower bounds in distributed message-passing

Rotem Oshman

doi:10.1007/978-3-319-09620-9_2

Communication complexity lower bounds in distributed message-passing

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

Abstract

Most theoretical models of distributed systems neglect the cost of local computation, and charge only for communication between the participants in the computation. For example, in shared memory models, we charge only for steps where processes interact with the shared memory, and in message-passing systems we charge only for messages sent between network nodes.

Original language	English
Title of host publication	Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings
Publisher	Springer Verlag
Pages	14-17
Number of pages	4
ISBN (Print)	9783319096193
DOIs	https://doi.org/10.1007/978-3-319-09620-9_2
State	Published - 2014
Externally published	Yes
Event	21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014 - Takayama, Japan Duration: 23 Jul 2014 → 25 Jul 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8576 LNCS

Conference

Conference	21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014
Country/Territory	Japan
City	Takayama
Period	23/07/14 → 25/07/14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-09620-9_2

Cite this

Oshman, R. (2014). Communication complexity lower bounds in distributed message-passing. In Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings (pp. 14-17). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8576 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-09620-9_2

@inproceedings{3578f529fc1e453586e374e3e96dd452,

title = "Communication complexity lower bounds in distributed message-passing",

abstract = "Most theoretical models of distributed systems neglect the cost of local computation, and charge only for communication between the participants in the computation. For example, in shared memory models, we charge only for steps where processes interact with the shared memory, and in message-passing systems we charge only for messages sent between network nodes.",

author = "Rotem Oshman",

year = "2014",

doi = "10.1007/978-3-319-09620-9\_2",

language = "الإنجليزيّة",

isbn = "9783319096193",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "14--17",

booktitle = "Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings",

address = "ألمانيا",

note = "21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014 ; Conference date: 23-07-2014 Through 25-07-2014",

}

Oshman, R 2014, Communication complexity lower bounds in distributed message-passing. in Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8576 LNCS, Springer Verlag, pp. 14-17, 21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014, Takayama, Japan, 23/07/14. https://doi.org/10.1007/978-3-319-09620-9_2

Communication complexity lower bounds in distributed message-passing. / Oshman, Rotem.
Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings. Springer Verlag, 2014. p. 14-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8576 LNCS).

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

TY - GEN

T1 - Communication complexity lower bounds in distributed message-passing

AU - Oshman, Rotem

PY - 2014

Y1 - 2014

N2 - Most theoretical models of distributed systems neglect the cost of local computation, and charge only for communication between the participants in the computation. For example, in shared memory models, we charge only for steps where processes interact with the shared memory, and in message-passing systems we charge only for messages sent between network nodes.

AB - Most theoretical models of distributed systems neglect the cost of local computation, and charge only for communication between the participants in the computation. For example, in shared memory models, we charge only for steps where processes interact with the shared memory, and in message-passing systems we charge only for messages sent between network nodes.

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

U2 - 10.1007/978-3-319-09620-9_2

DO - 10.1007/978-3-319-09620-9_2

M3 - منشور من مؤتمر

SN - 9783319096193

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 14

EP - 17

BT - Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings

PB - Springer Verlag

T2 - 21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014

Y2 - 23 July 2014 through 25 July 2014

ER -

Oshman R. Communication complexity lower bounds in distributed message-passing. In Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings. Springer Verlag. 2014. p. 14-17. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-09620-9_2

Communication complexity lower bounds in distributed message-passing

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this