2000 character limit reached
Tolerance to Asynchrony of an Algorithm for Gathering Myopic Robots on an Infinite Triangular Grid (2307.13080v2)
Published 24 Jul 2023 in cs.DC
Abstract: In this paper, we study the problem of gathering distance-1 myopic robots on an infinite triangular grid. We show that the algorithm developed by Goswami et al. (SSS, 2022) is lattice-linear (cf. Gupta and Kulkarni, SRDS 2023). This implies that a distributed scheduler, assumed therein, is not required for this algorithm: it runs correctly in asynchrony. It also implies that the algorithm works correctly even if the robots are equipped with a unidirectional \textit{camera} to see the neighbouring robots (rather than an omnidirectional one, which would be required under a distributed scheduler). Due to lattice-linearity, we can predetermine the point of gathering. We also show that this algorithm converges in $2n$ rounds, which is lower than the complexity ($2.5(n+1)$ rounds) that was shown in Goswami et al.
- A provably starvation-free distributed directory protocol. In Stabilization, Safety, and Security of Distributed Systems (Berlin, Heidelberg, 2010), S. Dolev, J. Cobb, M. Fischer, and M. Yung, Eds., Springer Berlin Heidelberg, pp. 405–419.
- Are wait-free algorithms fast? J. ACM 41, 4 (jul 1994), 725–763.
- Dispersion of mobile robots: A study of memory-time trade-offs. In Proceedings of the 19th International Conference on Distributed Computing and Networking (New York, NY, USA, 2018), ICDCN ’18, Association for Computing Machinery.
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. In WALCOM: Algorithms and Computation (Cham, 2015), M. S. Rahman and E. Tomita, Eds., Springer International Publishing, pp. 149–160.
- Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theoretical Computer Science 815 (2020), 213–227.
- Convergence and covering on graphs for wait-free robots. Journal of the Brazilian Computer Society 24, 1 (Jan. 2018).
- Arbitrary pattern formation on infinite regular tessellation graphs. In Proceedings of the 22nd International Conference on Distributed Computing and Networking (New York, NY, USA, 2021), ICDCN ’21, Association for Computing Machinery, p. 56–65.
- Gathering of robots on anonymous grids and trees without multiplicity detection. Theoretical Computer Science 610 (2016), 158–168. Structural Information and Communication Complexity.
- On serializability of iterated transactions. In Proceedings of the First ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (New York, NY, USA, 1982), PODC ’82, Association for Computing Machinery, p. 194–200.
- Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 1 (2005), 147–168.
- Garg, V. A lattice linear predicate parallel algorithm for the dynamic programming problems. In 23rd International Conference on Distributed Computing and Networking (New York, NY, USA, 2022), ICDCN 2022, Association for Computing Machinery, p. 72–76.
- Garg, V. K. Predicate detection to solve combinatorial optimization problems. In SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020 (2020), C. Scheideler and M. Spear, Eds., ACM, pp. 235–245.
- Garg, V. K. A lattice linear predicate parallel algorithm for the housing market problem. In Stabilization, Safety, and Security of Distributed Systems (Cham, 2021), C. Johnen, E. M. Schiller, and S. Schmid, Eds., Springer International Publishing, pp. 108–122.
- Time optimal gathering of myopic robots on an infinite triangular grid. In Stabilization, Safety, and Security of Distributed Systems (Cham, 2022), S. Devismes, F. Petit, K. Altisen, G. A. Di Luna, and A. Fernandez Anta, Eds., Springer International Publishing, pp. 270–284.
- Extending lattice linearity for self-stabilizing algorithms. In Stabilization, Safety, and Security of Distributed Systems (Cham, 2021), C. Johnen, E. M. Schiller, and S. Schmid, Eds., Springer International Publishing, pp. 365–379.
- Brief announcement: Fully lattice linear algorithms. In Stabilization, Safety, and Security of Distributed Systems: 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings (Berlin, Heidelberg, 2022), Springer-Verlag, p. 341–345.
- Inducing lattices in non-lattice-linear problems. In 42nd International Symposium on Reliable Distributed Systems (2023), M. Erradi and R. Guerraoui, Eds., IEEE.
- Hcf: a starvation-free practical algorithm for maximizing throughput in input-queued switches. In HPSR. 2005 Workshop on High Performance Switching and Routing, 2005. (2005), pp. 68–72.
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theoretical Computer Science 411, 34 (2010), 3235–3246.
- Fast concurrent lock-free binary search trees. In Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (New York, NY, USA, 2014), PPoPP ’14, Association for Computing Machinery, p. 317–328.
- Papadimitriou, C. H. The serializability of concurrent database updates. J. ACM 26, 4 (oct 1979), 631–653.
- Time-optimal gathering under limited visibility with one-axis agreement. Information 12, 11 (2021).
- A wait-free sorting algorithm. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (New York, NY, USA, 1997), PODC ’97, Association for Computing Machinery, p. 121–128.
- Gathering of seven autonomous mobile robots on triangular grids. In 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2021), pp. 566–575.
- Valois, J. D. Lock-free linked lists using compare-and-swap. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing (New York, NY, USA, 1995), PODC ’95, Association for Computing Machinery, p. 214–222.