DocumentCode
2888119
Title
A time-stamp based concurrency control mechanism for redundant computing systems
Author
Saisho, Keizo ; Kambayashi, Yahiko
Author_Institution
Dept. of Comput. Sci. & Commun. Eng., Kyushu Univ., Fukuoka, Japan
fYear
1990
fDate
7-9 Mar 1990
Firstpage
553
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
Keywords
concurrency control; distributed databases; fault tolerant computing; normal operations; redundant computing systems; redundant executing systems; shuffled execution systems; time-stamp based concurrency control mechanism; timestamp ordering techniques; voting operations; Computer science; Concurrency control; Concurrent computing; Database systems; Distributed databases; Fault tolerant systems; Redundancy; Transaction databases; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location
Miami Beach, FL
Print_ISBN
0-8186-2035-8
Type
conf
DOI
10.1109/PARBSE.1990.77219
Filename
77219
Link To Document