Xu, MengPhan, Linh Thi XuanLee, InsupChoi, Hyon-Young2023-05-222023-05-222016-04-012016-05-27https://repository.upenn.edu/handle/20.500.14332/6893We introduce gFPca, a cache-aware global pre-emptive fixed-priority (FP) scheduling algorithm with dynamic cache allocation for multicore systems, and we present its analysis and implementation. We introduce a new overhead-aware analysis that integrates several novel ideas to safely and tightly account for the cache overhead. Our evaluation shows that the proposed overhead-accounting approach is highly accurate, and that gFPca improves the schedulability of cache-intensive tasksets substantially compared to the cache-agnostic global FP algorithm. Our evaluation also shows that gFPca outperforms the existing cache-aware non- preemptive global FP algorithm in most cases. Through our implementation and empirical evaluation, we demonstrate the feasibility of cache-aware global scheduling with dynamic cache allocation and highlight scenarios in which gFPca is especially useful in practice.© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.CPS Real-Timecache storagemultiprocessing systemsprocessor schedulingresource allocationDynamic schedulingHeuristic algorithmsInterferenceMulticore processingResource managementScheduling algorithmscache-aware global preemptive fixed-priority scheduling algorithmcache-agnostic global FP algorithmcache-aware nonpreemptive global FP algorithmdynamic cache allocationgFPcamulticore systemsoverhead-aware analysisComputer EngineeringComputer SciencesPresentation