Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Computer simulation using particles
Computer simulation using particles
Paradigms for process interaction in distributed programs
ACM Computing Surveys (CSUR)
Distributed coordination with MESSENGERS
Science of Computer Programming
Messages versus messengers in distributed programming
Journal of Parallel and Distributed Computing
Automatic State Capture of Self-Migrating Computations in MESSENGERS
MA '98 Proceedings of the Second International Workshop on Mobile Agents
Performance of the MESSENGERS Autonomous-Objects-Based System
WWCA '97 Proceedings of the International Conference on Worldwide Computing and Its Applications
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Distributed computing using autonomous objects
FTDCS '95 Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems
ACM SIGSOFT Software Engineering Notes
Metacomputing with mobile agents
International Journal of Parallel Programming
Mobile agents, DSM, coordination, and self-migrating threads: a Common Framework
DNCOCO'08 Proceedings of the 7th conference on Data networks, communications, computers
ODDUGI: Ubiquitous Mobile Agent System
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Information Sciences: an International Journal
Hi-index | 0.00 |
Messengers are agents, each capable of navigating through the underlying network and performing various tasks at each node. Their use facilitates a programming paradigm shift allowing applications to be written not as collections of communicating processes but from the point of view of each Messenger as it navigates through the system. Using several different applications, we demonstrate the MESSENGERS programming style and its implications for distributed programming. The advantages of programming in MESSENGERS include the ability to compute in unknown network topologies, the ability to modify or extend the applications' functional capabilities at runtime, and the ability to dynamically exploit computational resources. Furthermore, MESSENGERS programs result in a smaller semantic gap between the abstract algorithms and their implementations, which makes program construction a more intuitive process.