David Gelernter. Generative communication in Linda. ACM Trans. Program. Lang. Syst., 7(1):80--112, 1985.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

....use for communication across space and time. Generative communication is a form of data exchange which is no longer based on names or channels, as in traditional concurrent systems, but on the data itself, together with some filtering mechanism to select data. Typical examples are the Linda model[12], which uses pattern matching, and Gamma[5] which uses so called reaction conditions, i.e. predicates over the data. The kind of data exchanged in such shared spaces is rarely defined explicitly, but is usually assumed to be first order (atomic values, or structured values built from some ....

....computation, which use a common data repository as communication medium, and use some data selection mechanisms as communication primitives. We will briefly review some of these models, in order to provide some global view, and to justify our choice. The earliest coordination model is Linda[12]. The dataspace in Linda is a persistent multiset of tuples. Concurrent agents, possibly written in different languages, exchange tuples through the dataspace. There is one output primitive out, for writing a persistent tuple, and two input primitives in and rd, for reading values from the tuple ....

David Gelernter. Generative Communication in Linda. ACM Transactions on Prog. Lang. and Systems, 7(1):80-112, 1985.

....API (class library) A distributed services infrastructure, Jini Mobile Edition (JiniME) which is a variation of Jini Network Technology designed for small mobile wireless devices. A distributed communication and collaboration infrastructure, Anhinga Spaces, which provides a tuple space [19] patterned after JavaSpaces [20] designed for small mobile wireless devices. 4.1. Anhinga Java Environment The AVM implements the Java 2 Micro Edition Connected Limited Device Configuration (J2ME CLDC) specification [3] with extensions needed by the Anhinga Infrastructure. The J2ME CLDC was ....

....side of the boundary, the invocation comes to the delegate running on the Sessile Bridge, which forwards the invocation on to the service. 4.3. Anhinga Spaces communication and collaboration using the tuple space abstraction for parallel and distributed programming originated by Gelernter [19] and embodied in such systems as Linda [24] and JavaSpaces [20] Distributed applications use a tuple space in this fashion: There is a conceptual global tuple space shared by all the collaborating processes. The tuple space contains tuples. Each tuple is a typed data structure containing ....

David Gelernter. "Generative Communication in Linda." ACM Transactions on Programming Languages and Systems, Volume 7, Number 1, January 1985, pages 80--112.

....Exchanging news is the only form of communication. A news item generated by an agent is overridden by a fresher item from the same agent even if no other agent has ever processed it. The communication model is generative in the sense that agents are temporally and referentially uncoupled [10] [11]. In other words, a news recipient need not be known or even exist at the time a news item is published, nor does a news item need to explicitly identify its sender and receivers. However, as we shall see, referential coupling can easily be implemented by newscast applications if necessary. The ....

David Gelernter, "Generative communication in Linda," ACM Transactions on Programming Languages and Systems, vol. 7, no. 1, pp. 80--112, Jan. 1985.

....environments. This shared data service has a number of objectives: Easy introduction of new data types. Tightly integrated support for both event oriented and state oriented data distribution. Support for loosely coupled data sharing, exploiting pattern matching, inspired by tuple spaces [10] and general event systems such as Elvin [20] Timeliness and throughput sufficient to support interactive applications, such as CVEs. Support for intermittent connectivity, limited bandwidth and variable loss, for example over wireless networks. In the current implementation any ....

....real and virtual, thus permitting the convergence of these worlds. The EQUIP data sharing service supports the sharing of arbitrary data among heterogeneous distributed applications, embracing applications written in both C and Java. The EQUIP platform extends work on tuple spaces (e.g. LINDA [10], Tspaces [14] Limbo [6] and shared virtual environments to provide an active shared state infrastructure that is equally accessible from large virtual environments and small handheld devices. As well as application state, the platform also allows service information to be shared, enabling a ....

David Gelernter, "Generative Communication in Linda". ACM Transactions on Programming Languages and Systems, Jan. 1985, Vol. 7, No. 1, pp. 80-112.

....arc to the correct vertical line, then travels along a blue arc to the correct node, somewhat like the Manhattan street map. One finds the blue red path from one node to another similarly by moving first vertically then horizontally. This relates to the inter processor communication graphs in [8], with added notions of symmetry. There, the author is interested in digraphs that can be coloured so that between every pair of vertices (a; b) there is a unique directed path from a to b coloured red blue, but not the dual (a unique path coloured blue red) The graph pairs he advocates are of ....

David Gelernter. Generative communication in Linda. ACM Trans. Prog. Lang. and Sys., 7(1):80--112, January 1985.

....the same scale, XSet has the least complex query model, and supports a much smaller set of queries. XSet queries can be characterized as a subset of the XQL language, represented as a XML document. As a query model, XSet queries also resemble the associative matching aspects of Linda Tuplespaces [12]. Linda di ers from XSet in that it is a distributed communication mechanism, rather than a standalone query engine. 2.5 Tag Index The tag index is a simple, hierarchical indexing structure. It can be characterized as a dynamic structural summary of the documents in the dataset. A B T1 T2 T3 ....

David Gelernter. Generative communication in Linda. In Transactions on Programming Languages and Systems, volume 7, pages 80-112. ACM, January 1985.

....TuCSoN Application development and deployment has been carried out upon a mobile agent platform based on the TuCSoN coordination infrastructure. A. TuCSoN overview The TuCSoN coordination model and infrastructure is based on the notion of (logic) tuple centre [20] which is a Linda tuple space [21] empowered with the ability to define its behaviour in response to communication events according to the specific coordination needs. It has been argued [22] that the openness and the wideness of the Internet scenario make it suitable to conceive the Internet as a multiplicity of independent ....

David Gelernter, "Generative communication in Linda", ACM Transactions on Programming Languages and Systems, vol. 7, no. 1, pp. 80--112, 1985.

....explanation measures. This approach automatically allows the interpreter to make as detailed an examination of the code as desired, before it is executed. In this subsection, we show a few examples of wrex items that could be used for particular interaction styles. Our first example uses Linda [25] [18] 19] for coordination in a distributed tuple space . Without describing Linda in detail, we show how it is interpreted in our approach. The context of computation in Linda is the tuple space , in which there are various operations that match tuples to tuple patterns or activate processes ....

David Gelernter, "Generative Communication in Linda", ACM TOPLAS: Transactions on Programming Languages and Systems, Volume 7, No. 1, pp. 80-112 (1985)

....on information can be placed into the Tree Space. This information can be retrieved from the Tree Space by any process by matching with a pattern. Rosette processes on separate machines can read and write into any other connected Tree Space. The Tree Space is similar to the tuple space of Linda[2] except Tree Spaces in Rosette have the additional ability of being arbitrarily connected to other Tree Spaces in a tree or non acyclic graph topology. There are three basic Rosette operations on Tree Spaces: Rd, In, Out. Rd performs a non destructive read on the Tree Space. The first pattern ....

....Spaces is not limited to that supplied by byName. 8 Being connected to a remote Tree Space gives rise to a very powerful and flexible distributed computing capability, remote evaluation. 4] The Eval procedure can be used to request the remote evaluation of a Rosette expression. Eval (sort [1 2 4 3 7 9 5 6]) earth.cs.utexas.edu] This Eval statement requests that the expression (sort [1 2 4 3 7 9 5 6] which might sort the values in a tuple, be evaluated on the remote machine earth. Expressions are passed to and from Rosette by a RosetteStream. A RosetteStream is an I O stream abstraction built ....

[Article contains additional citation context not shown here]

Gerlernter, David, "Generative Communication in Linda," ACM Trans. Program. Lang. Syst., vol. 5, no. 1, pp. 80--112, January, 1985.

No context found.

David Gelernter. Generative communication in Linda. ACM Trans. Program. Lang. Syst., 7(1):80--112, 1985.

No context found.

David Gelernter, "Generative communication in Linda," ACM Transactions on Programming Languages and Systems, vol. 7, no. 1, pp. 80--112, 1985.

No context found.

David Gelernter, Nicholas Carriero. Generative Communication in Linda. ACM TOPLAS, vol. 7, no. 1, Jan. 1985.

No context found.

David Gelernter, Generative communication in Linda, ACM TOPLAS, Vol. 7, No. 1, January 1985.

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