Space reclamation for uncoordinated checkpointing in message-passing systems
Wang, Yi-Min
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/19520
Description
Title
Space reclamation for uncoordinated checkpointing in message-passing systems
Author(s)
Wang, Yi-Min
Issue Date
1993
Doctoral Committee Chair(s)
Fuchs, W. Kent
Department of Study
Electrical and Computer Engineering
Discipline
Electrical Engineering
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Engineering, Electronics and Electrical
Computer Science
Language
eng
Abstract
Checkpointing and rollback recovery are techniques that can provide efficient recovery from transient process failures. In a message-passing system, the rollback of a message sender may cause the rollback of the corresponding receiver, and the system needs to roll back to a consistent set of checkpoints called the recovery line. If the processes are allowed to take uncoordinated checkpoints, the above rollback propagation may result in the domino effect which prevents recovery line progression. Traditionally, only obsolete checkpoints before the global recovery line can be discarded, and the necessary and sufficient condition for identifying all garbage checkpoints has remained an open problem.
In this thesis, we derive a necessary and sufficient condition for achieving optimal garbage collection, and we prove that the number of useful checkpoints is in fact bounded by N(N + 1)/2 where N is the number of processes. Our approach is based on the maximum-sized antichain model of consistent global checkpoints and the technique of recovery line transformation and decomposition. We also show that, for systems requiring message logging to record in-transit messages, the same approach can be used to achieve optimal message log reclamation. As a final topic, we describe a unifying framework by considering checkpoint coordination and exploiting piecewise determinism as mechanisms for bounding rollback propagation, and demonstrate the applicability of the optimal garbage collection algorithm to domino-free recovery protocols.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
