Abstract : Recent work in the area of coordination models and collective adaptive systems promotes a view of distributed computations as functions manipulating computational fields (data structures spread over space and evolving over time), and introduces the field calculus as a formal foundation for field computations. With the field calculus, evolution (time) and neighbor interaction (space) are handled by separate functional operators: however, this 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 converse sharing to neighbors of a local variable. In addition to conceptual economy, use of the share operator also allows many prior field calculus algorithms to be greatly accelerated, which we validate empirically with simulations of a number of frequently used network propagation and collection algorithms.
https://hal.inria.fr/hal-02365499 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Friday, November 15, 2019 - 2:13:03 PM Last modification on : Monday, February 7, 2022 - 4:06:04 PM Long-term archiving on: : Sunday, February 16, 2020 - 4:10:56 PM
Giorgio Audrito, Jacob Beal, Ferruccio Damiani, Danilo Pianini, Mirko Viroli. The share Operator for Field-Based Coordination. 21th International Conference on Coordination Languages and Models (COORDINATION), Jun 2019, Kongens Lyngby, Denmark. pp.54-71, ⟨10.1007/978-3-030-22397-7_4⟩. ⟨hal-02365499⟩