G. A. Papadopoulos and F. Arbab. Coordination Models and Languages. In The Engineering of Large Systems, volume 46 of Advances in Computers, pages 329--  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in the case of logic programming it is not easy to choose communication mechanisms that t well with their operational model and with their declarative nature. An interesting approach to extend a sequential language with communication mechanisms consists of using a coordination language [10, 41]. A coordination language is a minimalist language including a small set of primitives which allow processes to communicate and cooperate. In order to obtain a full programming language, a coordination language has to be combined with a sequential language, used to express the computational ....

G. Papadopoulos and F. Arbab. Coordination models and languages. In Advances in Computers, volume 46: The Engineering of Large Systems. Academic Press, 1998.

.... this subject was revived by philosopher Charles Hamblin s use of dialogue games to study nondeductive reasoning [9] These games have recently become important for the design of protocols for agent interactions, e.g. 14, 16, 22] A key concept, formalized initially by Hamblin, is that of an See [19] for a review of tuple space models. See: http: java.sun.com products javaspaces . agent s Commitment Store, associated to each participant in an interaction [9, p. 257] These stores keep track, through the course of a dialogue, of the dialogical commitments incurred by each agent, i.e. the ....

G. A. Papadopoulous and F. Arbab. Coordination models and languages. In M. V. Zelkowitz, editor, Advances in Computers: The Engineering of Large Systems, volume 46. Academic Press, The Netherlands, 1998.

....among agents in communities is performed by message passing and the messages have to be accepted by appropriate roles in order to enable the collaboration. Our framework adopts the mechanism of collaboration among roles developed by Field Reactor Model [9] that is a coordination model [10] based on Dataflow Computing [11] The Field Reactor Model (FRM) provides a method of flexible collaboration among agents by employing pattern matching. VPC P provides pattern invocation that is based on FRM. The patterns in VPC P correspond to patterns in FRM and pattern invocation provides a ....

G. A. Papadopoulos and F. Arbab, "Coordination Models and Languages", Advances in Computers Vol. 46, pp 329-400, 1998

.... Author is supported by CNPq Brasil CAPES Brazil. 2 In parallel programming, the need to deal with issues such as heterogeneity and fault tolerance, specially when dealing with distributed memory environments, has also led to the development of multi lingual programming models [4]. Many researchers have also identi ed the need to separate concerns and requirements of the computation itself and of cooperation and communication between computational components. Coordination models [4,5] support this separation of concerns, often proposing distinct languages for programming ....

....memory environments, has also led to the development of multi lingual programming models [4] Many researchers have also identi ed the need to separate concerns and requirements of the computation itself and of cooperation and communication between computational components. Coordination models [4,5] support this separation of concerns, often proposing distinct languages for programming these two types of activities. However, because of the emphasis that is conventionally placed on performance of parallel programs, interpreted languages have not received much attention as potential candidates ....

[Article contains additional citation context not shown here]

G. Papadopoulos, F. Arbab, Coordination models and languages, in: Advances in Computers, Vol. 46, Academic Press, 1998, pp. 329-400.

....entities that manage the corresponding interactions [19] These approaches can be best described by the maxim Applications = Computation Coordination. Coordination can be seen as the management of dependencies between computational entities, or as the glue between distributed software agents [37]. Recent work in the area of coordination has focused on the development of particular coordination languages that realize a particular model of coordination (the interested reader may find corresponding overviews in chapters 2 and 4 as well as in [37] Coordination problems, however, cannot ....

.... the glue between distributed software agents [37] Recent work in the area of coordination has focused on the development of particular coordination languages that realize a particular model of coordination (the interested reader may find corresponding overviews in chapters 2 and 4 as well as in [37]) Coordination problems, however, cannot always be solved by solely using a particular model. Furthermore, data driven coordination approaches such as Linda [9] do not enforce a clear separation of concerns as a mixture of coordination and computation code within an agent is still possible. ....

G. A. Papadopoulos and F. Arbab. Coordination Models and Languages. In The Engineering of Large Systems, volume 46 of Advances in Computers. Academic Press, Aug. 1998.

.... The first coordination models and languages developed such as Linda, Gamma, Manifold to cite the representatives of large families were focused on basic coordination mechanisms and activities, such as synchronization, exchange of simple information, notification and reaction (see [23, 22] for comprehensive surveys) The evolution of these first models has been toward three main directions: more complex communication languages (XML documents in MARS X, objects in Objective Linda, or forms used in Laura) more complex topologies used to organize coordination media (such as ....

....systems, coming from di#erent research areas (distributed artificial intelligence and parallel computing in primis) and we provided a comparison, focusing on their impact on the engineering of MASs. Actually, some comparative surveys about coordination models can be found in literature [23, 22, 29], but either they do not cover the heterogeneity of the coordination approaches found in MASs, or they do not account for the engineering impact of the models on the design and development. This paper is not meant to propose a final choice between the coordination models that we analysed. We ....

G. A. Papadopoulos and F. Arbab. Coordination models and languages. Advances in Computers, 46:329--400, 1998.

....wide range of cooperation scenarios and its runtime support. At a first sight, one may wonder how it is different from many seemingly similar ones, such as the concurrent object model, the multi agent model, CORBA, and many coordination models and languages for parallel and distributed computing [7] . Due to page limitations, we can not give a detailed comparison here. Our general answer to the question is that our model is targeted at a different goal, i.e. modeling and supporting a wide range of scenarios of interactions among cooperators, which are usually human beings. Therefore, the ....

G A Papadopoulos, F Arbab. Coordination models and languages. CWI Report, 1998. Available at: http:://www. cwi.nl/ftp/CWIreports/SEN/SEN-R9834.ps.Z

.... instead, the separation between the individual perception of coordination and the global coordination issues, enabling the modelling and shaping of the interaction space independently of the interacting entities [19] For the purpose, several coordination models and languages have been developed [23], and applied to MAS [22] providing explicitly the separation between coordination and computation issues in system design and development [11] This kind of coordination is called objective because it prescinds from the subjective view of the coordinated agents. It is also called uncoupled [26] ....

G. A. Papadopoulos and F. Arbab. Coordination models and languages. Advances in Computers, 46:329-- 400, 1998.

....tuplespace [4] This functionality, that we call mediation, allows for explicit control over component cooperation 6 through message rewrite rules. The approach is related to data centered architectures and is therefore related to some extent to a great number of similar approaches (see [10] for a comprehensive survey) Neem differs from these approaches by providing an explicit locus of (meta level) coordination control, the mediation functionality described above. More specifically, Neem shares Laura s view of components as providers of multiple services [11] Unlike Laura, there ....

G. A. Papadopoulos and F. Arbab. Coordination models and languages. In The Engineering of Large Systems, volume 46 of Advances in Computers. Academic Press, 1998.

....specifications of the whole system in order to maintain the coherence of the original system preserving its semantic. So, such connectors have to specify when and how each aspect must be treated. This is a typical problem of coordination that has been solved with coordination models and languages [Gpap98]. Having all the above in mind it can be concluded that to manage the separation of concerns at architectural design of software systems the current ADL must be extended in order to provide the following functionality: 1. To specify functional components with interfaces and connection between ....

G.A. Papapdopoulos, F.Arbab. Coordination Models and Languages. Advances in Computers, 48. Academic-Press, 1998.

....solution 1 of the dining philosophers problem [20] Observe that our well intentioned concurrency plan has been interleaved with the underlying computation in a way that severely reduces the readability of this code. 1 This should not obscure the fact that more sophisticated solutions exist [1]; however, we believe that the problems discussed here are symptomatic of many approaches that in whatever guise rely on critical sections of code. In particular, it appears to be hard to separate concurrency control from computation in imperative languages without causing interleaving or ....

....is wrong. 6. 2 Separation of Concurrency and Computation It is desirable especially for the design of large systems to separate the pure computational parts of a system from the parts that control concurrent interaction, ideally in a way that does not hinder power or expressiveness[1].Computation and concurrencyspecifications should be expressible in their own notations, and they should be easily composed. We view this as a classic multi paradigm specification problem [21] In this view, partial specifications can be composed if there is some shared vocabulary (usually a set ....

F. Arbab and G. A. Papadopoulos. Coordination Models and Languages. In The Engineering of Large Systems. Advances in Computers. Academic Press, 1998.

....formulations. The seminal paper by DeRemer and Kron [DeRemer 76] proposed using a different notation for building modules and for gluing modules together, yet this latter notation could only convey simple define use relationships. A whole family of coordination languages, termed control driven [Papadopoulos 98] and especially the Manifold language [Arbab 93] are also based on the idea of separating computation modules (workers) from architectural modules (managers) at run time. While this is quite close to the concept of explicit architecture on which this proposal builds, it is not the intent of ....

George A. Papadopoulos and Farhad Arbab. Coordination Models and Languages. Advances in Computers, 46, 1998.

....A number of other coordination models rely on a notion of shared dataspace, e.g. Concurrent Constraint Programming [26] Gamma [3] Linear Objects [1] and Manifold [2] to cite only a few. A comprehensive survey of these and other coordination models and languages has been recently reported in [22]. However, the coding of applications evidence the fact that data rarely has an eternal life. For instance, a request for information on the web has to be satis ed in a reasonable amount of time. More crucial is even the request for an ambulance which, not only has to be answered eventually but ....

G.A. Papadopolous and F. Arbab. Coordination Models and Languages. Advances in Computers, 48, 1998.

....KLAIM [15] A number of other coordination models rely on a notion of shared dataspace, e.g. Concurrent Constraint Programming [23] Gamma [2] and Linear Objects [1] to cite only a few. A comprehensive survey of these and other coordination models and languages has been recently reported in [21]. The availability of a considerable number of coordination models and languages stimulates a natural question: Which is the best language or model for expressing coordination issues Of course the answer depends on what we mean by the best model. A formal way of specifying this question is ....

G.A. Papadopolous and F. Arbab. Coordination models and languages. Advances in Computers, 46:329-400, Academic-Press, 1998.

....that permit accessing and, possibly, modifying the structure of a net. A pair of examples, namely a network le system and a rewall, that exploit the new features, have been speci ed in H Klaim. H Klaim provides the user with two di erent forms of coordination. The rst one is called data driven [26] since it makes the coordination rules depend on information exchanged in the communications. The second one might be called location driven since it exploits the structure (i.e. the topology, the allocation environments and the routing functions) of the net where processes are allocated, run and ....

G.A. Papadopoulos, F. Arbab. Coordination models and languages. Advances in Computers, 46, 1998.

....order to show how to use the famework, we exploit the coordination architectures presented in the previous sections in order to describe and discuss well known coordination models taken from both the data driven and the control driven families. A description of these two families can be found in [22]. Here, we only recall that in the data driven approach coordination is obtained via the exchange of data through shared data spaces, while in the control driven family the emphasis is on the internal state of the active components and not on passive shared data. For example, many control driven ....

G.A. Papadopoulos and F. Arbab. Coordination Models and Languages. Advances in Computers, 46:329--400, 1998.

....is the hidden order sorted approach of Goguen et al. 14] We have only presented a limited number of coordination models as algebraic styles. Future work is needed to cover more coordination styles. We also want to inves 15. tigate bridging between data and control driven coordination [24]. It is intriguing to explore whether we can use the formal foundation of Piccola to derive the operational semantics of coordination models. An earlier version of Piccola describes the mapping to the pL calculus [21] Implementing a model in Piccola gives us the denotational semantics in terms of ....

George A. Papadopoulos and Farhad Arbab, "Coordination Models and Languages," The Engineering of Large Systems, Academic Press, August 1998.

....of data structures, and can therefore be used to easily model almost any kind of stuff. Why, then, have so many different variants of tuple spaces appeared over the years Numerous variations on tuple spaces have been proposed, and it does not seem as though this proliferation will end soon [PA98]. Again, there are numerous reasons why this should be so, both technical and pragmatic. # This research is funded by the Swiss Government under Project no. NFS 2000 46947.96. 2 On the pragmatic side, applications requirements impose different policies governing what kinds of stuff are ....

G. A. Papadopoulos and F. Arbab. Coordination Models and Languages. In The Engineering of Large Systems, volume 46 of Advances in Computers. Academic Press, August 1998.

.... optimizations versus low level optimizations, or register allocation versus instruction scheduling) interact, and how can a compiler manage those interactions to derive better global 19 decisions Coordination models: Arbab and Papadopoulos nicely summarize work on coordination models in [85, 8]. A coordination model provides a language, such as Arbab s MANIFOLD, for expressing how a diverse set of system components interact to form the whole. Chapter 3 A Static Counting Model for TLB and Cache If computers had only a single level of memory or parallelism, relatively simple cost ....

George A. Papadopoulos and Farhad Arbab. Coordination models and languages. Advances in Computers, 46:329--400, August 1998.

....models. As an example, in this section we exploit the coordination architectures presented in the previous sections in order to describe and discuss well known coordination models taken from both the data driven and the control driven families. A description of these two families can be found in [21]. Here, we only recall that in the data driven approach coordination is obtained via the exchange of data through shared data spaces, while in the controldriven family the emphasis is on the internal state of the active components and not on passive shared data. For example, many control driven ....

G.A. Papadopoulos and F. Arbab. Coordination Models and Languages. Advances in Computers, 46:329--400, 1998.

....[19] Coalgebras [13] and Transducers [30] Multi stream interaction, on the other hand, is still largely unexplored. Many areas of computation have dealt with multi stream interaction. Some examples are: collaboration models, different kinds of coordination models in distributed computing [4, 5, 21], process management and resource sharing having shared contents between multiple processes, etc. However, a generic mathematical model of the notion of multi stream interaction is still to be agreed upon. Wegner and Goldin [34] propose a model called Multi stream Interaction Machine (MIM) as an ....

G. Papadopoulos, F. Arbab. Coordination Models and Languages. Advances in Computers, Vol 46, pages 329-400, 1998.

....more than fteen years has arisen. For example, JavaSpaces [18] and TSpaces [20] are two recent coordination middlewares for distributed Java programming proposed by Sun and IBM, respectively. These proposals incorporate the main features of both the two historical groups of coordination models [13]: the data driven approach, initiated by Linda [8] and based on the notion of a shared data repository, and the control driven model, advocated by Manifold [1] and centered around the concepts of raising and reaction to events. Besides the typical Linda like Work partially supported by Esprit ....

G.A. Papadopoulos and F. Arbab. Coordination Models and Languages. Advances in Computers, 46:329-400, 1998.

.... to be embodied where they naturally fit in, that is, respectively, into the coordination entities (ACLT agents) and the coordination media (ACLT tuple centres) 1 Introduction The increased complexity of software systems has inspired in the last years a lot of work on coordination architectures [16, 7, 23]. Many of the current researches concentrate on communication mechanisms and abstractions which enable a coordination model to substantially decrease the complexity of the design and management of multi component software systems. Blackboard based coordination models like Linda [14] have shown how ....

....from the coordination entities to the communication abstraction is even stronger in ESP than in ACLT , as ESP reduces the notion of agent to a purely reactive execution thread, providing no support for agent deliberative activity. Many other remarkable control driven coordination models (see [23]) such as ConCoord [18] and MANIFOLD [1] rely on a quite clear separation between coordination and computation, and emphasise the role of the communication abstraction. However, all such models exploit portto port communication, and coordinator components are in charge of both component ....

G.A. Papadopoulos and F. Arbab. Coordination models and languages. Advances in Computers, 46, 1998. To appear.

....Another interesting issue addressed by this paper is the study of the interplay between the classical Linda like coordination paradigm and the event noti cation mechanism. Historically, these two coordination mechanisms have inspired two distinct and separated families of coordination languages [11]. On one side Linda has inspired a big amount of data oriented languages while the event noti cation is the basis of the so called control oriented languages (e.g. Manifold [1] To the best of our knowledge, the present paper represents the rst attempt to give a formal treatment to a ....

G. Papadopoulos and F. Arbab. Coordination Models and Languages. Advances in Computers, 46:329-400, 1998.

.... coordination is achieved either by generative communication via a shared data space (e.g. Linda [GC92] and Gamma [BM93] or by dynamically evolving the interconnections among the processes as a consequence of observations of their state changes (e.g. Manifold [BABRSZ98] A recent survey [PA98] lists at least 30 di#erent coordination languages and models. This amount of di#erent proposals requires also the definition of criteria for their comparison and classification. This paper represents a first step towards the analysis of such this possible criteria. In particular, we compare Gamma ....

G.A. Papadopoulos and F. Arbab. Coordination Models and Languages. Forthcoming.

No context found.

G. A. Papadopoulos and F. Arbab "Coordination Models and Languages", in Advances in Computers, Academic Press, August 1998, Vol. 46: The Engineering of Large Systems.

No context found.

Papadopoulos G. A., Arbab F. (1998); Coordination Models and Languages. in: Advances in Computers --- The Engineering of Large Systems, Zelkowitz (ed.), 329-400, Academic.

....has become a task, which is often impossible to perform by single individuals, requiring groups of people, sometimes distributed over different organisations, countries, etc. Recently, we have seen a proliferation of so called coordination models and their associated programming languages ([2,6,16]) Coordination programming provides a new perspective on constructing computer software. Instead of developing a computer program from scratch, coordination models allow the gluing together of existing components. Coordination, as a science in its own right whose role goes beyond computer ....

....4 we use MANIFOLD to model Electronic Commerce activities, and, finally, in section 5 we present some conclusions, and related and further work. 2. Data vs Control Driven Coordination Models and Languages Over the past few years a number of coordination models and languages have been developed ([2,6,16]) However, the first such model, which still remains the most popular one, is Linda ( 1] In Linda, the underlying view of the system to be coordinated (which is usually distributed and open) is that of an asynchronous ensemble formed by agents where the latter perform their activities ....

[Article contains additional citation context not shown here]

G. A. Papadopoulos and F. Arbab, Coordination Models and Languages, in: Advances in Computers 46, ed. Marvin V. Zelkowitz, Academic Press (August, 1998), pp. 329-400.

....between individual components and their interaction in the overall software organisation. In practice, the concurrent applications of today essentially use a set of ad hoc templates to coordinate the cooperation of active components. This shows the need for proper coordination languages ([2, 24]) or software architecture languages ( 28] that can be used to explicitly describe complex coordination protocols in terms of simple primitives and structuring constructs. Traditionally, coordination models and languages have evolved around the notion of a Shared Dataspace; this is a common area ....

....consumers and vice versa. Certainly though, this scheme contrasts with the Shared Dataspace approach usually advocated by the coordination languages of the data driven family. A more detailed description and comparison of these two main families of coordination models and languages can be found in [24]. In parallel to the development and evolution of the coordination paradigm, the configuration and dynamic reconfiguration paradigm has also evolved considerably. Distributed Information Systems comprise a number of components, both hardware and software (and, in fact, even humans can be viewed ....

[Article contains additional citation context not shown here]

G. A. Papadopoulos and F. Arbab, "Coordination Models and Languages", Advances in Computers, Marvin V. Zelkowitz (ed.), Academic Press, Vol. 46, August, 1998, 329-400.

....between individual components and their interaction in the overall software organization. In practice, the concurrent applications of today essentially use a set of ad hoc templates to coordinate the cooperation of active components. This shows the need for proper coordination languages ([2,15]) or software architecture languages ( 18] that can be used to explicitly describe complex coordination protocols in terms of simple primitives and structuring constructs. Traditionally, coordination models and languages have evolved around the notion of a Shared Dataspace; this is a common area ....

....consumers and vice versa. Certainly though, this scheme contrasts with the Shared Dataspace approach usually advocated by the coordination languages of the data driven family. A more detailed description and comparison of these two main families of coordination models and languages can be found in [15]. It has become clear over the last few years that the above mentioned principles and characteristics are directly related to the needs of other similar abstraction models, notably software architectures and configuration languages such as Conic Durra ( 5] Darwin Regis ( 9] PCL ( 19] ....

G. A. Papadopoulos and F. Arbab, "Coordination Models and Languages", Advances in Computers, Marvin V. Zelkowitz (ed.), Academic Press, Vol. 46, August, 1998, 329-400.

.... environments for parallel and distributed systems have been proposed, ranging from ones providing elementary parallel constructs (such as PVM and MPI) to ones offering higher level logical abstractions such as skeletons, virtual shared memory metaphors (such as Linda) coordination models ([4]) software architectures ( 5] etc. It would be interested to examine the potential of those models in modelling reallife non trivial applications and in the process develop a software engineering methodology for their use. In this paper we present some of the main components of implementing a ....

G. A. Papadopoulos and F. Arbab, `Coordination Models and Languages', Advances in Computers, Marvin V. Zelkowitz (ed), Academic Press, Vol. 46, August, 1998, 329-400.

.... environments 1 Introduction The concept of coordinating a number of activities, possibly created independently from each other, such that they can run concurrently in a parallel and or distributed fashion has received wide attention and a number of coordination models and associated languages ([4]) have been developed for many application areas such as high performance computing or distributed systems. Nevertheless, most of the proposed coordination frameworks are suited for environments where the sub components comprising an application are conventional ones in the sense that they do not ....

....should not be based on the use of specific language formalisms. We attempt to meet the above mentioned targets by extending a state of the art coordination language with real time capabilities. In particular, we concentrate on the so called control or event driven coordination languages ([4]) which we feel they are particularly suited for this purpose, and more to the point the language Manifold ( 1] We show that it is quite natural to extend such a language with primitives enforcing real time coordination and we apply the proposed model to the area of distributed multimedia ....

G. A. Papadopoulos and F. Arbab, "Coordination Models and Languages", Advances in Computers, Marvin V. Zelkowitz (ed.), Academic Press, Vol. 46, August, 1998, 329-400.

No context found.

G. A. Papadopoulos and F. Arbab. Coordination Models and Languages. In The Engineering of Large Systems, volume 46 of Advances in Computers, pages 329--

No context found.

G. A. Papadopoulos and F. Arbab. Coordination Models and Languages. In The Engineering of Large Systems, volume 46 of Advances in Computers, pages 329--

No context found.

G. A. Papadopoulos and F. Arbab. Coordination models and languages. Advances in Computers, 46:329-- 400, 1998.

No context found.

Papadopoulos, G., Arbab, F. Coordination Models and Languages. Advances in Computers. 46 (1998) 329--400.

No context found.

G. Papadopoulos, F. Arbab, Coordination models and languages, Advances in Computers 46.

No context found.

G. A. Papadopoulos and F. Arbab. Coordination Models and Languages. In The Engineering of Large Systems, volume 46 of Advances in Computers, pages 329--

No context found.

G.A. Papadopoulos and F. Arbab. Coordination models and languages. In The Engineering of Large Systems, volume 46 of Advances in Computers. Academic Press, August 1998.

No context found.

G.A. Papadopoulos and F. Arbab. Coordination models and languages. Advances in Computers, 46, 1998.

No context found.

Papadopoulos, G.A. and Arbab, F. 1998. \Coordination Models and Languages", In Advances in Computers, Vol. 46, Academic Press, pp.329-400.

No context found.

G. Papadopoulos and F. Arbab. "Coordination Models and Languages." In M. Zelkowitz, (ed.), Advances in Computers, volume 46, pp. 329--400. Academic Press, New York, NY, Sept. 1998.

No context found.

G.A. Papadopoulos and F. Arbab. Coordination models and languages. In M. Zelkowitz, editor, Advances in Computers -- The Engineering of Large Systems, volume 46, pages 329--400. Academic Press, 1998.

No context found.

G. A. Papadopoulos and F. Arbab. Coordination models and languages. In The Engineering of Large Systems, volume 46 of Advances in Computers. Academic Press, Aug. 1998.

No context found.

G. A. Papadopoulos and F. Arbab. Coordination models and languages. In M. V. Zelkowitz, editor, Advances in Computers: The Engineering of Large Systems, volume 46. Academic Press, The Netherlands, 1998.

No context found.

G. A. Papadopoulos and F. Arbab. Coordination Models and languages. Academic Press, 1998.

No context found.

G.A. Papadopoulos and F. Arbab. Coordination models and languages. In The Engineering of Large Systems, volume 46 of Advances in Computers. Academic Press, August 1998.

No context found.

Papadopoulos, G.A. and Arbab, F. 1998. \Coordination Models and Languages", In Advances in Computers, Vol. 46, Academic Press, pp.329-400.

No context found.

G. Papadopoulos and F. Arbab. Coordination Models and Languages. In Advances in Computers, volume 46. Academic Press, 1998.

No context found.

Papadopoulos, Georg A.; Arbab, Farhad; 1998; "Coordination Models and Languages"; Advances in Computers, No 46, Academic Press

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