Change search
ReferencesLink to record
Permanent link

Direct link
Programming languages for distributed applications
Swedish Institute of Computer Science.ORCID iD: 0000-0002-6718-0144
Département INGI, Univ. Catholique de Louvain.
Swedish Institute of Computer Science.
Ger. Res. Ctr. for Artif. Intell..ORCID iD: 0000-0002-6283-7004
1998 (English)In: New generation computing, ISSN 0288-3635, E-ISSN 1882-7055, Vol. 16, no 3, 223-261 p.Article in journal (Refereed) Published
Abstract [en]

Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications remains difficult because the programmer has to manage models of these areas explicitly. A major challenge is to integrate the four models into a coherent development platform. Such a platform should make it possible to cleanly separate an application's functionality from the other four concerns. Concurrent constraint programming, an evolution of concurrent logic programming, has both the expressiveness and the formal foundation needed to attempt this integration. As a first step, we have designed and built a platform that separates an application's functionality from its distribution structure. We have prototyped several collaborative tools with this platform, including a shared graphic editor whose design is presented in detail. The platform efficiently implements Distributed Oz, which extends the Oz language with constructs to express the distribution structure and with basic primitives for open computing, failure detection and handling, and resource control. Oz appears to the programmer as a concurrent object-oriented language with dataflow synchronization. Oz is based on a higher-order, state-aware, concurrent constraint computation model.

Place, publisher, year, edition, pages
1998. Vol. 16, no 3, 223-261 p.
Keyword [en]
network transparency, fault tolerance, mobile objects, distributed algorithms, Oz
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-24871ISI: 000074486800001OAI: diva2:353685
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
Haridi, SeifVan Roy, PeterBrand, PerSchulte, Christian
In the same journal
New generation computing
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: 29 hits
ReferencesLink to record
Permanent link

Direct link