Jocaml: mobile agents for Objective-Caml

Abstract

Jocaml is a system for mobile agents built inside the Objective-Caml language. Jocaml eases the development of concurrent, distributed and mobile agent based applications, by expressing useful distribution abstractions using a small set of simple but powerful primitives taken from the Join-Calculus [5].The system provides total transparency for migration, application states (after migration, all threads resume their execution in the state before migration), communications (communication channels with other agents are kept during migration) and composition (sub-agents migrate with their parent agent). Other features of the Jocaml system are mobile objects with transparent remote method invocation, distributed garbage collection, failure detection and execution efficiency. Jocaml has already been used in several applications, such as a mobile editor, some distributed games and a distributed implementation of Ambients[4].This paper describes the Jocaml programming model and language, its current implementation and some interesting applications.

Modelling Dynamic Web Data

“…Communication between peers is provided through SOAP-based web services and the working space of each location is endowed with a process scheduler based on ideas from PICT [29]. We aim to continue this implementation work, perhaps incorporating ideas from other recent work on languages based on the π-calculus [12,15].…”

Modelling Fusion Calculus using HD-Automata

“…Nominal calculi also provide a basic programming model that has been incorporated in novel programming languages (see e.g. [6,2]) and workflow languages for Web Service coordination [4,16].…”

BSP Functional Programming: Examples of a Cost Based Methodology

“…To compute this sum, we show two parallel algorithms : using a total exchange of the point masses or using a systolic loop 6 . At the beginning of these two methods, each processor contains a sub-part (as a list) of the N point masses: we thus have a parallel vector of lists of N/p point masses.…”

“…We can cite concurrent programming [6], more or less synchronous processes [5,18] or the automatic parallelization of programs [1] and algorithmic skeletons [7]. In the first two cases, the expressivity of concurrence or mobility is sought (but with lower performance).…”