Peter Bailis :: Highly Available, Seldom Consistent Data management, distributed systems, and beyond Doing Redundant Work to Speed Up Distributed Queries 20 Sep 2012 tl;dr: In distributed data stores, redundant operations can dramatically drop tail latency at the expense of increased system load; different Dynamo-style stores handle this trade-off differently, and there’s room for improvement. Upd
Talk given at Berkeley AMPLab Cloud Seminar, March 26, 2012 (2012) Today’s large-scale web services provide rapid responses to interactive requests by applying large amounts of computational resources to massive datasets. They typically operate in warehouse-sized datacenters and run on clusters of machines that are shared across many kinds of interactive and batch jobs. As these systems distribute
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く