Locality based Linda: programming with explicit localities

 Rocco De Nicola1, GianLuigi Ferrari2, Rosario Pugliese1,
1 Dipartimento di Sistemi e Informatica, Universita' di Firenze
2 Dipartimento di Informatica, Universita' di Pisa

Abstract
In this paper we investigate the issue of defining a programming calculus which supports programming with explicit localities. We introduce a language which embeds the asynchronous Linda communication paradigm extended with explicit localities in a process calculus. We consider multiple tuple spaces that are distributed over a collections of sites and use localities to distribute/retrieve tuples and processes over/from these sites. The operational semantics of the language turns out to be useful for discussing the language design, e.g. the effects of scoping disciplines over mobile agents which maintain their connections to the located tuple spaces while moving along sites. The flexibility of the language is illustrated by a few examples.