Analysis of cache-related preemption delay in fixed-priority preemptive scheduling

DOI10.1109/12.689649MaRDI QIDQ4571468zbMATH OpenOpenAlexFDO

Authors Chang-Gun Lee, Joosun Hsahn, Yang-Min Seo, Sang Lyul Min, Rhan Ha, Seongsoo Hong, Chang Yun Park, Min Suk Lee, Chong Sang Kim

Publication date 9 July 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.689649

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35)

Cited in

(11)

• An extensible framework for multicore response time analysis
• Online and offline scheduling with cache-related preemption delays
• Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
• Scalable and precise refinement of cache timing analysis via path-sensitive verification
• The limited-preemptive feasibility of real-time tasks on uniprocessors
• Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
• Cache related pre-emption delays in hierarchical scheduling
• scientific article; zbMATH DE number 7559342 (Why is no real title available?)
• NPM-BUNDLE: Non-Preemptive Multitask Scheduling for Jobs with BUNDLE-Based Thread-Level Scheduling.
• Timing-aware analysis of shared cache interference for non-preemptive scheduling
• Response-time analysis for fixed-priority systems with a write-back cache

This page was built for publication: Analysis of cache-related preemption delay in fixed-priority preemptive scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571468)