The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—This work presents a new protocol, VELOS, for tolerating partitionings in distributed systems with replicated data. Our primary goals were influenced by efficiency and availability constraints. The proposed protocol achieves optimal availability, according to a well known metric, while ensuring one-copy serializability. In addition, however, VELOS is designed to reduce the cost involved in achieving high availability. We have developed mechanisms through which transactions, in the absence of failures, can access replicated data objects and observe shorter delays than related protocols, and impose smaller loads on the network and the servers. Furthermore, VELOS offers high availability without relying on system transactions that must execute to restore availability when failures and recoveries occur. Such system transactions typically access all (replicas of all) data objects and thus introduce significant delays to user transactions and consume large quantities of resources such as network bandwidth and CPU cycles. Thus, we offer our protocol as a proof that high availability can be achieved inexpensively.</p>
Availability, concurrency control, distributed computing, partitionings, recovery, replication, transactions.
Peter Triantafillou, David J. Taylor, "VELOS: A New Approach for Efficiently Achieving High Availability in Partitioned Distributed Systems", IEEE Transactions on Knowledge & Data Engineering, vol. 8, no. , pp. 305-321, April 1996, doi:10.1109/69.494168
89 ms
(Ver 3.3 (11022016))