Layla S. Aldawsari
ABSTRACT
A system of anonymous processes that have no names assigned to them is considered in both synchronous and asynchronous communication models. The processes are fault free and can only communicate using test-and-set (TAS) registers. The aim of the paper is to assign unique names to all processes using a distributed algorithm. The naming of anonymous processes is studied in eight new problem models based on two categories; the number of TAS registers available, and the knowledge of the number of processes. In this paper, two distributed naming algorithms are developed that can assign unique names to anonymous processes. One is deterministic and the other is randomized. The developed algorithms are optimal in time complexity and namespace size. The Sequential Lookup algorithm, which is a deterministic algorithm, has a time complexity of 0(n2) steps, whereas the Random Lookup algorithm, which is a randomized algorithm, has a time complexity of 0(n log n) steps. Proof of the correctness of each naming algorithm is presented for all categories of the problem model where the number of processes is known. The Random Lookup algorithm has a better time complexity compared to the Sequential Lookup algorithm due to the use of randomness in accessing TAS registers.
- Alessandro Panconesi, Marina Papatriantafifilou, Philippas Tsigas, and Paul Vit´anyi. 1998. Randomized naming using wait-free shared variables. Distributed Computing 11, 3 (1998), 113--124.Google Scholar
Digital Library
- Bogdan S Chlebus, Gianluca De Marco, and Muhammed Talo. 2017. Naming a channel with beeps. Fundamenta Informaticae 153, 3 (2017), 199--219.Google ScholarCross Ref
- Bogdan S Chlebus, Gianluca De Marco, and Muhammed Talo. 2018. Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.Google Scholar
- Christian Glacet, Avery Miller, and Andrzej Pelc. 2017.Time vs. information tradeoffs for leader election in anonymous trees. ACM Transactions on Algorithms (TALG) 13, 3 (2017), 31.Google Scholar
- Clyde P. Kruskal, Larry Rudolph, and Marc Snir. 1988. Efficiesnt Synchronization on Multiprocessors with Shared Memory. ACM Trans. Program. Lang. Syst. 10, 4 (1988), 579--601.Google ScholarDigital Library
- Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid Guerraoui. 2010. Fast Randomized Test-and-Set and Renaming. In Distributed Computing, Nancy A. Lynch and Alexander A. Shvartsman (Eds.). Springer Berlin Heidelberg, 94--108.Google Scholar
- Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, and Morteza Zadimoghaddam. 2011. Optimal-time adaptive strong renaming, with applications to counting. In Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, June 6--8, 2011.239--248.Google ScholarDigital Library
- Dan Alistarh, James Aspnes, Seth Gilbert, and Rachid Guer raoui. 2011. The Complexity of Renaming. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22--25, 2011. 718--727.Google Scholar
- Dana Angluin. 1980. Local and Global Properties in Networks of Processors (Extended Abstract). In Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing (STOC '80). ACM, 82--93.Google ScholarDigital Library
- Hagit Attiya, Marc Snir, and Manfred K. Warmuth. 1988. Computing on an Anonymous Ring. J. ACM 35, 4 (1988), 845--875.Google ScholarDigital Library
- Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, and Paul Vitanyi. 2006. On the importance of having an identity or, is consensus really universal? Distributed Computing 18, 3 (2006), 167--176.Google ScholarDigital Library
- Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, and Paul M. B. Vit´anyi. 2006. On the importance of having an identity or, is consensus really universal? Distributed Computing 18, 3 (2006), 167--176.Google ScholarDigital Library
- Janna Burman, Joffffroy Beauquier, and Devan Sohier. 2018. Brief Announcement: Space-Optimal Naming in Population Protocols. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (PODC '18). ACM, 479--481.Google ScholarDigital Library
- Lloyd Lim and A Park. 1990. Solving the processor identity problem in O (n) space. In Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990. IEEE, 676--680.Google ScholarDigital Library
- Michael Mitzenmacher and Eli Upfal. 2005. Probability and computing - randomized algorithms and probabilistic analysis. Cambridge University PressGoogle Scholar
- Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, and Janos Simon. 1996. Symmetry Breaking in Anonymous Networks: Characterizations.. In ISTCS. 16--26.Google Scholar
- Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized Algorithms. Cambridge University Press.Google Scholar
- Richard J. Lipton and Arvin Park. 1990. The processor identity problem. Inform. Process. Lett. 36, 2 (1990), 91--94.Google ScholarDigital Library
- Shang-Hua Teng. 1990. Space efficient processor identity protocol. Inform. Process. Lett. 34, 3 (1990), 147--154.Google ScholarDigital Library
- Shay Kutten, Rafail Ostrovsky, and Boaz Patt-Shamir. 2000. The Las-Vegas Processor Identity Problem (How and When to Be Unique). Journal of Algorithms 37, 2 (2000), 468--494.Google ScholarDigital Library
- Wayne Eberly, Lisa Higham, and Jolanta Warpechowska-Gruca. 1998. Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput. In Distributed Computing, 12th International Symposium, DISC '98, Andros, Greece, September 24-26, 1998, Proceedings. 149--160.Google Scholar
Index Terms
- Naming Anonymous Processes with Test-and-Set Registers
Recommendations
On the optimal space complexity of consensus for anonymous processes
The optimal space complexity of consensus in asynchronous shared memory was an open problem for two decades. For a system of n processes, no algorithm using a sublinear number of registers is known. Up until very recently, the best known lower bound due ...
Fully Anonymous Consensus and Set Agreement Algorithms
Networked SystemsAbstractProcess anonymity has been studied for a long time. Memory anonymity is more recent. In an anonymous memory system, there is no a priori agreement among the processes on the names of the shared registers they access. As an example, a shared ...
Time-space tradeoffs for implementations of snapshots
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingA snapshot object is an abstraction of the fundamental problem of obtaining a consistent view of the contents of the shared memory in a distributed system while other processes may concurrently update those contents. A snapshot object stores an array of ...
Comments