Please use this identifier to cite or link to this item:
|Title:||Accounting for cache-related preemption delay in dynamic priority schedulability analysis||Authors:||Ju, L.
|Issue Date:||2007||Citation:||Ju, L.,Chakraborty, S.,Roychoudhury, A. (2007). Accounting for cache-related preemption delay in dynamic priority schedulability analysis. Proceedings -Design, Automation and Test in Europe, DATE : 1623-1628. ScholarBank@NUS Repository. https://doi.org/10.1109/DATE.2007.364534||Abstract:||Recently there has been considerable interest in incorporating timing effects of microarchitectural features of processors (e.g. caches and pipelines) into the schedulability analysis of tasks running on them. Following this line of work, in this paper we show how to account for the effects of cache-related preemption delay (CRPD) in the standard schedulability tests for dynamic priority schedulers like EDF. Even if the memory space of tasks is disjoint, their memory blocks usually map into a shared cache. As a result, task preemption may introduce additional cache misses which are encountered when the preempted task resumes execution; the delay due to these additional misses is called CRPD. Previous work on accounting for CRPD was restricted to only static priority schedulers and periodic task models. Our work extends these results to dynamic priority schedulers and more general task models (e.g. sporadic, generalized multiframe and recurring real-time). We show that our schedulability tests are useful through extensive experiments using synthetic task sets, as well as through a detailed case study. © 2007 EDAA.||Source Title:||Proceedings -Design, Automation and Test in Europe, DATE||URI:||http://scholarbank.nus.edu.sg/handle/10635/41269||ISBN:||3981080122||ISSN:||15301591||DOI:||10.1109/DATE.2007.364534|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 10, 2019
checked on Jul 5, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.