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.
Titolo: | Code mobility meets self-organisation: A higher-order calculus of computational fields | |
Autori Riconosciuti: | ||
Autori: | Damiani, Ferruccio; Viroli, Mirko; Pianini, Danilo; Beal, Jacob | |
Data di pubblicazione: | 2015 | |
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. | |
Editore: | Springer Verlag | |
Titolo del libro: | Formal Techniques for Distributed Objects, Components, and Systems. | |
Volume: | 9039 | |
Pagina iniziale: | 113 | |
Pagina finale: | 128 | |
Nome del convegno: | 35th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2015 Held as Part of the 10th International Federated Conference on Distributed Computing Techniques, DisCoTec 2015 | |
Luogo del convegno: | Grenoble, France | |
Anno del convegno: | June 2-4, 2015 | |
Digital Object Identifier (DOI): | 10.1007/978-3-319-19195-9_8 | |
ISBN: | 9783319191942 9783319191942 | |
URL: | http://springerlink.com/content/0302-9743/copyright/2005/ | |
Parole Chiave: | Computational field, Core calculus, Operational semantics, Spatial computing | |
Appare nelle tipologie: | 04A-Conference paper in volume |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
LNCS-forte-2015.pdf | Articolo principale (versione per conferenza) | PDF EDITORIALE | Utenti riconosciuti Richiedi una copia | |
main.pdf | Articolo principale (versione per conferenza) | POSTPRINT (VERSIONE FINALE DELL’AUTORE) | Open Access Visualizza/Apri |