Campus Event Calendar
Event Entry
What and Who
Cache Sensitive Pre-Runtime Scheduling
Stephan Thesing
Seminar des Graduiertenkollegs
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 26 January 98
16:00
60 Minutes
45 - FB14
015
Saarbrücken
Abstract
Hard real-time systems must guarantee that all tasks making up the system finish within given time bounds. A Pre-Runtime schedule fixes the start time of each task in such a way that the time bounds are not violated. Anyhow, to compute such a schedule a safe (and tight) approximation of the worst case execution time of each task must be known. The presence of caches in modern microprocessors makes this estimation difficult, since the execution time of an instruction depends on the execution path that leads to it.
Recently, an analysis has been developed that allows the static prediction of cache contents and thus of execution times. In this talk we will show how this analysis can be incorporated into the computation of a pre-runtime schedule, in order to obtain better processor utilization.
Contact
Uelkue Coruh
--email hidden
passcode not visible
logged in users only