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 - https://doi.org/10.1007/978-3-319-09620-9_2
DO - https://doi.org/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
T2 - 21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014
Y2 - 23 July 2014 through 25 July 2014
ER -