Distributed Semaphore in a Messenger Environment

نویسندگان

  • Murhimanya Muhugusa
  • Giovanna Di Marzo
  • Christian Tschudin
  • Jürgen Harms
چکیده

The messenger paradigm advocates the exchange of programs called messengers between communicating hosts instead of messages. Each host contains a messenger execution environment called messenger platform. Messengers are expressed in a language understood by all the platforms. A distributed messenger environment is a collection of messenger platforms linked through an unreliable network offering only a datagram service. Provision of coordination services in such an environment has to be handled in a new way since threads of controls are mobile (messengers move from host to host). The classical client/server paradigm based on a data exchange mechanism is not suitable for a messenger environment. In this paper we discuss how communication services might be provided in messenger environments using as an example the distributed semaphore service in the MØ distributed messenger environment. A distributed semaphore allows messengers executing on different hosts to synchronize their execution independently of their physical location.

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

ثبت نام

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

منابع مشابه

Blocking Optimality in Distributed Real-Time Locking Protocols

Lower and upper bounds on maximum priority inversion blocking (pi-blocking) are established under distributed multiprocessor real-time semaphore protocols (where resources may be accessed only from specific synchronization processors). Prior work on shared-memory multiprocessor semaphore protocols (which require resources to be accessible from potentially any processor) has established bounds o...

متن کامل

Synchronous Message Passing and Semaphores: An Equivalence Proof

A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implement wait control. The proof uses a most general scheduler, which is left as abstract and assumed to satisfy a few realistic, explicitly stated assumptions. We hope to provide a scheme that can be implemented by current...

متن کامل

Proving Properties of Real-Time Semaphores

Much work has been undertaken on investigating the use of semaphore primitives in concurrent programming languages. It has been shown that semaphores are adequate for expressing many forms of concurrency control, including the enforcement of communication protocols, and mutual exclusion protocols on shared resources. In this paper we present a formal language for real-time distributed programs ...

متن کامل

Increasing Efficiency of an Intelligent Semaphore by Implementing an ID3 Approach in Decision-Making

The main objective of a semaphore is to provide a correct and fluent vehicular mobility. Many countries around the world are using such devices in urban areas. However, the traditional semaphore operative ways are outdated. We report in a previous contribution the development of a methodology capable of improving the vehicular mobility by proposing a new green light interval based on road condi...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1995