Berenbrink, PetraPetraBerenbrinkHammer, DavidDavidHammerKaaser, DominikDominikKaaserMeyer, UlrichUlrichMeyerPenschuck, ManuelManuelPenschuckTran, HungHungTran2023-04-052023-04-05202028th Annual European Symposium on Algorithms : ESA 2020, September 7-9, 2020, Pisa, Italy (virtual conference). - (Leibniz International Proceedings in Informatics, LIPIcs ; vol. 173). - Art. no. 16 (2020)http://hdl.handle.net/11420/15137We consider the efficient simulation of population protocols. In the population model, we are given a system of n agents modeled as identical finite-state machines. In each step, two agents are selected uniformly at random to interact by updating their states according to a common transition function. We empirically and analytically analyze two classes of simulators for this model. First, we consider sequential simulators executing one interaction after the other. Key to the performance of these simulators is the data structure storing the agents’ states. For our analysis, we consider plain arrays, binary search trees, and a novel Dynamic Alias Table data structure. Secondly, we consider batch processing to efficiently update the states of multiple independent agents in one step. For many protocols considered in literature, our simulator requires amortized sub-constant time per interaction and is fast in practice: given a fixed time budget, the implementation of our batched simulator is able to simulate population protocols several orders of magnitude larger compared to the sequential competitors, and can carry out 250 interactions among the same number of agents in less than 400 s.enDynamic Alias TablePopulation ProtocolsRandom SamplingSimulationInformatikConference Paper10.4230/LIPIcs.ESA.2020.16Other