Proceeding of the Faculty of technical Sciences, Novi Sad

Electrotechnical and Computer Engineering

Vol. 40 No. 12 (2025): Proceedings of the Faculty of Technical Sciences

PLATFORM FOR VISUALIZING DISTRIBUTED ALGORITHMS ON THE EXAMPLE OF A CLASS OF ALGORITHMS FOR LEADER ELECTION

  • Aleksandra Nedić
DOI:
https://doi.org/10.24867/33BE07Nedic
Submitted
December 9, 2025
Published
2026-02-18

Abstract

The paper presents an extensible platform for visualizing distributed algorithms for leader election in synchronous networks. The platform allows the user to add new algorithms in addition to predefined ones, as well as to manipulate the system through dynamic addition and removal of nodes participating in the execution of algorithms. The implemented algorithms for the selection of leaders, different topologies and technological foundations of the platform are discussed in detail, with a presentation of its key elements and ways of functioning. The paper also describes the system specification and system architecture, as well as the platform implementation.

References

  1. [1] Shirali, M., Toroghi, A. H., & Vojdani, M. (2008). Leader election algorithms: History and novel schemes. In 2008 Third International Conference on Convergence and Hybrid Information Technology (pp. 1001-1006). IEEE. https://doi.org/10.1109/ICCIT.2008.57
  2. [2] Huang, M., & Bode, B. (2005). A performance comparison of tree and ring topologies in distributed systems. In 19th IEEE International Parallel and Distributed Processing Symposium (pp. 8). IEEE. https://doi.org/10.1109/IPDPS.2005.57
  3. [3] Liu, H. (2009). The structural features of enhanced hypercube networks. In 2009 Fifth International Conference on Natural Computation (pp. 345-348). IEEE. https://doi.org/10.1109/ICNC.2009.191
  4. [4] Santoro, N. (2006). Design and analysis of distributed algorithms. Wiley.
  5. [5] Chang, E., & Roberts, R. (1979). An improved algorithm for decentralized extrema-finding in circular configurations of processes. Communications of the ACM, 22(5), 281-283. https://doi.org/10.1145/359024.359027
  6. [6] Garcia-Molina, H. (1982). Elections in a distributed computing system. IEEE Transactions on Computers, C-31(1), 48-59. https://doi.org/10.1109/TC.1982.1675885
  7. [7] McBryan, O. A., & Van de Velde, E. F. (1987). Hypercube algorithms and implementations. SIAM Journal on Scientific and Statistical Computing, 8(2), s227-s287. https://doi.org/10.1137/0908040
  8. [8] Gallager, R. G., Humblet, P. A., & Spira, P. M. (1983). A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1), 66-77. https://doi.org/10.1145/357195.357200
  9. [9] Hirschberg, D. S., & Sinclair, J. B. (1980). Decentralized extrema-finding in circular configurations of processors. Communications of the ACM, 23(11), 627-628.