Please use this identifier to cite or link to this item:
|Title:||Optimal inter-object correlation when replicating for availability|
|Authors:||Yu, H. |
|Citation:||Yu, H.,Gibbons, P.B. (2007). Optimal inter-object correlation when replicating for availability. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing : 254-263. ScholarBank@NUS Repository. https://doi.org/10.1145/1281100.1281137|
|Abstract:||Data replication is a key technique for ensuring data availability. Traditionally, researchers have focused on the availability of individual objects, even though user-level tasks (called operations) typically request multiple objects. Our recent experimental study has shown that the assignment of object replicas to machines results in subtle yet dramatic effects on the availability of these operations, even though the availability of individual objects remains the same. This paper is the first to approach the assignment problem from a theoretical perspective, and obtains a series of results regarding assignments that provide the best and the worst availability for user-level operations. We use a range of techniques to obtain our results, from standard combinatorial techniques and hill climbing methods to Janson's inequality (a strong probabilistic tool). Some of the results demonstrate that even quite simple versions of the assignment problem can have surprising answers. Copyright © 2007 ACM.|
|Source Title:||Proceedings of the Annual ACM Symposium on Principles of Distributed Computing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.