J.-M. Andreoli, C. Hankin, and D. Le M'etayer, editors. Coordination programming: mechanisms, models and semantics. IC Press, London, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....integration First we will briefly sketch work in the field of coordination languages and tool integration and relate it to the ToolBus approach. For a discussion of the design issues in coordination languages we refer to [GC92] For recent collections of research papers on this topic we refer to [AHM96, CH96] A survey of interdisciplinary aspects of coordination can be found in [MC94] 2.1 Data integration In its full generality, the data integration problem amounts to exchanging (complicated) data values among tools that have been implemented in different programming languages. The common ....

....and should be treated independently; b) flexibility through uncoupling of components. Various Linda implementations are available that extend existing programming languages with Linda s tuple operations. A related language is Gamma [BM90] it is based on multi set transformations. We refer to [AHM96, CH96] for various papers related to the use of Linda and Gamma for coordination. We see as a general disadvantage of these two particular approaches that the problem to be solved has to be moulded to fit the given data structure (tuple multi set) of the underlying coordination language. In our ....

J.-M. Andreoli, C. Hankin, and D. Le M'etayer, editors. Coordination Programming: Mechanisms, Models and Semantics. Imperial College Press, 1996.

....languages, where by coordination we also mean configuration or architectural description . However, we will not cover those cases where ordinary languages are used for coordination, such as the framework described in [57] Other collections of work on coordination models and languages are [4, 28, 29], and [27] is a survey article where the focus is on the first family of models and languages according to the classification presented below. 3. Coordination Models and Languages 3.1 Data vs. Control Driven Coordination The purpose of this (third) main section of the chapter is to present the ....

J-M. Andreoli, C. Hankin and D. Le M etayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....fandrea, giangi, ugog di.unipi.it. Proposal for the 1999 Evaluation Exercise, May 1999. 1 information and dynamic type checking as a foundation of its security: well typed Java programs (and the corresponding veri ed bytecode) will never compromise the integrity of certain data. Coordination [5, 2] is a key concept for modeling and designing heterogeneous, distributed, open ended systems. It applies typically to systems consisting of a large number of software components, independently programmed in di erent programming languages, which may change their con guration during execution. ....

J. Andreoli, C. Hankin, D. Le Metayer (Eds), Coordination Programming: Mechanisms, Models and Semantics, Imperial College Press, 1996.

....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 ....

J-M. Andreoli, C. Hankin and D. Le Mtayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....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 ....

....area accessible to a number of processes cooperating together towards the achievement of a certain goal, for exchanging data. The first language to introduce such a notion in the Coordination community was Linda with its Tuple Space ( 1] and many related models evolved around similar notions ([2]) We call these models data driven, in the sense that the involved processes can actually examine the nature of the exchanged data and act accordingly. However, many applications are by nature event driven (rather than data driven) where software components interact with each other by posting ....

J. - M. Andreoli, C. Hankin and D. Le Mtayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....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 ....

....area accessible to a number of processes cooperating together towards the achievement of a certain goal, for exchanging data. The first language to introduce such a notion in the Coordination community was Linda with its Tuple Space ( 1] and many related models evolved around similar notions ([2]) We call these models data driven, in the sense that the involved processes can actually examine the nature of the exchanged data and act accordingly. However, many applications are by nature event driven (rather than data driven) where software components interact with each other by posting ....

J. - M. Andreoli, C. Hankin and D. Le Mtayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....to express arbitrary autonomous objects behaviors, and a runtime system of interpreters. Both WAVE and BPEM had a major influence on the Messengers system, presented in this paper, which uses some of their basic navigational principles. A third area of related research are coordination paradigms [AHM96, CE96] which provide the synchronization, communication, and creation destruction of computational activities required to orchestrate the individual computations into a coherent system. Examples of coordination paradigms include Gamma [BL93] Linda [CG89] and the IWIM model [Arb96] Messengers ....

J.-M. Andreoli, C. Hankin, and D. Le M'etayer, editors. Coordination Programming: Mechanisms, Models, and Semantics. Imperial College Press, London, UK, 1996.

....Also, the need to automatically create or modify algorithms argues for simple, but powerful reasoning tools, especially equational reasoning. This emphasis underpins work on parallel functional languages, such as a co ordination 1 language for existing sequential code [DGHY95, ADG 96, AHLM96] or as algorithmic skeletons [Col89, Ski94, Pel97] The corresponding research program may be described as follows: ffl identify the primitive skeletons from which programs are to be built; ffl produce an equational calculus for their composites that supports program refinement; ffl produce a ....

J.-M Andreoli, C. Hankin, and D. Le Metayer, editors. Coordination Programming : Mechanisms, Models and Semantics. Harvill Pr, 1996.

....bindings. Consequently various coordination languages based on logic [FT89b] FT94] functional [Col89] D 93] Sch96b] and object oriented models [CCR96] have been developed. Also the Gamma model based on the simulation of chemical reactions has been extensively studied for this purpose [AHLM96] Cia96a] provides an overview over A TECHNOLOGIES FOR DISTRIBUTED SYSTEMS 40 coordination models and languages; Cia96b] contains bibliography on this topic. Adl95] investigates the more technical oriented site of coordination models for client server applications. Unfortunately there is no ....

J.-M. Andreoli, C. Hankin, and D. Le Metayer, editors. Coordination Programming: Mechanisms, Models and Semantics. Imperial College Press, London, UK, August 1996.

....Messengers are able to use and share files. These design decision are in line with the Messengers intended application area, which is not the Internet but rather high performance general purpose computing on clusters of computers. A third area of related research are coordination paradigms [AHM96, CE96] which provide the synchronization, communication, and creation destruction of computational activities required to orchestrate the individual computations into a coherent system. Examples of coordination paradigms include Gamma [BL93] Linda [CG89] and the IWIM model [Arb96] Messengers ....

J.-M. Andreoli, C. Hankin, and D. Le M'etayer, editors. Coordination Programming: Mechanisms, Models, and Semantics. Imperial College Press, London, UK, 1996.

....executing algorithms within processes. The study of coordination independently of computation is becoming an important area of research that has spawned several conferences and workshops over the past few years [CNY, CH] Recent work on coordination models and their applications may be found in [AHM]. Linda processes interact through a shared data space called the tuple space . Processes cannot interact directly: they post output to the tuple space which may then by used as input by other processes (see Figure 11) Because the tuple space is like a blackboard on which public notices may be ....

J. Andreoli, C. Hankin, and D. Le Metayer, Coordination Programming: Mechanisms, Models, and Semantics, 1996.

....limitation and without interruption of offered services. An important issue in open system design concerns coordinating active entities [1, 5] A powerful approach to describe and control coordination and interaction among active entities is founded on the notion of generative communication [17, 2]. Generative communication is based on the notion of shared dataspace or tuple space, in which entities can be generated and later retrieved. These entities can be either passive or active: actually a dataspace can be seen as a chemical solution implicitly computing by multiset rewriting [3, 4] ....

J. Andreoli, C. Hankin, and D. LeMetayer, editors. Coordination Programming: Mechanisms, Models and Semantics. Imperial College Press, 1996.

....languages, where by coordination we also mean configuration or architectural description . However, we will not cover those cases where ordinary languages are used for coordination, such as the framework described in [57] Other collections of work on coordination models and languages are [4,28,29], and [27] is a survey article where the focus is on the first family of models and languages according to the classification presented below. 3. Coordination Models and Languages 3.1 Data vs. Control Driven Coordination The purpose of this (third) main section of the chapter is to present the ....

J-M. Andreoli, C. Hankin and D. Le Métayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....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,15]) 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,15]) 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 ....

J-M. Andreoli, C. Hankin and D. Le Métayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....these activities has become a task which often is not possible to perform by single persons, but by groups of people, often even distributed over different organisations, countries, etc. Recently, we have seen a proliferation of so called coordination models and associated programming languages ([2,8]) Coordination programming provides a new perspective on constructing computer programs. Instead of developing a computer program from scratch, the coordination model allows the gluing together of existing components. Whereas in ordinary programming languages a programmer describes individual ....

....and further work. 2 COORDINATION MODELS AND LANGUAGES IN THE MODELLING OF INFORMATION SYSTEMS Over the past few years a number of coordination models and languages have been developed such as Linear Objects (LO) TAO, Gamma and the Chemical Abstract Machine (see, for instance, the collection [2]) 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 ....

J-M. Andreoli, C. Hankin and D. Le Métayer, Coordination Programming: Mechanisms, Models and Semantics, World Scientific, 1996.

....of Computing Final Draft 5 25 power to lazy binding of subclasses to parent classes. Mobile processes support lazy binding to resources as they become dynamically available. O7 (lazy binding) Lazy interactive binding facilitates flexibility in interpreters, inheritance, mobility. Coordination [AHM] is the study of models, languages, and architectures that provide the glue for managing interactive behavior [Ci] Glue is modeled as an active substance that captures properties of protocols, channels, pipelines, blackboards, and other architectural primitives of coordination media [We5] O8 ....

J. Andreoli, C. Hankin, and D. Le Metayer, Coordination Programming: Mechanisms, Models, and Semantics, 1996.

....to express arbitrary autonomous objects behaviors, and a runtime system of interpreters. Both WAVE and BPEM had a major influence on the Messengers system, presented in this paper, which uses some of their basic navigational principles. A third area of related research is coordination paradigms [1, 10], which provide the synchronization, communication, and creation destruction of computational activities required to orchestrate the individual computations into a coherent system. Examples of coordination paradigms include Gamma [4] Linda [8] and the IWIM model [3] Messengers is similar in ....

J.-M. Andreoli, C. Hankin, and D. Le M'etayer (Eds). Coordination Programming: Mechanisms, Models, and Semantics. Imperial College Press, London, UK, 1996.

....possible to restrict the access rights of different components to the tuple space. 1 Introduction Coordination mechanisms play an important role in computer science, and have become a popular research topic. For a good overview of the work in this area consult the book on coordination programming [1] or the proceedings of the Coordination (Languages and Models) conference [9] Several examples of action based coordination languages have been presented in the literature. The shared data space language Swarm [10] is based on UNITY [5] There are, however, some differences: a Swarm program is ....

J.-M. Andreoli, C. Hankin, and D. Le M'etayer, editors. Coordination Programming: mechanisms, models and semantics. Imperial College Press, 1996.

....significantly faster [FIS] Current work focuses on designing a purely functional, data parallel version of FISh called GoldFISh in which the BMF operations and array distributions become primitives subject to parallelisation. Ultimately, the two languages will combine as a co ordination language [ACLM96] with GoldFISh primitive used to control parallelism, and then converted to FISh code for execution on individual processors. One of the main goals in designing GoldFISh is to show how shape analysis can be used to automate cost analysis. The cost analysis should be modular, and easily adjusted ....

J.-M Andreoli, Hankin C., and D. Le Metayer, editors. Coordination Programming : Mechanisms, Models and Semantics. Harvill Pr, 1996.

.... programs in the fields of: simulation of Fluid Dynamics systems, matching of DNA strings, molecular synthesis, parallel and distributed simulation, monitoring of medical data, computer graphics, analysis of financial data integrated into decision support systems, and game playing (chess) See [AHL96, CH96, GL97] for some concrete examples. Gelernter and Carriero coined the term Coordination in the following slogan [CG92] Programming = Computation Coordination The authors formulated this equation discussing the coordination language Linda (see below) The intent is that there should be a ....

....here they have much in common with object based approaches. In order to operate in an open system, entities must be encapsulated (their implementation details should be hidden from other entities) and they should persist beyond a single transaction (some authors describe such entities as reactive [AHL96] In the past such considerations have led to the development of object based modeling techniques; the design of coordination languages should also address these issues. ffl The natural description of the activities and the history of the computation carried out in a certain class of ....

[Article contains additional citation context not shown here]

JM. Andreoli, C. Hankin, and D. LeMetayer, editors. Coordination Programming: Mechanisms, Models and Semantics. Imperial College Press, 1996.

No context found.

J.-M. Andreoli, C. Hankin, and D. Le M'etayer, editors. Coordination programming: mechanisms, models and semantics. IC Press, London, 1996.

No context found.

J.-M. Andreoli, C. Hankin and D. Le M'etayer, eds., Coordination Programming: Mechanisms, Models, Semantics (Imperial College Press, London, 1996).

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