Availability of multi-object operations

被引：0

作者：

Yu, Haifeng ^{[1
,2
]}

Gibbons, Phillip B. ^{[1
]}

Nath, Suman ^{[1
,2
,3
]}

机构：

[1] Intel Res Pittsburgh, Pittsburgh, PA 15213 USA

[2] CMU, Pittsburgh, PA USA

[3] Microsoft Res, Bengaluru, India

来源：

USENIX ASSOCIATION PROCEEDINGS OF THE 3RD SYMPOSIUM ON NETWORKED SYSTEMS DESIGN & IMPLEMENTATION (NSDI 06) | 2006年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Highly-available distributed storage systems are commonly designed to optimize the availability of individual data objects, despite the fact that user level tasks typically request multiple objects. In this paper, we show that the assignment of object replicas (or fragments, in the case of erasure coding) to machines plays a dramatic role in the availability of such multi-object operations, without affecting the availability of individual objects. For example, for the TPCH benchmark under real-world failures, we observe differences of up to four nines between popular assignments used in existing systems. Experiments using our wide-area storage system prototype, MOAT, on the PlanetLab, as well as extensive simulations, show which assignments lead to the highest availability for a given setting.

引用

页码：211 / +

页数：3