Logo image
Code Mobility Meets Self-organisation: A Higher-Order Calculus of Computational Fields
Conference proceeding   Open access   Peer reviewed

Code Mobility Meets Self-organisation: A Higher-Order Calculus of Computational Fields

Ferruccio Damiani, Mirko Viroli, Danilo Pianini and Jacob Beal
FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2015, Vol.9039, pp.113-128
Lecture Notes in Computer Science
01/01/2015
DOI: 10.1007/978-3-319-19195-9_8
url
https://doi.org/10.1007/978-3-319-19195-9_8View
Published (Version of record) Open Access

Abstract

Self-organisation mechanisms, in which simple local interactions result in robust collective behaviors, are a useful approach to managing the coordination of large-scale adaptive systems. Emerging pervasive application scenarios, however, pose an openness challenge for this approach, as they often require flexible and dynamic deployment of new code to the pertinent devices in the network, and safe and predictable integration of that new code into the existing system of distributed self-organisation mechanisms. We approach this problem of combining self-organisation and code mobility by extending "computational field calculus", a universal calculus for specification of self-organising systems, with a semantics for distributed first-class functions. Practically, this allows self-organisation code to be naturally handled like any other data, e.g., dynamically constructed, compared, spread across devices, and executed in safely encapsulated distributed scopes. Programmers may thus be provided with the novel first-class abstraction of a "distributed function field", a dynamically evolving map from a network of devices to a set of executing distributed processes.
Computer Science Computer Science, Software Engineering Computer Science, Theory & Methods Logic Science & Technology Science & Technology - Other Topics Technology

Details

Metrics

Logo image