Fault-Tolerant Shape Formation in the Amoebot Model

Authors Irina Kostitsyna , Christian Scheideler , Daniel Warner



PDF
Thumbnail PDF

File

LIPIcs.DNA.28.9.pdf
  • Filesize: 5.01 MB
  • 22 pages

Document Identifiers

Author Details

Irina Kostitsyna
  • Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands
Christian Scheideler
  • Department of Computer Science, Universität Paderborn, Germany
Daniel Warner
  • Department of Computer Science, Universität Paderborn, Germany

Cite As Get BibTex

Irina Kostitsyna, Christian Scheideler, and Daniel Warner. Fault-Tolerant Shape Formation in the Amoebot Model. In 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Leibniz International Proceedings in Informatics (LIPIcs), Volume 238, pp. 9:1-9:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.DNA.28.9

Abstract

The amoebot model is a distributed computing model of programmable matter. It envisions programmable matter as a collection of computational units called amoebots or particles that utilize local interactions to achieve tasks of coordination, movement and conformation. In the geometric amoebot model the particles operate on a hexagonal tessellation of the plane. Within this model, numerous problems such as leader election, shape formation or object coating have been studied. One area that has not received much attention so far, but is highly relevant for a practical implementation of programmable matter, is fault tolerance. The existing literature on that aspect allows particles to crash but assumes that crashed particles do not recover. We proposed a new model [Kostitsyna et al., 2022] in which a crash causes the memory of a particle to be reset and a crashed particle can detect that it has crashed and try to recover using its local information and communication capabilities. We present an algorithm that solves the hexagon shape formation problem in our model if a finite number of crashes occur and a designated leader particle does not fail. At the heart of our solution lies a fault-tolerant implementation of the spanning forest primitive, which, since other algorithms in the amoebot model also make use of it, is also of general interest.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed computing models
  • Theory of computation → Computational geometry
Keywords
  • programmable matter
  • amoebot model
  • fault tolerance
  • shape formation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Marta Andrés Arroyo, Sarah Cannon, Joshua J Daymude, Dana Randall, and Andréa W Richa. A stochastic approach to shortcut bridging in programmable matter. Natural Computing, 17(4):723-741, 2018. Google Scholar
  2. Joshua J Daymude, Andréa W Richa, and Christian Scheideler. The canonical amoebot model: Algorithms and concurrency control. In 35th International Symposium on Distributed Computing, 2021. Google Scholar
  3. Joshua J Daymude, Andréa W Richa, and Jamison W Weber. Bio-inspired energy distribution for programmable matter. In International Conference on Distributed Computing and Networking 2021, pages 86-95, 2021. Google Scholar
  4. Zahra Derakhshandeh, Shlomi Dolev, Robert Gmyr, Andréa W Richa, Christian Scheideler, and Thim Strothmann. Brief announcement: amoebot-a new model for programmable matter. In Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, pages 220-222, 2014. Google Scholar
  5. Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andréa W Richa, Christian Scheideler, and Thim Strothmann. On the runtime of universal coating for programmable matter. In International Conference on DNA-Based Computers, pages 148-164. Springer, 2016. Google Scholar
  6. Zahra Derakhshandeh, Robert Gmyr, Andréa W Richa, Christian Scheideler, and Thim Strothmann. An algorithmic framework for shape formation problems in self-organizing particle systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, pages 1-2, 2015. Google Scholar
  7. Zahra Derakhshandeh, Robert Gmyr, Andréa W Richa, Christian Scheideler, and Thim Strothmann. Universal shape formation for programmable matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, pages 289-299, 2016. Google Scholar
  8. Zahra Derakhshandeh, Robert Gmyr, Andréa W Richa, Christian Scheideler, and Thim Strothmann. Universal coating for programmable matter. Theoretical Computer Science, 671:56-68, 2017. Google Scholar
  9. Zahra Derakhshandeh, Robert Gmyr, Andréa W Richa, Christian Scheideler, Thim Strothmann, and Shimrit Tzur-David. Infinite object coating in the amoebot model. arXiv preprint, 2014. URL: http://arxiv.org/abs/1411.2356.
  10. Giuseppe A Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi. Shape formation by programmable particles. Distributed Computing, 33(1):69-101, 2020. Google Scholar
  11. Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Giovanni Viglietta. Line recovery by programmable particles. In Proceedings of the 19th International Conference on Distributed Computing and Networking, pages 1-10, 2018. Google Scholar
  12. Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi. Mobile ram and shape formation by programmable particles. In European Conference on Parallel Processing, pages 343-358. Springer, 2020. Google Scholar
  13. Yuval Emek, Shay Kutten, Ron Lavi, and William K Moses Jr. Deterministic leader election in programmable matter. arXiv preprint, 2019. URL: http://arxiv.org/abs/1905.00580.
  14. Irina Kostitsyna, Christian Scheideler, and Daniel Warner. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In James Aspnes and Othon Michail, editors, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), volume 221 of Leibniz International Proceedings in Informatics (LIPIcs), pages 23:1-23:3, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SAND.2022.23.
  15. Nooshin Nokhanji and Nicola Santoro. Line reconfiguration by programmable particles maintaining connectivity. In International Conference on the Theory and Practice of Natural Computing, pages 157-169. Springer, 2020. Google Scholar
  16. Tommaso Toffoli and Norman Margolus. Programmable matter: concepts and realization. Physica. D, Nonlinear phenomena, 47(1-2):263-272, 1991. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail