The canonical amoebot model: algorithms and concurrency control

• Published in: Distributed computing Vol. 36; no. 2; pp. 159 - 192
• Main Authors: Daymude, Joshua J., Richa, Andréa W., Scheideler, Christian
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2023; Springer Nature B.V
• Subjects: Algorithms; Computer Communication Networks; Computer Hardware; Computer networks; Computer Science; Computer Systems Organization and Communication Networks; Concurrency; Concurrency control; Distributed processing; Message passing; Software Engineering/Programming and Operating Systems; Theory of Computation; Concurrency; Distributed algorithms; Programmable matter; Self-organization
• ISSN: 0178-2770; 1432-0452
• DOI: 10.1007/s00446-023-00443-3

The amoebot model s active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coordination and movement. Since its introduction at SPAA 2014, a growing body of literature has adapted its assumptions for a variety of problems; however, without a standardized hierarchy of assumptions, precise systematic comparison of results under the amoebot model is difficult. We propose the canonical amoebot model , an updated formalization that distinguishes between core model features and families of assumption variants. A key improvement addressed by the canonical amoebot model is concurrency . Much of the existing literature implicitly assumes amoebot actions are isolated and reliable, reducing analysis to the sequential setting where at most one amoebot is active at a time. However, real programmable matter systems are concurrent. The canonical amoebot model formalizes all amoebot communication as message passing, leveraging adversarial activation models of concurrent executions. Under this granular treatment of time, we take two complementary approaches to concurrent algorithm design . We first establish a set of sufficient conditions for algorithm correctness under any concurrent execution, embedding concurrency control directly in algorithm design. We then present a concurrency control framework that uses locks to convert amoebot algorithms that terminate in the sequential setting and satisfy certain conventions into algorithms that exhibit equivalent behavior in the concurrent setting. As a case study, we demonstrate both approaches using a simple algorithm for hexagon formation . Together, the canonical amoebot model and these complementary approaches to concurrent algorithm design open new directions for distributed computing research on programmable matter.