{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article16472","name":"Time, Clocks and Efficiency of Population Protocols (Invited Paper)","abstract":"The model of population protocols is used to study distributed processes based on pairwise interactions between simple anonymous agents drawn from a large population of size n. The order in which agents meet in pairs is determined by the random scheduler, s.t., each consecutive pair is chosen uniformly at random. After each interaction the state of the relevant agents are amended according to the predefined transition function (the actual code of the algorithm) which governs the considered process. The state space of agents is often fixed and the size n is not known in advance, i.e., not hard-coded in the transition function. We assume that a population protocol starts in the predefined initial configuration of agents' states representing the input. And if successful, the protocol stabilises in a final configuration of states forming the output representing the solution to the considered problem. \r\nThe time complexity of a population protocol refers to the number of interactions required to stabilise this protocol in a final configuration. We also define parallel time as the time complexity divided by n. Note that the parallel time of the system and the expected local time of each agent, i.e., the number of interactions observed by each agent, are correlated. Several mechanisms, known as phase clocks, have been developed to measure parallel time more accurately than counting local interactions. Most of the clocks target counting \u0398(log n) parallel time required to fully synchronise all agents in the population. There are leader (and junta) based phase clocks which utilise a fixed number of states [D. Angluin et al., 2008; L. G\u0105sieniec and G. Stachowiak, 2021]. This type of clocks allows also counting any poly-logarithmic time while preserving fix state utilisation. The other type refers to leaderless clocks utilising \u0398(log n) states [D. Alistarh et al., 2018; D. Doty et al., 2021]. This type allows approximate counting of parallel time as fixed resolution clocks [D. Doty et al., 2021] or oscillators [D. Alistarh et al., 2018]. Another clock type introduced recently in [L. G\u0105sieniec et al., 2021] enables counting \u0398(nlog n) parallel time utilising a fixed number of states and either leaders or connections in the network constructor model.\r\nWe also discuss parallel efficiency of population protocols referring to protocols operating in \u0398(polylog n) parallel time, we propose extensions of the population protocol model leading to further improvement in state and time utilisation, and we state some open problems.","keywords":["Population protocols","phase clocks","oscillators","parallel time and efficiency"],"author":[{"@type":"Person","name":"G\u0105sieniec, Leszek","givenName":"Leszek","familyName":"G\u0105sieniec","email":"mailto:l.a.gasieniec@liverpool.ac.uk","sameAs":"https:\/\/orcid.org\/0000-0003-1809-9814","affiliation":"University of Liverpool, UK"},{"@type":"Person","name":"Stachowiak, Grzegorz","givenName":"Grzegorz","familyName":"Stachowiak","email":"mailto:gst@cs.uni.wroc.pl","sameAs":"https:\/\/orcid.org\/0000-0003-0463-3676","affiliation":"University of Wroc\u0142aw, Poland"}],"position":2,"pageStart":"2:1","pageEnd":"2:2","dateCreated":"2022-06-22","datePublished":"2022-06-22","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"G\u0105sieniec, Leszek","givenName":"Leszek","familyName":"G\u0105sieniec","email":"mailto:l.a.gasieniec@liverpool.ac.uk","sameAs":"https:\/\/orcid.org\/0000-0003-1809-9814","affiliation":"University of Liverpool, UK"},{"@type":"Person","name":"Stachowiak, Grzegorz","givenName":"Grzegorz","familyName":"Stachowiak","email":"mailto:gst@cs.uni.wroc.pl","sameAs":"https:\/\/orcid.org\/0000-0003-0463-3676","affiliation":"University of Wroc\u0142aw, Poland"}],"copyrightYear":"2022","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2022.2","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/arxiv.org\/abs\/2111.10822","isPartOf":{"@type":"PublicationVolume","@id":"#volume6430","volumeNumber":227,"name":"18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)","dateCreated":"2022-06-22","datePublished":"2022-06-22","editor":[{"@type":"Person","name":"Czumaj, Artur","givenName":"Artur","familyName":"Czumaj","email":"mailto:A.Czumaj@warwick.ac.uk","sameAs":"https:\/\/orcid.org\/0000-0002-7743-438X","affiliation":"University of Warwick, UK"},{"@type":"Person","name":"Xin, Qin","givenName":"Qin","familyName":"Xin","email":"mailto:QinX@setur.fo","sameAs":"https:\/\/orcid.org\/0000-0002-6178-8538","affiliation":"University of the Faroe Islands, T\u00f3rshavn, Faroe Islands"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article16472","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6430"}}}