Smile: enabling easy and fast development of domain-specific scheduling protocols

Authors:
Christian Tilgner;Boris Glavic;Michael Böhlen;Carl-Christian Kanne
Affiliations:
University of Zurich;University of Toronto;University of Zurich;University of Mannheim
Venue:
BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
Year:
2011

Citing 4
Cited 0

Data access patterns in the Amazon.com technology platform

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
PNUTS: Yahoo!'s hosted data serving platform

Proceedings of the VLDB Endowment
Declarative scheduling in highly scalable systems

Proceedings of the 2010 EDBT/ICDT Workshops
Boom analytics: exploring data-centric, declarative programming for the cloud

Proceedings of the 5th European conference on Computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.