This chapter focuses on tuple-based (Linda-like) coordination models as middleware services for mobile and pervasive computing systems. After having introduced the basic concepts of tuple-based coordination, the chapter discusses the suitability of tuple-based models for mobility and introduces a simple taxonomy of tuplebased middleware models for mobile systems. Then, on the basis of the intro...

A generalization of the dictionary data structure is described, called tuple dictionary. A tuple dictionary represents the mapping of n-tuples of strings to some value. This data structure is motivated by practical applications in speech and language processing, in which very large instances of tuple dictionaries are used to represent language models. A technique for compact representation of t...

WCL is an inter-agent co-ordination language designed for Internet and Web based agent systems. WCL is based on shared associative memories called tuple spaces, as introduced in Linda. In this paper we describe a novel run-time system for WCL. This distributed run-time system is radically di erent from traditional run-time systems supporting tuple spaces because it performs on-they analysis of ...

This paper investigates a tuple-oriented approach to tabulation. In this approach solutions to a call are stored and computed one at a time, which results in tables contain incomplete sets of solutions. Since the answers stored in the tables are partial sets of solutions to a call, a subgoal that is an instance of a stored call can require an answer that is not among the stored solutions. Conse...

Learning the parameters of complex probabilistic-relationalmodels from labeled training data is a standard technique inmachine learning, which has been intensively studied in thesubfield of Statistical Relational Learning (SRL), but—sofar—this is still an under-investigated topic in the contextof Probabilistic Databases (PDBs). In this paper, we fo-cus on learning the pr...

A new scheme for physically accessing tuples by multiple transactions is described for database systems using a shared memory buuer cache. Using this scheme, a transaction must rst obtain logical permission to access a tuple, for example, by taking a lock on the tuple. Once logical permission has been granted, a page level latch is taken for the initial physical access to the tuple. However, by...

Robust parallel computation in Linda requires both tuple space and processes to be resilient to failure. In this paper, we present PLinda 2.0, set of extensions to Linda to support robust parallel computation on loosely coupled processors communicating over a network. The principal extensions of PLinda 2.0 to Linda are transaction mechanisms for reliable tuple space and process-private logging ...

Java-based tuplespaces provide a simple infrastructure for scientific distributed computing. There are several classes of problems that are not efficiently solvable in JavaSpaces model of computation while efficiently solvable in other tuplespace implementation. JavaSpaces can be used for high performance computing if viewed less strictly in the heritage of Linda and more as a platform-neutral ...

SETL/E is a procedural prototyping language based on the theory of finite sets. The coordination language Linda provides a distributed shared memory model, called tuple space, together with some atomic operations on this shared data space. Process communication and synchronization in Linda is also called generative communication, because tuples are added to, removed from and read from tuple spa...