Change search
ReferencesLink to record
Permanent link

Direct link
Mobile objects in distributed Oz
Dept. of Comp. Sci. and Engineering, Univ. Catholique de Louvain.
Swedish Institute of Computer Science.ORCID iD: 0000-0002-6718-0144
Swedish Institute of Computer Science.
Ger. Res. Ctr. for Artif. Intell..
Show others and affiliations
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
Abstract [en]

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.
Keyword [en]
latency tolerance, mobile objects, network transparency
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-24872ISI: A1997YH37800005OAI: diva2:353688
QC 20100928Available from: 2010-09-28 Created: 2010-09-28 Last updated: 2010-09-28Bibliographically approved
In thesis
1. The design philosophy of distributed programming systems: the Mozart experience
Open this publication in new window or tab >>The design philosophy of distributed programming systems: the Mozart experience
2005 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Distributed programming is usually considered both difficult and inherently different from concurrent centralized programming. It is thought that the distributed programming systems that we ultimately deploy, in the future, when we've worked out all the details, will require a very different programming model and will even need to be evaluated by new criteria.

The Mozart Programming System, described in this thesis, demonstrates that this need not be the case. It is shown that, with a good system design, distributed programming can be seen as an extended form of concurrent programming. This is from the programmer's point-of-view; under the hood the design and implementation will necessarily be more complex. We relate the Mozart system with the classical transparencies of distributed systems. We show that some of these are inherently on the application level, while as Mozart demonstrates, others can and should be dealt with on the language/system level.

The extensions to the programming model, given the right concurrent programming base, are mainly concerned with non-functional properties of programs. The models and tuning facilities for failure and performance need to take latency, bandwidth, and partial failure into account. Other than that there need not be any difference between concurrent programming and distributed programming.

The Mozart Programming System is based on the concurrent programming language Oz, which integrates, in a coherent way, all three known concurrency or thread-interaction models. These are message-passing (like Erlang), shared objects (like Java with threads) and shared data-flow variables. The Mozart design philosophy is thus applicable over the entire range of concurrent programming languages/systems. We have extracted from the experience with Mozart a number of principles and properties that are applicable to the design and implementation of all (general-purpose) distributed programming systems.

The full range of the design and implementation issues behind Mozart are presented. This includes a description of the consistency protocols that make transparency possible for the full language, including distributed objects and distributed data-flow variables.

Mozart is extensively compared with other approaches to distributed programming, in general, and to other language-based distributed programming systems, in particular

Place, publisher, year, edition, pages
Stockholm: KTH, 2005. 347 p.
Trita-IMIT. LECS, ISSN 1651-4076 ; 05:04
National Category
Computer and Information Science
urn:nbn:se:kth:diva-232 (URN)
Public defence
2005-06-03, Sal C1, KTH-Electrum, Kista, 13:00
QC 20100928Available from: 2005-05-30 Created: 2005-05-30 Last updated: 2010-09-28Bibliographically approved

Open Access in DiVA

No full text

Other links


Search in DiVA

By author/editor
Van Roy, PeterHaridi, SeifBrand, Per
In the same journal
ACM Transactions on Programming Languages and Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 43 hits
ReferencesLink to record
Permanent link

Direct link