Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A fault-tolerant mobile-state protocol and its language interface
Swedish Institute of Computer Science.
Université catholique de Louvain.
Université catholique de Louvain.
Swedish Institute of Computer Science.
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Mobile-state protocols are important for distributed object systems. We define a lightweight mobile-state protocol that has a well-defined behavior for site and network failures. The protocol is implemented as part of the Mozart platform for distributed application development based on the Oz 2 language. The protocol provides enough information to the language layer so that we can use the platform to program common fault-tolerant algorithms completely in Oz 2. We formally define the semantics of the network layer and the language interface, and we prove that the protocol correctly implements the language interface.

National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-24877OAI: oai:DiVA.org:kth-24877DiVA: diva2:353704
Note
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.
Series
Trita-IMIT. LECS, ISSN 1651-4076 ; 05:04
Keyword
Informationsteknik
National Category
Computer and Information Science
Identifiers
urn:nbn:se:kth:diva-232 (URN)
Public defence
2005-06-03, Sal C1, KTH-Electrum, Kista, 13:00
Opponent
Supervisors
Note
QC 20100928Available from: 2005-05-30 Created: 2005-05-30 Last updated: 2010-09-28Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Brand, PerVan Roy, PeterKlintskog, Erik
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf