A time-stamp based concurrency control mechanism for redundant computing systems

Abstract

The use of shuffled execution systems to construct redundant executing systems is considered. The following two problems connected with the implementation of this method are discussed: (1) how to combine normal operations and voting operations and how to return to the normal situation when voting operations fail; and (2) how to apply timestamp ordering techniques to the system model.<>