Field-based Coordination with the Share Operator
Giorgio Audrito, Jacob Beal, Ferruccio Damiani, Danilo Pianini, Mirko, Viroli

TL;DR
This paper introduces a new 'share' operator for field-based coordination in distributed systems, simplifying and accelerating computations by combining neighbor observation, reduction, and sharing into a single construct.
Contribution
The paper proposes the 'share' operator, unifying and replacing 'rep' and 'nbr' constructs, enabling more efficient and faster field-based computations in collective adaptive systems.
Findings
Share operator can replace 'rep' and 'nbr' in self-stabilising computations.
Use of 'share' accelerates network propagation and collection algorithms.
Empirical validation shows significant performance improvements.
Abstract
Field-based coordination has been proposed as a model for coordinating collective adaptive systems, promoting a view of distributed computations as functions manipulating data structures spread over space and evolving over time, called computational fields. The field calculus is a formal foundation for field computations, providing specific constructs for evolution (time) and neighbor interaction (space), which are handled by separate operators (called rep and nbr, respectively). This approach, however, intrinsically limits the speed of information propagation that can be achieved by their combined use. In this paper, we propose a new field-based coordination operator called share, which captures the space-time nature of field computations in a single operator that declaratively achieves: (i) observation of neighbors' values; (ii) reduction to a single local value; and (iii) update and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
