Pluggable Scheduling for the Reactor Programming Model
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\times$ performance improvements
on standard actor benchmarks.
Sun 30 Oct Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|08:25 - 08:30|
|08:30 - 09:00|
Joeri De KosterVrije Universiteit Brussel, Belgium, Tom Van CutsemNokia Bell Labs, Belgium, Wolfgang De MeuterVrije Universiteit Brussel, BelgiumDOI File Attached
|09:00 - 09:30|
Aleksandar ProkopecOracle Labs, SwitzerlandDOI
|09:30 - 10:00|
|DOI File Attached|