Distributed Coordination with MESSENGERS
نویسندگان
چکیده
Messengers is a paradigm for the programming of distributed systems. It is based on the principles of autonomous messages, called Messengers, which carry their own behavior in the form of a program. This enables them to navigate freely in the underlying computational network, communicate with one another, and invoke compiled node-resident C functions in the nodes they visit. Hence a distributed application is viewed as a collection of C functions whose invocation and interoperation is orchestrated by Messengers. This provides for a clear separation between computations, as expressed by the individual node functions, and coordination, which is the order of function in-vocations and the transport of information among them as prescribed by Messengers. This separation allows each layer to be designed and implemented separately. It also supports the reuse of the coordination structures and the interactive and incremental development and use of distributed applications. The notion of separating concurrent programming into computation and coordination was introduced in CG89]. Coordination includes the synchronization, communication, and creation/destruction of computational activities required to orchestrate individual computations into a coherent system. One approach to coordination utilizes channel-based communication between processes. Processes communicate directly with each other by reading from and writing to ports. Ports of diierent processes are connected to each other via channels. This approach leads to a clean separation of computation and coordination functions. A process performs its own computation by computing values to be written to its output ports from values read from its input ports. The coordination requirements of a process, such as connecting its ports 1
منابع مشابه
Intra - and Inter - Object Coordination withMESSENGERSMunehiro
MESSENGERS is a paradigm for the programming of distributed systems. It is based on the principles of autonomous messages, called Messengers, which carry their own behavior in the form of a program. This enables them to navigate freely in the underlying computational network, communicate with one another, and invoke pre-compiled node-resident functions. Coordination is facilitated at two distin...
متن کاملA Novel Approach to Toxicology Simulation Based on Autonomous Objects
Toxicology simulation is a computationally intensive application which can signi cantly bene t from tools that not only improve performance, but also allow medical specialists to interact with the simulation and each other in ways which are exible and intuitive. MESSENGERS is a new computing and coordination paradigm for distributed systems, based on the concept of autonomous messages that carr...
متن کاملDistributed Semaphore in a Messenger Environment
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...
متن کاملAccess Consistency Memory Model for Messengers 1
The messenger paradigm is an alternative to computer communication based on the exchange of programs called messengers which are afterwards executed, instead of messages that are interpreted. The communication by messenger paradigm can be used to implement both low level software such as communication protocols and high level software such as distributed applications. Using the messenger paradi...
متن کاملOptimal Distributed Generation Planning in Radial Distribution Networks Considering Protection Coordination Limits
Distributed generation (DG) has been widely used in distribution network to reduce the energy losses, improve voltage profile and system reliability, etc. The location and capacity of DG units can influence on probability of protection mal-operation in distribution networks. In this paper, a novel model for DG planning is proposed to find the optimum DG location and sizing in radial distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 31 شماره
صفحات -
تاریخ انتشار 1998