Optimal 0/1 vote assignment for replicated data

Her Kun Chang, Shyan-Ming Yuan

研究成果: Conference contribution同行評審

摘要

Data replication is used to improve the availability of data in a distributed system. Weighted voting is a frequently used mechanism for replica control. In this article, 0/1 vote assignment is considered for the purpose of reducing the computing time and the number of copies required. An O(N2) algorithm is presented to find an optimal 0/1 vote assignment and corresponding quorums. Experimental results show that the availability of the optimal 0/1 vote assignment is very close to that of the optimal integer vote assignment. On the other hand, the computing time required by the optimal integer vote assignment is at least 0(2"). Our algorithm is superior in the computing time and preferable for larger systems. Moreover, the number of copies required to be replicated is smaller than other comparable algorithms.

原文English
主出版物標題Proceedings of Phoenix Conference on Computers and Communications, PCCC 1993
發行者Institute of Electrical and Electronics Engineers Inc.
頁面154-160
頁數7
ISBN(電子)0780309227, 9780780309227
DOIs
出版狀態Published - 三月 1993
事件1993 Phoenix Conference on Computers and Communications, PCCC 1993 - Tempe, United States
持續時間: 23 三月 199326 三月 1993

出版系列

名字Proceedings of Phoenix Conference on Computers and Communications, PCCC 1993

Conference

Conference1993 Phoenix Conference on Computers and Communications, PCCC 1993
國家United States
城市Tempe
期間23/03/9326/03/93

指紋 深入研究「Optimal 0/1 vote assignment for replicated data」主題。共同形成了獨特的指紋。

引用此