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

Abstract

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.

Meeting Name

16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, 11th IEEE International Conference on Big Data Science and Engineering and 14th IEEE International Conference on Embedded Software and Systems, Trustcom/BigDataSE/ICESS 2017 (2017: Aug. 1-4, Sydney, Australia)

Department(s)

Computer Science

Keywords and Phrases

Cache-Related Preemption Delay; Global Earliest Deadline First; Multiprocessor Scheduling; Schedulability Analysis

International Standard Book Number (ISBN)

978-1-5090-4906-6

International Standard Serial Number (ISSN)

2324-9013

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2017 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.

Publication Date

01 Aug 2017

Link to Full Text

Share

 
COinS