Daniel Kästner, Stephan Thesing: Cache-Sensitive Pre-Runtime Scheduling
Proceedings of the Workshop on Languages, Compilers and Tools for Embedded Systems, June 19-20 1998,
Montreal, Canada.
We present a novel pre-runtime scheduling method for uni-processors which precisely
incorporates the effects
of task switching on the processor cache into its decisions. Tasks are modelled
as a sequence of non preemtable
segments with precedence constraints. The cache behavior of each task segment is
statically determined by
abstract interpretation. For the sake of efficiency, the scheduling algorithm uses
a heuristically
guided search strategy. Each time a new task segment is added to a partial schedule,
its worst case execution time is calculated based on the cache state at the end
of the preceding partial schedule.
Due to Springers copyright policy, only the abstract is available online until June 1999.
See Springer for a list of LNCS volumes.