Treffer: Analysis of snapshot algorithms by time approximation.

Title:
Analysis of snapshot algorithms by time approximation.
Contributors:
Law, Chi Hung., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering.
Publication Year:
2004
Collection:
The Chinese University of Hong Kong: CUHK Digital Repository / 香港中文大學數碼典藏
Subject Terms:
Electronic data processing--Distributed processing, Computer algorithms, Approximation theory
Document Type:
Fachzeitschrift text
File Description:
print; x, 91 leaves : ill.; 30 cm.
Language:
English
Chinese
Relation:
cuhk:324863; http://library.cuhk.edu.hk/record=b5891918
Availability:
http://library.cuhk.edu.hk/record=b5891918
https://repository.lib.cuhk.edu.hk/en/item/cuhk-324863
Rights:
Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Accession Number:
edsbas.686C56AC
Database:
BASE

Weitere Informationen

Law Chi Hung. ; Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. ; Includes bibliographical references (leaves 86-91). ; Abstracts in English and Chinese. ; Abstract --- p.i ; Acknowledgement --- p.iv ; Contents --- p.v ; List of Figures --- p.viii ; List of Tables --- p.x ; Chapter 1 --- Introduction --- p.1 ; Chapter 1.1 --- Motivation --- p.4 ; Chapter 1.2 --- Thesis Organization --- p.7 ; Chapter 2 --- Literature Review --- p.9 ; Chapter 2.1 --- Logical Time --- p.9 ; Chapter 2.1.1 --- Event Model --- p.9 ; Chapter 2.1.2 --- Lamport's Logical Clock --- p.10 ; Chapter 2.1.3 --- Mattern's Vector Time --- p.14 ; Chapter 2.2 --- Snapshot Algorithms --- p.18 ; Chapter 2.2.1 --- Preliminaries --- p.19 ; Chapter 2.2.2 --- Chandy-Lamport --- p.22 ; Chapter 2.2.3 --- Lai-Yang and Mattern --- p.24 ; Chapter 2.2.4 --- Sato --- p.25 ; Chapter 3 --- Ad-hoc Network System --- p.29 ; Chapter 3.1 --- Event Model --- p.30 ; Chapter 3.2 --- Snapshot Problem --- p.32 ; Chapter 4 --- Time Approximation in Distributed Systems --- p.37 ; Chapter 4.1 --- Definitions --- p.38 ; Chapter 4.1.1 --- Preliminary --- p.38 ; Chapter 4.1.2 --- Event Ordering --- p.39 ; Chapter 4.1.3 --- Clock --- p.40 ; Chapter 4.1.4 --- Time Approximation Levels --- p.41 ; Chapter 4.1.5 --- Offline Algorithm --- p.41 ; Chapter 4.2 --- Time Approximation in Static Network Systems --- p.42 ; Chapter 4.2.1 --- Stable Snapshot --- p.43 ; Chapter 4.2.2 --- Snapshot --- p.50 ; Chapter 4.2.3 --- Latest Snapshot --- p.52 ; Chapter 4.2.4 --- Time Approximation Levels --- p.54 ; Chapter 4.3 --- Time Approximation in Ad-hoc Network Systems --- p.54 ; Chapter 4.3.1 --- Snapshot --- p.56 ; Chapter 4.3.2 --- Latest Snapshot --- p.61 ; Chapter 4.3.3 --- Time Approximation Levels --- p.61 ; Chapter 4.3.4 --- Bi-vector Clock --- p.63 ; Chapter 4.3.5 --- Strong Snapshot Problem --- p.67 ; Chapter 5 --- Snapshot Algorithm for Ad-hoc Network Systems --- p.69 ; Chapter 5.1 --- Algorithm --- p.70 ; Chapter 5.1.1 --- Notations --- p.70 ; Chapter 5.1.2 --- Rules of ...