BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Building Flexible High-Performance Key-Value Systems - Amar Phanis
 hayee\, Carnegie Mellon University
DTSTART:20130410T090000Z
DTEND:20130410T100000Z
UID:TALK37042@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:This talk will focus on the design of a new replication mechan
 ism\, called Ouroboros\, for the construction of adaptable\, fault-toleran
 t\, and high-performance key-value (KV) systems. Ouroboros unifies chain r
 eplication and consistent hashing to provide provably strong data consiste
 ncy while maintaining consistent hashing's efficient partitioning. Key to 
 its usability is its ability to support non-blocking node addition and rem
 oval\, ensuring that Ouroboros-based clusters continue to provide high-per
 formance during the normal failures that affect highly scalable storage sy
 stems. In the context of FAWN-KV\, a distributed KV system I built for for
  Flash-based clusters\, I will show how the protocols in Ouroboros help ov
 ercome slow random writes on Flash devices and offer high-performance unde
 r churn. \n\nDistributed KV systems are a critical part of the infrastruct
 ure at many large sites such as Amazon\, LiveJournal\, Facebook\, and Twit
 ter. Unfortunately\, the ecosystem of these KV stores is a mess---no one e
 xisting system meets the needs of all applications. Systems designers worr
 y about running multiple stores from different codebases\, vendors\, and s
 o on\, each optimized for certain application requirements and hardware co
 nfiguration. In contrast\, I will show how a single KV system\, Flex-KV\, 
 extends Ouroboros to flexibly meet the needs of a variety of applications.
  Flex-KV can support DRAM\, Flash\, and disk-based storage\, can act as an
  unreliable cache or a durable store\, and can offer strong or weak data c
 onsistency. The value of such a system goes beyond ease-of-use: While expl
 oring these dimensions of durability\, consistency\, and availability\, we
  find new choices for system designs\, such as a cache-consistent memcache
 d\, that offer some applications a better balance of performance and cost 
 than was previously available.
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR