Integrating Cache-Related Preemption Delay into GEDF Analysis for Multiprocessor Scheduling with On-chip Cache

Most existing multiprocessor schedulability analysis assumes zero cost for preemptions and migrations. In order for those analysis to be correct, execution time estimations are often inflated by a certain (pessimistic) factor, leading to severe waste of computing resource. In this paper, a novel Glo...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhang, Ying, Guo, Zhishan, Wang, Lingxiang, Xiong, Haoyi, Zhang, Zhenkai
Format: Conference Proceeding
Language:English
Subjects:
Cache-Related Preemption Delay
Delays
Estimation
Global Earliest Deadline First
Interference
Multicore processing
Multiprocessor scheduling
Processor scheduling
Program processors
Real-time systems
schedulability analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Most existing multiprocessor schedulability analysis assumes zero cost for preemptions and migrations. In order for those analysis to be correct, execution time estimations are often inflated by a certain (pessimistic) factor, leading to severe waste of computing resource. In this paper, a novel Global Earliest Deadline First (GEDF) schedulability test is proposed, where Cache-Related Preemption Delay (CRPD) is separately modeled and integrated. Specifically, multiple analyses for estimating CRPD bounds are conducted based on the refined estimation of the maximal number of preemptions, leading to tighter G-EDF schedulability tests. The experimental study is conducted to demonstrate the performance of the proposed methods.
ISSN:2324-9013
DOI:10.1109/Trustcom/BigDataSE/ICESS.2017.317