Algebraic foundation of a data model for an extensible space-based collaboration protocol

Abstract

Space-based computing middleware offers a data driven style for the coordination of processes. The interaction requirements between these processes can be complex, and the template matching coordination law of the Linda and JavaSpaces model is not sufficient. Moreover, the usage should not be limited to a single platform. Several authors have proposed coordination extensions, but besides the suggestion to use XML or RDF based query facilities, a formalization of a general and extensible space-based coordination model has not yet been realized. In this paper we present the algebraic data structures and the coordination model based on a navigational query language for the extensible virtual shared memory architecture, and show how they can be adapted to support arbitrary coordination laws by the introduction of user-definable matchmaker and selector functions. The platform independence is achieved through a language independent communication protocol. The formal specification of the data model is the necessary basis for this protocol.

Reusable Coordination Components: Reliable Development of Cooperative Information Systems

“…2) is the definition of an extended tuple space model that takes into consideration many of these ideas in a modular reference architecture. [28][29][30] Its main features extending tuple spaces are:…”

Tuple Spaces Implementations and Their Efficiency

“…Our purpose is to review the most significant and recent ones, that are possibly still maintained, avoiding toy implementations or the one shot paper implementations. To this end, we have chosen: JavaSpaces [26] and TSpaces [24] which are two industrial proposals of tuple spaces for Java; GigaSpaces [21] which is a commercial implementation of tuple spaces; Tupleware [3] featuring an adaptive search mechanism based on communication history; Grinda [9], Blossom [33], DTuples [22] featuring distributed tuple spaces; LuaTS [23] which mixes reactive models with tuple spaces; Klaim [15] and MozartSpaces [14] which are two academic implementations with a good record of research papers based on them.…”

“…MozartSpaces [14] is a Java implementation of the space-based approach [27]. The implementation was initially based on the eXtensible Virtual Shared Memory (XVSM) technology, developed at the Space Based Computing Group, Institute of Computer Languages, Vienna University of Technology.…”

Peer-Based Programming Model for Coordination Patterns

“…Space-based middleware lets autonomous components coordinate themselves in a highly decoupled way. We use a space as described in [7], which provides shared containers that support configurable coordination mechanisms [11], and a flexible and extensible API for accessing them, although other spaces with similar functionality may also be used to bootstrap the Peer Model.…”

“…This query selects all available entries of type T 2. Details on the query mechanism are explained in [7]. The operator "|" behaves like the pipe operator in the UNIX shell in that it streams the results of the query at its left side to the query at its right side.…”