Files in this item
|(no description provided)|
|Title:||Building reliable programs through active replication|
|Doctoral Committee Chair(s):||Belford, Geneva G.|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||This thesis addresses the issue of ensuring user programs to be executed reliably by making use of the idle resources provided by the workstation environment. In particular, we examine how to replicate user programs so that user programs can continue to work in the face of system failures.
We present a paradigm of replication called replicated transaction. In our system, a user computation is cast as an atomic transaction. A transaction is executed as several concurrent and independent copies. The replicated transaction approach has one serious problem: different transaction replicas might behave differently. This thesis identifies the reasons why transaction replicas behave differently. We present the necessary algorithms for ensuring transaction replicas to behave consistently. The algorithms include a multi-level concurrency control scheme, a token based message ordering protocol and a primary copy scheme. We also provide a formal model with which to prove the correctness of our concurrency control scheme and how our algorithms can ensure transaction replicas to behave consistently. We have written a simulation program to model the replicated transaction system. The simulation program is written in C++ and uses an event-driven simulation package, CSIM.
|Rights Information:||Copyright 1990 Shi, Shaw-Ben|
|Date Available in IDEALS:||2011-05-07|
|Identifier in Online Catalog:||AAI9114411|