Stone age distributed computing

Yuval Emek; Roger Wattenhofer

doi:10.1145/2484239.2484244

Stone age distributed computing

Yuval Emek, Roger Wattenhofer

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

Abstract

A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.

Original language	English
Title of host publication	PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing
Pages	137-146
Number of pages	10
DOIs	https://doi.org/10.1145/2484239.2484244
State	Published - 2013
Externally published	Yes
Event	2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 - Montreal, QC, Canada Duration: 22 Jul 2013 → 24 Jul 2013

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	2013 ACM Symposium on Principles of Distributed Computing, PODC 2013
Country/Territory	Canada
City	Montreal, QC
Period	22/07/13 → 24/07/13

Keywords

Cellular automata
Efficient algorithms
Finite state machines
Message passing

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/2484239.2484244

Cite this

@inproceedings{3a3545d96f694bf88ee2ee29192e4c31,

title = "Stone age distributed computing",

abstract = "A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.",

keywords = "Cellular automata, Efficient algorithms, Finite state machines, Message passing",

author = "Yuval Emek and Roger Wattenhofer",

year = "2013",

doi = "10.1145/2484239.2484244",

language = "אנגלית",

isbn = "9781450320658",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "137--146",

booktitle = "PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing",

note = "2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 ; Conference date: 22-07-2013 Through 24-07-2013",

}

Emek, Y & Wattenhofer, R 2013, Stone age distributed computing. in PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 137-146, 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, Montreal, QC, Canada, 22/07/13. https://doi.org/10.1145/2484239.2484244

TY - GEN

T1 - Stone age distributed computing

AU - Emek, Yuval

AU - Wattenhofer, Roger

PY - 2013

Y1 - 2013

N2 - A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.

AB - A new model that depicts a network of randomized finite state machines operating in an asynchronous environment is introduced. This model, that can be viewed as a hybrid of the message passing model and cellular automata is suitable for applying the distributed computing lens to the study of networks of sub-microprocessor devices, e.g., biological cellular networks and man-made nano-networks. Although the computation and communication capabilities of each individual device in the new model are, by design, much weaker than those of an abstract computer, we show that some of the most important and extensively studied distributed computing problems can still be solved efficiently.

KW - Cellular automata

KW - Efficient algorithms

KW - Finite state machines

KW - Message passing

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

U2 - 10.1145/2484239.2484244

DO - 10.1145/2484239.2484244

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84883495384

SN - 9781450320658

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 137

EP - 146

BT - PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

T2 - 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013

Y2 - 22 July 2013 through 24 July 2013

ER -

Stone age distributed computing

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this