Paper Info
Title
Pluggable scheduling for the reactor programming model.
Abstract
The reactor model is a foundational programming model for distributed computing, whose focus is modularizing and composing computations and message protocols. Previous work on reactors dealt mainly with the programming model and its composability properties, but did not show how to schedule computations in reactor-based programs. In this paper, we propose a pluggable scheduling algorithm for the reactor model. The algorithm is customizable with user-defined scheduling policies. We define and prove safety and progress properties. We compare our implementation against the Akka actor framework, and show up to 3× performance improvements on standard actor benchmarks.
Year
DOI
Venue
2018
10.1145/3001886.3001891
AGERE!@SPLASH
Keywords
DocType
Citations 
reactor model, reactors, scheduling, composable distributed computing, event streams, channels, actors
Conference
4
PageRank 
References 
Authors
0.42
19
1
Name
Order
Citations
PageRank
Aleksandar Prokopec116313.56