Campus Event Calendar
Event Entry
What and Who
Building fast and consistent replicated systems: from principles to practice
Cheng Li
MMCI
SWS Student Defense Talks - Thesis Proposal
SWS
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 23 February 2015
15:00
60 Minutes
E1 5
029
Saarbrücken
Abstract
Distributing data across replicas within a data center or across
multiple data centers plays an important role in building Internet-Scale
services that provide good user experience, namely low latency access
and high throughput. This approach often compromises on strong
consistency semantics, which help maintain application-specific desired
properties. To relieve such inherent tension, in the past few years,
many proposals have been designed to allow programmers to selectively
weaken consistency levels of certain operations to avoid costly
immediate coordination for concurrent user requests. However, these
proposals fail to provide principles to guide programmers to make a
correct decision of assigning consistency levels to various operations
so that good performance is extracted while system behaviors
still comply with specifications.
The primary goal of my work is to provide programmers with principles
and tools for building fast and consistent systems by allowing
programmers to think about various consistency levels in the same
framework. In order to meet this goal, we plan to develop the following
three components. The first component of my thesis is a novel
consistency model called RedBlue Consistency [24], which presents
sufficient conditions that allow programmers to safely separate weakly
consistent operations from strongly consistent ones in a coarse-grained
manner. The second component is SIEVE [23] - a tool that explores both
Commutative Replicated Data Types and program analysis techniques to
assign proper consistency levels (either weak or strong consistency) to
different operations and to maximize the weakly consistent operation
space. The third component is Partial Order-Restrictions Consistency
(PoR Consistency) - a generic consistency definition that generalizes
the trade-off between consistency and performance by capturing various
consistency levels in terms of visibility restrictions among operations.
The power of PoR Consistency is allowing programmers to tune the
restrictions to obtain a fine-grained control of their targeted
consistency semantics.
multiple data centers plays an important role in building Internet-Scale
services that provide good user experience, namely low latency access
and high throughput. This approach often compromises on strong
consistency semantics, which help maintain application-specific desired
properties. To relieve such inherent tension, in the past few years,
many proposals have been designed to allow programmers to selectively
weaken consistency levels of certain operations to avoid costly
immediate coordination for concurrent user requests. However, these
proposals fail to provide principles to guide programmers to make a
correct decision of assigning consistency levels to various operations
so that good performance is extracted while system behaviors
still comply with specifications.
The primary goal of my work is to provide programmers with principles
and tools for building fast and consistent systems by allowing
programmers to think about various consistency levels in the same
framework. In order to meet this goal, we plan to develop the following
three components. The first component of my thesis is a novel
consistency model called RedBlue Consistency [24], which presents
sufficient conditions that allow programmers to safely separate weakly
consistent operations from strongly consistent ones in a coarse-grained
manner. The second component is SIEVE [23] - a tool that explores both
Commutative Replicated Data Types and program analysis techniques to
assign proper consistency levels (either weak or strong consistency) to
different operations and to maximize the weakly consistent operation
space. The third component is Partial Order-Restrictions Consistency
(PoR Consistency) - a generic consistency definition that generalizes
the trade-off between consistency and performance by capturing various
consistency levels in terms of visibility restrictions among operations.
The power of PoR Consistency is allowing programmers to tune the
restrictions to obtain a fine-grained control of their targeted
consistency semantics.
Contact
--email hidden
Video Broadcast
Yes
Kaiserslautern
G26
112
passcode not visible
logged in users only
Maria-Louise Albrecht, 11/19/2015 11:16
Maria-Louise Albrecht, 02/11/2015 16:05 -- Created document.
Maria-Louise Albrecht, 02/11/2015 16:05 -- Created document.