Results 1 - 10 of 129

On the Expressiveness of Linda Coordination Primitives

by Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro - Information and Computation
"... We introduce a process algebra containing the coordination primitives of Linda (asynchronous communication via a shared data space, read operation, non-blocking test operators on the shared space). We compare two possible semantics for the output operation: the former, that we call ordered, defines ..."
Abstract - Cited by 29 (12 self) - Add to MetaCart
We introduce a process algebra containing the coordination primitives of Linda (asynchronous communication via a shared data space, read operation, non-blocking test operators on the shared space). We compare two possible semantics for the output operation: the former, that we call ordered, defines

PROLOG-LINDA : AN EMBEDDING OF LINDA IN muPROLOG

by Geoff Sutcliffe, James Pinakis , 1989
"... This paper presents an embedding of the Linda parallel programming paradigm in Prolog. A mono-processor and a multi-processor implementation are described. Both implementations provide coarse grain parallelism to Prolog. The embedding of Linda in Prolog extends Linda's standard tuple space oper ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
operations, permitting unification and Prolog style deduction in the tuple space. Examples of the added capabilities introduced by a deductive tuple space, as well as example applications of Prolog-Linda as a whole, are given. 1 Introduction The Linda programming paradigm#[1] developed by David Gelernter has

Combining SETL/E with Linda

by W. Hasselbring - In Wilson G (ed), Proc. Workshop on Linda-Like Systems and Their Implementation, pp 84--99. Edinburgh Parallel Computing Centre , 1991
"... 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 c ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
for changing tuples in tuple space to combine set-oriented programming with generative communication: SETL/E-Linda. 1 Introduction and

LINDA and Its Offspring

by Oliver Oppitz , 1998
"... The coordination language Linda has gone through a long development since it was conceived in the mid 1970s. While it was just a language at the beginning, today the spectrum of Linda-related work is broad and ranges from implementations in practically all relevant programing languages, some commerc ..."
Abstract - Add to MetaCart
commercial implementations over fault tolerance mechanisms to an operating system based on it. This article --- while not being exhaustive in any area --- wants to present an overview over this spectrum and to encourage the reader to explore his special area of interest. 1 Introduction to Linda The Savage

A Rendezvous with Linda

by Kristina Lundqvist, Göran Wall , 2000
"... . The Ada 9X revision found the rendezvous mechanism too complex to implement as the communication mechanism in a distributed system. In this paper another distributed programming model, Linda, is related to the rendezvous mechanism. Linda can be used to allow tasks to communicate in a rendezvous ..."
Abstract - Add to MetaCart
. The Ada 9X revision found the rendezvous mechanism too complex to implement as the communication mechanism in a distributed system. In this paper another distributed programming model, Linda, is related to the rendezvous mechanism. Linda can be used to allow tasks to communicate in a

Global Synchronisation in Linda

by Paul Butcher, Alan Wood, Martin Atkins , 1994
"... This paper examines the "Distributed Summation" problem, and its solution in Linda. A number of problems with the current set of primitives are examined, and a new primitive, collect, is proposed. 1 Introduction The coordination language Linda [1, 4, 5] constitutes a simple, efficient an ..."
Abstract - Add to MetaCart
This paper examines the "Distributed Summation" problem, and its solution in Linda. A number of problems with the current set of primitives are examined, and a new primitive, collect, is proposed. 1 Introduction The coordination language Linda [1, 4, 5] constitutes a simple, efficient

A Distributed Linda-like Kernel for PVM

by Antony Rowstron, Andrew Douglas, Alan Wood - In EuroPVM'95 , 1995
"... In this paper we describe the implementation of a Linda-like system on top of PVM. The kernel was initially developed for a Transputer based system[4]. For flexibility the system was ported to PVM. This paper outlines how the York kernel works, how it currently performs with respect to a similar sys ..."
Abstract - Cited by 10 (6 self) - Add to MetaCart
system and possible future developments for the PVM version. 1 Introduction Linda[2] is a communication model for parallel processes. It is also often described as a co-ordination language, based on the idea that any parallel program has two parts: computation and coordination[6]. Linda is always

Shared Packages Through Linda

by Göran Wall, Kristina Lundqvist - Proceedings of Ada-Europe'96 , 1996
"... . This paper describes a method to implement the functionality of shared passive packages on top of a logical distributed memory --- Linda. From a shared passive package a compiler can construct a new normal package that replaces the shared passive package. The new package contains the same subpr ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
subprograms and is extended with abstract data structures mapping Ada objects onto the storage units of Linda. A short program example is included to illustrate the construction process. 1 Introduction The Ada 95 standard, RM95 [1], defines a distributed Ada program as a number of partitions working

A Process Algebraic View of Linda Coordination Primitives

by Nadia Busi, Roberto Gorrieri, Gianluigi Zavattaro , 1998
"... The main Linda coordination primitives (asynchronous communication, read operation, nonblocking in/rd predicates) are studied in a process algebraic setting. A lattice of eight languages is proposed, where its bottom element L is a process algebra differing from CCS only for the asynchrony of the ou ..."
Abstract - Cited by 47 (15 self) - Add to MetaCart
languages, Semantics of Linda, Process algebra. 1 Introduction The aim of this paper is to pr...

Resource Access Control in Systems of Mobile Agents

by Matthew Hennessy, James Riely - Information and Computation , 1998
"... INTRODUCTION Mobile computation, where independent agents roam widely distributed networks in search of resources and information, is fast becoming a reality. A number of programming languages, APIs and protocols have recently emerged which seek to provide high-level support for mobile agents. These ..."
Abstract - Cited by 212 (18 self) - Add to MetaCart
INTRODUCTION Mobile computation, where independent agents roam widely distributed networks in search of resources and information, is fast becoming a reality. A number of programming languages, APIs and protocols have recently emerged which seek to provide high-level support for mobile agents
Results 1 - 10 of 129