An Optimal Voting Scheme for Minimizing
An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management
โ
Xuemin Lin; Maria E. Orlowska
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 248 KB
add sites one by one to S r i (S w i ) until the sum of votes in S r i (S w i ) not less than Q r (Q w ). โข Each read (write) operation should obtain permission from each site in S r i (S w i ). If a two-phase locking mechanism is applied, a basic QC method will force, through the intersection inv