%0 Conference Proceedings
%T The share Operator for Field-Based Coordination
%+ Dipartimento di Informatica [Torino]
%+ Raytheon BBN Technologies
%+ Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO)
%A Audrito, Giorgio
%A Beal, Jacob
%A Damiani, Ferruccio
%A Pianini, Danilo
%A Viroli, Mirko
%Z Part 1: Computational Models
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 21th International Conference on Coordination Languages and Models (COORDINATION)
%C Kongens Lyngby, Denmark
%Y Hanne Riis Nielson
%Y Emilio Tuosto
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-11533
%P 54-71
%8 2019-06-17
%D 2019
%R 10.1007/978-3-030-22397-7_4
%K Aggregate programming
%K Computational field
%K Information propagation speed
%K Spatial computing
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-02365499/document
%2 https://inria.hal.science/hal-02365499/file/478673_1_En_4_Chapter.pdf
%L hal-02365499
%U https://inria.hal.science/hal-02365499
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-LNCS-11533