Advertisement

Naming Anonymous Processes Using an Optimal Number of Test-and-Set Registers

  • Layla S. AldawsariEmail author
Conference paper
  • 19 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1130)

Abstract

Anonymous distributed systems consist of processes without names to identify them, and the goal is to assign unique names to them using a distributed algorithm. Synchronous and asynchronous communication models are considered with eight different categories based on number of test-and-set (TAS) registers available and knowledge of number of processes. Processes can only communicate through shared read/write and TAS registers. In this paper, I have developed two deterministic algorithms and one randomized algorithm for naming anonymous processes in all variations of the problem model. Proof of correctness for each algorithm is presented along with the analysis. The developed algorithms are optimal in both shared memory size requirements and namespace size. The Counting and Global Counting algorithm have a time complexity of \(O(n^2)\) steps with a space complexity of O(1) and O(2) shared registers, while Segment Shuffling algorithm has a time complexity of \(\mathcal {O}(n \lceil \log {n} \rceil )\) steps with a space complexity of \(O(2 *\lceil \log {n} \rceil ))\) shared registers.

Keywords

Distributed computing Anonymous processes Test-and-set register Naming algorithm 

References

  1. 1.
    Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Zadimoghaddam, M.: 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, 6–8 June 2011, pp. 239–248 (2011)Google Scholar
  2. 2.
    Alistarh, D., Aspnes, J., Gilbert, S., Guerraoui, R.: The complexity of renaming. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, 22–25 October 2011, pp. 718–727 (2011)Google Scholar
  3. 3.
    Alistarh, D., Attiya, H., Gilbert, S., Giurgiu, A., Guerraoui, R.: Fast randomized test-and-set and renaming. In: Lynch, N.A., Shvartsman, A.A. (eds.) Distributed Computing, pp. 94–108. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Angluin, D.: Local and global properties in networks of processors (extended abstract). In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, STOC 1980, pp. 82–93. ACM (1980)Google Scholar
  5. 5.
    Attiya, H., Snir, M., Warmuth, M.K.: Computing on an anonymous ring. J. ACM 35(4), 845–875 (1988)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Boldi, P., Shammah, S., Vigna, S., Codenotti, B., Gemmell, P., Simon, J.: Symmetry breaking in anonymous networks: characterizations. In: ISTCS, pp. 16–26 (1996)Google Scholar
  7. 7.
    Buhrman, H., Panconesi, A., Silvestri, R., Vitanyi, P.: On the importance of having an identity or, is consensus really universal? Distrib. Comput. 18(3), 167–176 (2006)CrossRefGoogle Scholar
  8. 8.
    Chlebus, B.S., De Marco, G., Talo, M.: Naming a channel with beeps. Fundamenta Informaticae 153(3), 199–219 (2017)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Chlebus, B.S., De Marco, G., Talo, M.: 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 (2018)Google Scholar
  10. 10.
    Eberly, W., Higham, L., Warpechowska-Gruca, J.: Long-lived, fast, waitfree renaming with optimal name space and high throughput. In: Proceedings of 12th International Symposium on Distributed Computing, DISC 1998, Andros, Greece, 24–26 September 1998, pp. 149–160 (1998)Google Scholar
  11. 11.
    Eǧecioǧlu, O., Singh, A.K.: Naming symmetric processes using shared variables. Distrib. Comput. 8(1), 19–38 (1994)CrossRefGoogle Scholar
  12. 12.
    Glacet, C., Miller, A., Pelc, A.: Time vs. information tradeoffs for leader election in anonymous trees. ACM Trans. Algorithms 13(3), 31 (2017)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Guerraoui, R., Ruppert, E.: What can be implemented anonymously? In: International Symposium on Distributed Computing, pp. 244–259. Springer (2005)Google Scholar
  14. 14.
    Kruskal, C.P., Rudolph, L., Snir, M.: Efficient synchronization on multiprocessors with shared memory. ACM Trans. Program. Lang. Syst. 10(4), 579–601 (1988)CrossRefGoogle Scholar
  15. 15.
    Kutten, S., Ostrovsky, R., Patt-Shamir, B.: The Las-Vegas processor identity problem (how and when to be unique). J. Algorithms 37(2), 468–494 (2000)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Lim, L., Park, L.: Solving the processor identity problem in O(n) space. In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp. 676–680. IEEE (1990)Google Scholar
  17. 17.
    Lipton, R.J., Park, A.: The processor identity problem. Inf. Process. Lett. 36(2), 91–94 (1990)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Matias, Y., Afek, Y.: Simple and efficient election algorithms for anonymous networks. In: International Workshop on Distributed Algorithms, pp. 183–194. Springer (1989) Google Scholar
  19. 19.
    Mitzenmacher, M., Upfal, E.: Probability and Computing - Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)CrossRefGoogle Scholar
  20. 20.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)CrossRefGoogle Scholar
  21. 21.
    Panconesi, A., Papatriantafilou, M., Tsigas, P., Vitányi, P.: Randomized naming using wait-free shared variables. Distrib. Comput. 11(3), 113–124 (1998)CrossRefGoogle Scholar
  22. 22.
    Teng, S.-H.: Space efficient processor identity protocol. Inf. Process. Lett. 34(3), 147–154 (1990)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of Colorado DenverDenverUSA
  2. 2.College of Computer and Information SciencesPrincess Nourah Bint Abdulrahman UniversityRiyadhSaudi Arabia

Personalised recommendations