A. Brogi, P. Ciancarini. The concurrent language Shared Prolog. ACM Trans. on Programming Languages and Systems, 13(1):99-123, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Linda paradigm for process interaction as our starting point for defining an asynchronous process algebra with explicit data value exchange. Linda [24, 12] is a member of a relatively recent generation of global environment parallel languages (e.g. Concurrent Prolog [45] UNITY [14] Shared Prolog [3]) that differ from the previous ones because they offer, and often require, explicit control of interactions. A communication between Linda processes is obtained by accessing tuples (sequences of variables and data) in a shared memory called tuple space (a multiset of tuples) The communication ....

A. Brogi, P. Ciancarini. The concurrent language Shared Prolog. ACM Trans. on Programming Languages and Systems, 13(1):99-123, 1991.

.... languages also exist that can, in principle, be used for coordination, in as much as logic clauses can represent the constraints and the protocols for concurrent execution of atomic goals (i.e. sequential computation fragments) This includes, e.g. Strand[19] PMS Prolog[20] Shared Prolog[21], and Constraint Logic Programming languages[22] Among them, Strand is different because of its emphasis on coordination constructs. Indeed, Strand is offered as a coordination language and, like Linda, has been used to augment imperative sequential languages such as C and Fortran, yielding ....

A. Borgi and P. Ciancarini, "The concurrent language Shared Prolog," ACM Transactions on Programming Languages and Systems, vol. 13, no. 1, pp. 99--123, 1991.

....completely independent of the host language; thus, it is possible to derive natural Linda variants of almost any programming language or paradigm (imperative, logic, functional, object oriented, etc. Linda s friends are C, Modula, Pascal, Ada, Prolog, Lisp, Ei#el and Java to name but a few ([2, 17, 20, 61]) The following example is an implementation of the Dining Philosophers in C Linda. In the Dining Philosophers problem, a number (typically 5) of philosophers are seated around a table, with a plate of food (typically spaghetti) in front of each one of them, and a fork between each plate. To ....

A. Brogi and P. Ciancarini, "The Concurrent Language Shared-Prolog", ACM Transactions on Programming Languages and Systems 13 (1), 1991, pp. 99--123.

.... ones) support multilingual programming and perform optimisations at all possible levels (including the coordination one) A number of such coordination models and languages have evolved over the last few years such as Linda and related formalims based on the Shared Dataspace approach ([1,7,8,12,16]) Gamma based on Multiset Rewriting ( 6] Linear Objects based on Linear Logic ( 2] UNITY and (various types of) Skeletons based on functional programming ( 9,10,21] PCN and related formalisms based on (concurrent) logic programming ( 11] the Programmer s Playground based on I O ....

....desirable for a number of agents to communicate with each other in a conferencing mode, i.e. whatever output one produces is replicated to all other agents. This functionality is useful in applications such as teleconferencing. In coordination models which use a common shared communication medium ([1,2,6,7,8,9]) this can be done trivially by having each agent post to the medium information while the rest of the agents retrieve it. However, this simple scenario is not without its disadvantages: the information is usually physically replicated to the private memory of all agents accessing the public ....

[Article contains additional citation context not shown here]

A. Brogi and P. Ciancarini, "The Concurrent Language Shared-Prolog", ACM Transactions on Programming Languages and Systems 13 (1), 1991, pp. 99-123.

....to the prescriptive nature of the synchronizers of [28] Some coarse grain parallel logic programming languages have also been viewed as coordination languages. PMS Prolog[37] is an example. Multi Prolog[38] and Prolog D Linda[39] are Prolog extensions based on the Linda model. Shared Prolog[40] is based on an extended Linda model that uses multiple data spaces. Strand[41] is a parallel logic programming language with an emphasis on coordination. It offers a set of parallel programming mechanisms independent of the mechanisms for controlling sequential computations. It uses fine grain ....

A. Borgi and P. Ciancarini, "The concurrent language Shared Prolog," ACM Transactions on Programming Languages and Systems, vol. 13, no. 1, pp. 99--123, 1991.

.... ones) and support multilingual programming and perform optimisations at all possible levels (including the coordination one) A number of such coordination models and languages have evolved over the last few years such as Linda and related formalims based on the Shared Dataspace approach ([1,10,12,16,24]) Gamma based on Multiset Rewriting ( 7] Linear Objects ( 3] based on Distributed and Parallel Systems Engineering in MANIFOLD George A. Papadopoulos 3 Linear Logic and the framework of Interaction Abstract Machines ( 2] UNITY and (various types of) Skeletons based on functional ....

....a coordination assembly language . However, this simplicity is also Linda s weak point. The vanilla model does not support point to point communication nor does it guarantee any form of security while accessing the Tuple Space which is a public forum. This has led to a number of extensions ([10,24]) that try to address these issues and ameliorate the associated problems. Furthermore, the programming style encouraged by Linda and associated models suggests using shared dataspace access primitives directly in the computation code. This mixes communication code with computation code. Finally, ....

A. Brogi and P. Ciancarini, "The Concurrent Language Shared-Prolog", ACM Transactions on Programming Languages and Systems 13 (1), 1991, pp. 99-123.

....Linda paradigm for process interaction as our starting point for defining an asynchronous process algebra with explicit data value exchange. Linda [26, 12] is a member of a relatively recent generation of global environment parallel languages (e.g. Concurrent Prolog [47] UNITY [14] Shared Prolog [3]) that differ from those of previous generations because they offer, and often require, explicit control of interactions. A communication between Linda processes is obtained by accessing tuples (sequences of variables and data) in a shared memory called tuple space (a multiset of tuples) The ....

A. Brogi, P. Ciancarini. The concurrent language Shared Prolog. ACM Trans. on Programming Languages and Systems, 13(1):99-123, 1991.

....completely independent of the host language; thus, it is possible to derive natural Linda variants of almost any programming language or paradigm (imperative, logic, functional, object oriented, etc. Linda s friends are C, Modula, Pascal, Ada, Prolog, Lisp, Eiffel and Java to name but a few ([2,17,20,61]) The following example is an implementation of the Dining Philosophers in C Linda. In the Dining Philosophers problem, a number (typically 5) of philosophers are seated around a table, with a plate of food (typically spaghetti) in front of each one of them, and a fork between each plate. To ....

A. Brogi and P. Ciancarini, "The Concurrent Language Shared-Prolog", ACM Transactions on Programming Languages and Systems 13 (1), 1991, pp. 99-123.

....that qualify informally as PASOs have been used as coordination languages in a variety of parallel programming systems, e.g. in the context of C [10] Scheme 1 A preliminary version of this paper appeared in the Proc. 1994 ACM Symp. on Principles of Distributed Computing (PODC) 18] Prolog [9], distributed object oriented systems [24] Modula 2 [8] program visualization systems [25] math libraries [11] and as part of other coordination mechanisms [1, 22] They have proven to be an effective basis for concurrent programming in many multi processing environments [10] Despite these ....

A. Brogi and P. Ciancarini. The concurrent language Shared Prolog. ACM Trans. on Programming Languages and Systems, 13(1):99--123, 1991.

.... of the tuples is independent of the underlying programming language used, thus rendering Linda a true coordination model where processes can be written in any programming language; indeed there are a number of such successful marriages ( 2,11] such as C Linda, Fortran Linda and Prolog Linda ([9]) The Linda formalism (and more generally the Shared Dataspace one) shares the same purpose with IWIM, namely addressing the deficiencies of the TSR model, and achieves that by providing symmetric, anonymous means of communication between parties. Nevertheless, there are a number of fundamental ....

A. Brogi and P. Ciancarini, "The Concurrent Language Shared-Prolog", ACM Transactions on Programming Languages and Systems 13(1), 1991, pp. 99-123.

....of a number of concurrently executing activities can be achieved. Linda is a true coordination model in that the executing processes can be written in any programming language and indeed there are a number of such successful marriages ( 2] such as C Linda, Fortran Linda and Prolog Linda ([6]) It is worth pointing out that Linda is not a concrete language but rather a set of add on primitives. This has many advantages (such as the fact that these primitives can fit into almost any computational model) however, the functionality offered, although simple to use and intuitive, is ....

A. Brogi and P. Ciancarini, "The Concurrent Language Shared-Prolog", ACM Transactions on Programming Languages and Systems 13(1) , 1991, pp. 99-123.

....explicit channel over which the two processes communicate. A new class of parallel languages, conceptually based on concurrent computation inside a shared data space, is emerging. These languages are either imperative, like Linda [14] Associons [30] and Gamma [3] or logic, like Shared Prolog [5], Swarm [31] and LO [1] The shared data space is either a multiset of tuples (Linda, Associons, Gamma) or of logic terms (Shared Prolog, Swarm, LO) Furthermore, communication is based on some form of pattern matching, and is both associative and asynchronous. The common features of these ....

....the semantic frameworks that we have explored are useful also for giving insights concerning other programming languages based on the shared dataspace paradigm of programming. In particular, we are studing the application of this semantic formalisms to the parallel logic languages Shared Prolog [5] and LO [1] that are logic languages based on parallel rewritings of a logic tuple space. ....

Antonio Brogi and Paolo Ciancarini. The concurrent language Shared Prolog. ACM Trans. on Programming Languages and Systems, 13(1):99--123, 1991.

....process has an independent existence in TS until it is explicitly withdrawn. In fact, after its insertion in TS, a message becomes equally accessible to all processes, and it is bound to none. Generative communication is provided not only by Linda, but also by other languages such as Shared Prolog (Brogi and Ciancarini, 1991) and Bauhaus Linda (Carriero, Gelernter, and Zuck, 1995) The main difference among these languages is the type of messages in the shared memory: Linda uses ordered tuples, Shared Prolog logic terms, and BauhausLinda unordered multisets. For the sake of generality and simplicity, messages will be ....

Brogi, A. and Ciancarini, P. (1991) The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1):99-123.

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