Asynchronous Rendez-vous in Distributed Logic Programming

نویسندگان

  • Anton Eliëns
  • Erik P. de Vink
چکیده

In this paper the semantics of the communication mechanism of the distributed logic programming language DLP is studied. DLP combines logic programming with object oriented features and parallelism. For an abstract subset of DLP both an operational and denotational semantics is given. The language DLP supports active objects, method call by rendezvous and moreover (distributed) backtracking over the results of such a rendezvous. To enable further exploitation of parallelism, the rendezvous provided is asynchronous. A distinction is made between the creation of a process for evaluating the method call on the one hand, and the request for an answer on the other hand. To model this communication mechanism (syntactic) resumptions are employed. The notion of a resumption explains the backtracking taking place in the asynchronous rendezvous. In addition, resumptions facilitate the systematic comparison of the operational and denotational semantics presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling Remote Concurrency with Ada. Case Study of Symmetric Non-deterministic Rendez-vous. Modelling Remote Concurrency with Ada. Case Study of Symmetric Non-deterministic Rendez-vous

When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide platform-independent abstractions but, as the platform concurrency behaviour cannot be ignored, this abstraction level must also be able to cope with it and exhibit the influence of different possible behaviours. We st...

متن کامل

Resurrecting Ada's Rendez-Vous in Java

Java is a programming language designed with concurrency in mind from its inception. However, the synchronization mechanism provided is a restricted version of Hoare’s Monitors, being too low level for most applications. In this paper we propose a high level synchronization mechanism for Java, based on Ada’s Rendez-Vous, adapting the notation and semantics to Java. The result is a nice and read...

متن کامل

Adaptation of Asynchronously Communicating Software

Software adaptation techniques aim at generating new components called adapters, which make a set of services work correctly together by compensating for existing mismatch. Most approaches assume that services interact synchronously using rendez-vous communication. In this paper, we focus on asynchronous communication, where services interact exchanging messages via buffers. We overview a metho...

متن کامل

On the Models for Asynchronous Circuit Behaviour with OR Causality

Asynchronous circuits behave like concurrent programs implemented in hardware logic. The processes in such circuits are synchronised in accordance with the dynamic logical and causal conditions between switching events. The classical paradigm, easily represented in most process-oriented languages for concurrent systems modelling, is AND causality, which is often associated with a rendez-vous sy...

متن کامل

A Eulerian approach to the analysis of rendez-vous algorithms

In this paper we analyze rendez-vous algorithms in the situation when agents can only exchange information below a given distance threshold R. We study the system under an Eulerian point of view considering (possibly continuous) probability distributions of agents and we present convergence results both in discrete and in continuous time. The limit distribution is always necessarily a convex co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992