Title :
Resilient memory-resident data objects
Author :
Paris, Jehan-Francois ; Long, Darrell D E
Author_Institution :
Dept. of Comput. Sci., Houston Univ., TX, USA
Abstract :
The authors investigate the feasibility of replicated data objects consisting of several memory-resident replicas backed-up by a single append-only long maintained on disk. First, it is shown that such objects can be managed by simple variants of the most popular replication control protocols for disk-resident replicated objects. Second, under standard Markovian hypotheses, the availability of replicated objects consisting of memory-resident replicas and a single append-only log on disk are analyzed and shown that they have almost the same availability as replicated objects having all their replicas residing on disk. Using memory-resident replicas has the advantage of faster access over disk-resident replicas. The cost is an increase in recovery time to reconstruct from the log. The authors suggest several improvements that could be made to speed the recovery of the protocols. The analysis demonstrates that memory-resident replicas provide a level of fault-tolerance comparable to disk-resident replicas
Keywords :
Markov processes; distributed databases; fault tolerant computing; protocols; Markovian hypotheses; fault-tolerance; memory-resident replicas; replicated data objects; replication control protocols; resilient memory resident data objects; Access protocols; Availability; Computer science; Costs; Database systems; Delay; File systems; Repeaters; Runtime; Voting;
Conference_Titel :
Computers and Communications, 1991. Conference Proceedings., Tenth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ
Print_ISBN :
0-8186-2133-8
DOI :
10.1109/PCCC.1991.113804