Name
Abstract | ||
|---|---|---|
The notion of a computational field has been proposed as a unifying abstraction for constructing and reasoning about large and self-organising networks of devices, focusing on the computations and coordination of aggregates of devices instead of individual behaviour. Recently, firm mathematical foundations have been established for this approach, in the form of a minimal universal field calculus and a more restricted syntax that guarantees self-stabilisation. We now aim to raise the abstraction level for system construction by identifying a collection of general and reusable \"building block\" algorithms. By functional combination of these building blocks, it is possible to construct complex adaptive behaviours. Moreover, the building blocks we present are all self-stabilising, ensuring that any system constructed from them is guaranteed to rapidly converge to a correct behaviour. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/SASOW.2014.6 | Self-Adaptive and Self-Organizing Systems Workshops |
Keywords | Field | DocType |
programming,aggregate computation,aggregate coordination,aggregate programming,building block algorithm,computational field,minimal universal field calculus,self-organising application,aggregate programming,distributed algorithms,field calculus,self-stabilisation | Abstraction,Computer science,Algorithm,Theoretical computer science,Distributed algorithm,System construction,Abstraction layer,Self organisation,Syntax,Distributed computing,Computation | Conference |
ISSN | Citations | PageRank |
1949-3673 | 27 | 1.09 |
References | Authors | |
15 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jacob Beal | 1 | 47 | 4.39 |
| Viroli, M. | 2 | 30 | 1.86 |