ویراساینس.
سند علمی

Combining Timed Coordination Primitives and Probabilistic Tuple Spaces

Mario Bravetti, Diego Latella, Michele Loreti, Mieke Massink, Gianluigi Zavattaro

چکیده

In this paper we present an integration of PLinda, a probabilistic extension of Linda, and StoKlaim, a stochastic extension of KLAIM. In the resulting language, StoPKlaim, the execution time of coordination primitives is modeled by means of exponentially distributed random variables, as in StoKlaim, the choice of the primitive to be executed among conflicting ones is thus resolved by the race condition principle, and the choice of the tuple to be retrieved by a single input/read operation in case of multiple matching tuples is governed by the weightbased probabilistic access policy of PLinda. The language represents a natural development and integration of previous results of the SENSORIA Project in the area of probabilistic and time-stochastic extensions of Tuple Space based coordination languages. The formal operational semantics of StoPKlaim is presented and an example of modeling is provided.

اسناد مشابه

  • Addendum to “Optimising the Linda in primitive: Understanding tuple-space run-times" presented at SAC’2000

    سند علمی۲۰۰۷Antony Rowstron

    Let us assume that these two agents are accessing the same tuple space, and that no other agents are able to access the tuple space, and that the tuple space contains two tuples, a and b. The case graph for these agents is shown in Figure 1. As can be seen, there is no case where

  • Bonita: A set of tuple space primitives for distributed coordination

    سند علمی۱۹۹۷HICSSAntony I. T. Rowstron, Alan Wood

    In the last few years the use of distributed structured shared memory paradigms for coordination between parallel processes has become common. One of the most well known implementations of this paradigm is the shared tuple space model (as used in Linda). In this paper we describe

  • Tuple Space Coordination Across Space & Time

    سند علمی۲۰۰۶Chenyang Lu, Gruia-Catalin Roman, Radu Handorean, Rohan Sen

    CAST is a coordination model designed to support interactions among agents executing on hosts that make up a mobile ad hoc network (MANET). From an application programmer’s point of view, CAST makes it possible for operations to be executed at arbitrary locations in space, at pre

  • Using Asynchronous Tuple-Space Access Primitives (BONITA Primitives) for Process Co-ordination

    سند علمی۱۹۹۷COORDINATIONAntony I. T. Rowstron

    In this paper an interactive talk program is used to demonstrate the diierence between the Linda primitives and the recently proposed Bonita primitives. Both use the concept of shared tuple spaces for inter-agent communication, but the Bonita primitives provide asyn-chronous tupl

  • Semantic Tuple Space Coordination for the Semantic Web with Applications in Life Science

    سند علمی۲۰۰۷Peishen Qi

    Semantic Tuple Space Coordination for the Semantic Web with Applications in Life Science Peishen Qi 2007 The primary goal of the Semantic Web is to provide a web of data that are accessible and processable by machines. Different communities have started to publish their resources

  • Biochemical Tuple Spaces for Self-organising Coordination

    سند علمی۲۰۰۹COORDINATIONMirko Viroli, Matteo Casadei

    Inspired by recent works in computational systems biology and existing literature proposing nature-inspired approaches for the coordination of today complex distributed systems, this paper proposes a mechanism to leverage exact computational modelling of chemical reactions for ac