| N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989. |
....begin L and end L which describe the authenticity properties expected of the protocol. We take a new approach to formalizing correspondence assertions via a tuple space metaphor. Informally, we regard these events as analogous to put and get in a fictitious secure tuple space similar to 30 Linda [CG89]. When a begin L event takes place, we add L to the secure tuple space. When an end L event takes place, we remove L from the tuple space: a violation of the security requirements of the protocol have taken place if L is not present. In reality, this tuple space does not exist, so we need the type ....
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
....dicult to program than systems that enable processes to communicate via shared memory. Many experimental and commercial processors provide direct support for shared memory abstractions, and increasing attention is being paid to implementing shared memory systems either in hardware or in software [Bel92,CG89, LH89,TKB92]. Moreover, several middleware systems have been built to implement shared memory abstractions in a message passing environment. Of primary interest here are those that employ replication to provide faulttolerant shared memory abstractions, particularly those designed to mask the arbitrary ....
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444-458, April 1989.
....acts as communication media between pairs of processes. 2.9 Related Paradigms Similarities can be found with the concurrent logic programming framework as well. This topic was considered by Shapiro, Carriero, and Gelernter, who discussed the embedding of Linda into concurrent logic languages [117]. As tuple space languages, concurrent constraint programming (ccp) 112, 111] exploits the shared memory communication model: ccp processes synchronize and communicate by reading and writing on a common store. A difference with respect to tuple space based languages is that the ccp store is ....
....entail a constraint, or to cancel the contained information. Moreover, the ccp integrity constraints cause, when violated, the failure of a write operation, while in tuple space based languages write operations never fail. The embedding of Linda into concurrent logic languages, as discussed in [117], was essentially related with expressive power and elegance, as the differences between the two paradigms did not allow a finer comparison. However, in the meanwhile, the gap between the two languages families has considerably reduced: on one side, the tuple space model evolved to logic languages ....
E. Y. Shapiro, N. Carriero, and D. Gelernter. Linda in Context. Communications of the ACM, 32(10):1244--1258, 1989.
....: 134 8.2 Refinement step 1: progress : 137 8.3 Refinement step 1: safety : 138 8. 4 Refinement step 2: progress : 141 Introduction Tuple space languages were first introduced with Linda [38, 40], and are based on the idea that a dynamic collection of tuples can act as shared state of concurrent processes. A tuple is a convenient way to represent complex information. The presence of a tuple in the tuple space represents a signal; moreover, tuples carry values. In this perspective, the ....
....that exploiting variable addresses. This feature is known as associative access to data and strongly characterises the paradigm. Indeed, associative access is an aspect of declarativity. The first system truly based on the notion of tuple space, logically shared among concurrent agents, is Linda [38, 40]. Initially conceived as a coordination language, Linda evolved into a well defined paradigm to model communication and synchronization among distributed processes, written in various languages (C, Fortran, Prolog) Carriero and Gelernter describe the properties of a new space temporal dimension ....
[Article contains additional citation context not shown here]
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444--459, 1989.
....languages make concurrency the normal case, sequentiality the special case. Interest has also grown in languages which access entities by content rather than by name logic based languages (e.g. Prolog [23] production rule systems (e.g. OPS5 [3] and tuple space languages (e.g. Linda [1, 4]) The content addressable approach seems to encourage higher degrees of concurrency and more flexible connections among components. Program verification techniques for such languages are just beginning to be researched. Because we desire high degrees of concurrency while preserving the ....
....together a variety of programming styles (synchronous and asynchronous, static and dynamic) within a unified computational framework. The main vehicle for this investigation is a programming model and notation called Swarm [20] The design of Swarm was influenced by the previous work on Linda [1, 4], Associons [15, 16] OPS5 [3] and UNITY [5] Following the simple approach taken by the UNITY model, we sought to base Swarm on a small number of constructs we believe are at the core of a large class of shared dataspace languages. The state of a Swarm program consists of a dataspace, i.e. a ....
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, April 1989. 27
....development lifecycle transform it into a parallel program using the provided toolset. An alternative to both shared memory and message passing parallel programming is provided by Linda. Linda is a concurrent model that uses a tuple space abstraction for communication among cooperating processes [19, 20]. It is an abstraction of distributed shared memory with some important differences, including association, and is available as a commercial product. 4.3.2 Object Exchange Another flavor of information exchange middleware is a variety of, usually CORBA compliant, commercial object brokers that ....
Nicholas Carriero and David Gelernter. Linda in context. Communications of the ACM, 32(4):444-- 458, April 1989.
....[104, 122] and an e#cient implementation [70, 68, 88, 97, 95] An early discussion of multiparadigm programming in Oz is given in [66] It gives examples in functional, logic, and object oriented styles. A short term solution to integrate di#erent paradigms is to use a coordination model [13, 14]. The prototypical coordination model is Linda, which provides a uniform global tuple space that can be accessed with a small set of basic operations (concurrent reads and writes) from any process that is connected to it. A Linda layer can act as glue between languages of di#erent paradigms. Let ....
Nicholas Carriero and David Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444-- 458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444-- 458, 1989.
No context found.
Carriero, N.---Gelernter, D.: Linda in Context. Communications of the ACM, Vol. 32, 1989, No. 4, pp. 444--458.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444--458, Apr. 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, Apr. 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, Apr. 1989.
No context found.
N.Carriero and D. Gelernter. Linda in Context. Communications of the ACM, Vol. 32, No. 4, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(9):444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(9):444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4), april 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4), April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4), April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM 32(4), April 1989.
No context found.
CARRIERO, N.; GELERNTER, D. Linda in context. Communications of the ACM, v.32, n.4, p.444-458, 1989.
No context found.
Carriero, N. and Gelernter, D. Linda in context. Communications of the ACM, 32:444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communication of ACM, 32(4), April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, Apr. 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444-- 458, 1989.
No context found.
N. Carriero, D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444-458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, Apr. 1989.
No context found.
Carriero, N. -- Gelernter, D.: Linda in context. Communications of the ACM 32(4), 1989, pp. 444--458.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444-458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, Apr. 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
No context found.
N. Carriero, D. Gelernter. Linda in context. Communications of the ACM 32(4): 444--458, 1989
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, apr 1989.
No context found.
N. Carriero, D. Gelernter, Linda in context, Communications of the ACM 32 (4) 444-58.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444-458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4), 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
No context found.
Nicholas Carriero and David Gelernter, Linda in context, Communications of the ACM, Vol. 32, No. 4, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communication of the ACM, 32(4):444--458, Apr. 1989.
No context found.
Nick Carriero and David Gelernter. Linda in Context. Communications of the ACM, 32(4):444 -- 458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444-- 458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444-- 458, April 1989.
No context found.
N.Carriero and D. Gelernter. Linda in Context. Communications of the ACM, Vol. 32, No. 4, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in Context. Communications of the ACM, Vol. 32, No. 4, pp. 444458, April 1989.
No context found.
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444-- 458, April 1989.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC