Modern server systems schedule large amounts of concurrent requests constrained by, e.g., correctness criteria and service-level agreements. Since standard database management systems provide only limited consistency levels, the state of the art is to develop schedulers imperatively which is time-consuming and error-prone. In this poster, we present Smile (declarative Scheduling MIddLEware), a tool for developing domain-specific scheduling protocols declaratively. Smile decreases the effort to implement and adapt such protocols because it abstracts from low level scheduling details allowing developers to focus on the protocol implementation. We demonstrate the advantages of our approach by implementing a domain-specific use case protocol.
[1]
Joseph M. Hellerstein,et al.
Boom analytics: exploring data-centric, declarative programming for the cloud
,
2010,
EuroSys '10.
[2]
Hans-Arno Jacobsen,et al.
PNUTS: Yahoo!'s hosted data serving platform
,
2008,
Proc. VLDB Endow..
[3]
Werner Vogels,et al.
Data Access Patterns in The Amazon.com Technology Platform
,
2007,
VLDB.
[4]
Michael H. Böhlen,et al.
Correctness Proof of the Declarative SS2PL Protocol Implementation
,
2010
.
[5]
Christian Tilgner,et al.
Declarative scheduling in highly scalable systems
,
2010,
EDBT '10.