Communication complexity lower bounds in distributed message-passing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationStructural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings
PublisherSpringer Verlag
Pages14-17
Number of pages4
ISBN (Print)9783319096193
DOIs
StatePublished - 2014
Externally publishedYes
Event21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014 - Takayama, Japan
Duration: 23 Jul 201425 Jul 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8576 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014
Country/TerritoryJapan
CityTakayama
Period23/07/1425/07/14

Fingerprint

Dive into the research topics of 'Communication complexity lower bounds in distributed message-passing'. Together they form a unique fingerprint.

Cite this