A lazy directory-based implementation of consistent replicated storage

Recent work in replicated datastores has focused on making availability and low latency the primary requirements. We present two directory-based data- stores which make strong application semantics a primary requirement based on ideas from cache coherence in multiprocessors and distributed shared memory. The two datastores are implemented and evaluated against the Apache Cassandra distributed datastore in a simulated geo-distributed envi- ronment with workloads generated by the Yahoo! Cloud Serving Benchmark. We find that while there are cases where our systems perform with better average latency, the variability in the request latencies is undesirable due to expensive synchronization operations.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Electrical & Computer Engr

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2013

Author dc:creator

• Lin, Philbert

Contributors dc:contributor

• Vaidya, Nitin H.

• Replicated datastorage
• Distributed Systems

Statement dc:rights

• Copyright 2013 Philbert Lin

Language dc:language

en

Handle dc:identifier

http://hdl.handle.net/2142/45276

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/45276