Login / Signup
A memory-optimal buffering protocol for preservation of synchronous semantics under preemptive scheduling.
Christos Sofronis
Stavros Tripakis
Paul Caspi
Published in:
EMSOFT (2006)
Keyphrases
</>
preemptive scheduling
dynamic programming
logic programming
semantic information
search space
lightweight
state information
database systems
optimal solution
special case
worst case
branch and bound
data access
memory requirements
formal semantics
random access