University of Cambridge > > Microsoft Research Cambridge, public talks > Cutting tail latency in cloud data stores via adaptive replica selection

Cutting tail latency in cloud data stores via adaptive replica selection

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Achieving predictable performance is critical for many distributed applications, yet difficult to achieve due to many factors that skew the tail of the latency distribution even in well-provisioned systems. In this talk, we will present the fundamental challenges involved in designing a replica selection scheme that is robust in the face of performance fluctuations across servers. We will then present the design and implementation of an adaptive replica selection mechanism, C3, that is robust to performance variability in the environment. We will also discuss C3’s effectiveness in reducing the latency tail and improving throughput through results of performance evaluations conducted on Amazon EC2 and through simulations. An implementation of C3 inside Cassandra improved tail latencies by factors exceeding 3x, while also improving throughput by up to 50%.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity