Simulating distributed algorithms for lattice agents

O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner

Abstract:

We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2- and 3-dimensional square/cubic lattice-based agents. This AgentSystem assumes that each agent is capable to change position in the lattice and that neighboring agents can attach and detach from each other. In addition, it assumes that each module has some constant size memory and computation capability, and can send/receive constant size messages to/from its neighbors. The system allows the user to define sets of agents and sets of rules and apply one to the other. The AgentSystem simulates the synchronized execution of the set of rules by all the modules, and can keep track of all actions made by the modules at each step, supporting consistency warnings and error checking. Our intention is to provide a useful tool for the researchers from geometric distributed algorithms.

Reference: O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner. Simulating distributed algorithms for lattice agents. In Proc. $15^{th}$ Spanish Meeting on Computational Geometry 2013, pages 81-84, Sevilla, Spain, 2013.