PLATFORMA ZA VIZUALIZACIJU DISTRIBUIRANIH ALGORITAMA NA PRIMERU KLASE ALGORITAMA ZA IZBOR LIDERA
DOI:
https://doi.org/10.24867/33BE07NedicKljučne reči:
distribuirani algoritmi, biranje lidera, Gallager-Humblet-SpiraApstrakt
U radu je predstavljena proširiva platforma za vizualizaciju distribuiranih algoritama za izbor lidera u sinhronim mrežama. Platforma omogućava korisniku da dodaje nove algoritme pored predefinisanih, kao i da manipuliše sistemom kroz dinamičko dodavanje i uklanjanje čvorova koji učestvuju u izvršavanju algoritama. Detaljno se razmatraju implementirani algoritmi za izbor lidera, različite topologije i tehnološke osnove platforme, uz prikaz njenih ključnih elemenata i načina funkcionisanja. Rad takođe opisuje specifikaciju i arhitekturu sistema, kao i implementaciju platforme.
Reference
[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] 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] 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] Santoro, N. (2006). Design and analysis of distributed algorithms. Wiley.
[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] 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] 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] 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] Hirschberg, D. S., & Sinclair, J. B. (1980). Decentralized extrema-finding in circular configurations of processors. Communications of the ACM, 23(11), 627-628.
