Mobile objects in distributed Oz
1997 (English)In: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, E-ISSN 1558-4593, Vol. 19, no 5, 804-851 p.Article in journal (Refereed) Published
Some of the most difficult questions to answer when designing a distributed application are related to mobility: what information to transfer between sites and when and how to transfer it. Network-transparent distribution, the property that a program's behavior is independent of how it is partitioned among sites, does not directly address these questions. Therefore we propose to extend all language entities with a network behavior that enables efficient distributed programming by giving the programmer a simple and predictable control over network communication patterns. In particular, we show how to give objects an arbitrary mobility behavior that is independent of the object's definition. In this way, the syntax and semantics of objects are the same regardless of whether they are used as stationary servers, mobile agents, or simply as caches, These ideas have been implemented in Distributed Oz, a concurrent object-oriented language that is state aware and has dataflow synchronization. We prove that the implementation of objects in Distributed Oz, is network transparent. To satisfy the predictability condition, the implementation avoids forwarding chains through intermediate sites. The implementation is an extension to the publicly available DFKI Oz 2.0 system.
Place, publisher, year, edition, pages
1997. Vol. 19, no 5, 804-851 p.
latency tolerance, mobile objects, network transparency
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-24872ISI: A1997YH37800005OAI: oai:DiVA.org:kth-24872DiVA: diva2:353688
QC 201009282010-09-282010-09-282010-09-28Bibliographically approved