<div class="csl-bib-body">
<div class="csl-entry">Widder, J. (2004). <i>Distributed computing in the presence of bounded asynchrony</i> [Dissertation, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-13246</div>
</div>
This thesis investigates various aspects of the [Theta]-Model.<br />The [Theta]-Model is a time free model of distributed systems which assumes that end-to-end delays of the fastest and slowest messages over the network are correlated. This relation is expressed by giving an upper bound [Theta] on the ratio of longest and shortest transmission times of messages which are simultaneously in transit.<br />The model was introduced by Le Lann and Schmid, who showed that the [Theta]-Model is sufficiently strong to solve the fundamental yet not trivial problem of consensus. Their innovative results left room for improvement in the definition of the [Theta]-Model and raised some questions, including the amount of synchrony in the model and related to it what kind of problems have solution in it.<br />The first part of this thesis is dedicated to a refinement of the original definition of the [Theta]-Model. The second major part introduces several algorithms and analyzes their behavior when executed in the [Theta]-Model. The basic algorithm is a clock synchronization algorithm whereupon several other algorithms - e.g.<br />implementation of the perfect failure detector and atomic commitment - are devised. The third part considers booting. The problem of system startup is often neglected in distributed computing theory. This is due to the fact that when real systems are considered, timed semantics are usually employed, which allow several simplifications of the booting problem. Since we consider a time free model, the problem of booting clock synchronization is particularly difficult because classic failure assumption cannot be employed properly in the booting phase.
de
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
Verteilter Algorithmus
de
dc.subject
Verteiltes System
de
dc.subject
Echtzeitsystem
de
dc.subject
Asynchronbetrieb
de
dc.title
Distributed computing in the presence of bounded asynchrony
en
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Josef Widder
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
dc.contributor.assistant
Schmid, Ulrich
-
tuw.publication.orgunit
E182 - Institut für Technische Informatik (Echtzeitsysteme, VLSI-Design)
-
dc.type.qualificationlevel
Doctoral
-
dc.identifier.libraryid
AC04223172
-
dc.description.numberOfPages
104
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:1-13246
-
dc.thesistype
Dissertation
de
dc.thesistype
Dissertation
en
tuw.author.orcid
0000-0003-2795-611X
-
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
exstaff
-
tuw.assistant.staffStatus
staff
-
tuw.assistant.orcid
0000-0001-9831-8583
-
item.openaccessfulltext
Open Access
-
item.openairecristype
http://purl.org/coar/resource_type/c_db06
-
item.grantfulltext
open
-
item.mimetype
application/pdf
-
item.languageiso639-1
en
-
item.openairetype
doctoral thesis
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E191-02 - Forschungsbereich Embedded Computing Systems