On the public citation graph
Integrating Cache-Related Pre-Emption Delays into Analysis of Fixed Priority Scheduling with Pre-Emption Thresholds
0 signed · 56 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4020-8157-6_29openalex-snapshot
aiT: Worst-Case Execution Time Prediction by Static Program Analysis
inferredcites →https://doi.org/10.1007/s11241-005-0507-9openalex-snapshot
Measuring the Performance of Schedulability Tests
inferredcites →https://doi.org/10.1007/s11241-009-9071-zopenalex-snapshot
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
inferredcites →https://doi.org/10.1007/s11241-012-9152-2openalex-snapshot
Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
inferredcites →https://doi.org/10.1016/j.sysarc.2010.08.006openalex-snapshot
Cache-related preemption delay via useful cache blocks: Survey and redefinition
inferredcites →https://doi.org/10.1016/s1474-6670(17)51283-5openalex-snapshot
Hard Real-Time Scheduling: The Deadline-Monotonic Approach
inferredcites →https://doi.org/10.1093/comjnl/29.5.390openalex-snapshot
Finding Response Times in a Real-Time System
inferredcites →https://doi.org/10.1109/12.689649openalex-snapshot
Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
inferredcites →https://doi.org/10.1109/ecrts.2005.26openalex-snapshot
Scheduling Analysis of Real-Time Systems with Precise Modeling of Cache Related Preemption Delay
inferredcites →https://doi.org/10.1109/ecrts.2011.28openalex-snapshot
Optimal Selection of Preemption Points to Minimize Preemption Overhead
inferredcites →https://doi.org/10.1109/ecrts.2012.34openalex-snapshot
Generalized Fixed-Priority Scheduling with Limited Preemptions
inferredcites →https://doi.org/10.1109/emsoft.2013.6658596openalex-snapshot
Limited preemptive scheduling of non-independent task sets
inferredcites →https://doi.org/10.1109/etfa.2010.5640984openalex-snapshot
Exact response-time analysis for fixed-priority preemption-threshold scheduling
inferredcites →https://doi.org/10.1109/ipdps.2007.370344openalex-snapshot
Static-Priority Scheduling and Resource Hold Times
inferredcites →https://doi.org/10.1109/real.2000.895993openalex-snapshot
Scalable real-time system design using preemption thresholds
inferredcites →https://doi.org/10.1109/real.2001.990598openalex-snapshot
Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip
inferredcites →https://doi.org/10.1109/real.2002.1181585openalex-snapshot
Scheduling tasks with mixed preemption relations for robustness to timing faults
inferredcites →https://doi.org/10.1109/rtas.2008.18openalex-snapshot
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
inferredcites →https://doi.org/10.1109/rtcsa.1999.811269openalex-snapshot
Scheduling fixed-priority tasks with preemption threshold
inferredcites →https://doi.org/10.1109/rtcsa.2009.44openalex-snapshot
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
inferredcites →https://doi.org/10.1109/rtss.2006.49openalex-snapshot
Tightening the Bounds on Feasible Preemption Points
inferredcites →https://doi.org/10.1109/rtss.2011.30openalex-snapshot
Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions
inferredcites →https://doi.org/10.1109/rtss.2012.57openalex-snapshot
Optimal Fixed Priority Scheduling with Deferred Pre-emption
inferredcites →https://doi.org/10.1109/rttas.1996.509537openalex-snapshot
Adding instruction cache effect to schedulability analysis of preemptive real-time systems
inferredcites →https://doi.org/10.1109/tii.2012.2188805openalex-snapshot
Limited Preemptive Scheduling for Real-Time Systems. A Survey
inferredcites →https://doi.org/10.1145/2392987.2393008openalex-snapshot
Optimising task layout to increase schedulability via reduced cache related pre-emption delays
inferredcites →https://doi.org/10.5555/2555754.2555772openalex-snapshot
Limited preemptive scheduling of non-independent task sets
inferredcites →https://doi.org/10.6100/ir580445openalex-snapshot
Real-time scheduling for media processing using conditionally guaranteed budgets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11241-015-9246-8openalex-snapshot
On the effectiveness of cache partitioning in hard real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-016-9266-zopenalex-snapshot
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation
inferred← citeshttps://doi.org/10.1007/s11241-017-9275-6openalex-snapshot
Online and offline scheduling with cache-related preemption delays
inferred← citeshttps://doi.org/10.1007/s11241-017-9285-4openalex-snapshot
An extensible framework for multicore response time analysis
inferred← citeshttps://doi.org/10.1007/s11241-018-9305-zopenalex-snapshot
Response-time analysis for fixed-priority systems with a write-back cache
inferred← citeshttps://doi.org/10.1016/j.jss.2017.09.008openalex-snapshot
Efficient exact Boolean schedulability tests for fixed priority preemption threshold scheduling
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103183openalex-snapshot
Resource-efficient cyber-physical systems design: A survey
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102007openalex-snapshot
Feasibility interval and sustainable scheduling simulation with CRPD on uniprocessor platform
inferred← citeshttps://doi.org/10.1109/ecrts.2015.22openalex-snapshot
Minimizing Cache Overhead via Loaded Cache Blocks and Preemption Placement
inferred← citeshttps://doi.org/10.1109/etfa61755.2024.10710908openalex-snapshot
Predicting Cache Behaviour of Concurrent Applications
inferred← citeshttps://doi.org/10.1109/rtas.2017.35openalex-snapshot
Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
inferred← citeshttps://doi.org/10.1109/rtas.2018.00024openalex-snapshot
Mixed Criticality Systems with Varying Context Switch Costs
inferred← citeshttps://doi.org/10.1109/rtcsa.2018.00020openalex-snapshot
EMPRESS: an Efficient and Effective Method for PREdictable Stack Sharing
inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203646openalex-snapshot
Integrating Preemption Thresholds with Limited Preemption Scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2017.00054openalex-snapshot
Work-in-Progress: Cache-Aware Partitioned EDF Scheduling for Multi-core Real-Time Systems
inferred← citeshttps://doi.org/10.1109/sies.2016.7509417openalex-snapshot
Minimizing stack usage for AUTOSAR/OSEK's restricted fixed-priority preemption threshold support
inferred← citeshttps://doi.org/10.1109/tcad.2018.2857079openalex-snapshot
Analyzing Data Cache Related Preemption Delay With Multiple Preemptions
inferred← citeshttps://doi.org/10.1109/tcad.2019.2937807openalex-snapshot
Scope-Aware Useful Cache Block Calculation for Cache-Related Pre-Emption Delay Analysis With Set-Associative Data Caches
inferred← citeshttps://doi.org/10.1109/tpds.2016.2528978openalex-snapshot
Global Fixed Priority Scheduling with Preemption Threshold: Schedulability Analysis and Stack Size Minimization
inferred← citeshttps://doi.org/10.1145/2834848.2834853openalex-snapshot
Scheduling with preemption delays
inferred← citeshttps://doi.org/10.1145/2834848.2834862openalex-snapshot
A generic and compositional framework for multicore response time analysis
inferred← citeshttps://doi.org/10.1145/2950057openalex-snapshot
Cache-Partitioned Preemption Threshold Scheduling
inferred← citeshttps://doi.org/10.1145/2997465.2997476openalex-snapshot
Analysis of Write-back Caches under Fixed-priority Preemptive and Non-preemptive Scheduling
inferred← citeshttps://doi.org/10.1145/3394810.3394821openalex-snapshot
Allocation of Real-Time Tasks onto Identical Core Platforms under Deferred fixed Preemption-Point Model
inferred← citeshttps://doi.org/10.1145/3477314.3507027openalex-snapshot
Improving CRPD analysis for EDF scheduling
inferred← citeshttps://doi.org/10.1155/2015/837472openalex-snapshot
Assigning Priorities for Fixed Priority Preemption Threshold Scheduling
inferred← citeshttps://doi.org/10.23919/date.2017.7926990openalex-snapshot
Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform with caches
inferred← citeshttps://doi.org/10.4230/lites-v003-i001-a005openalex-snapshot
A Survey on Static Cache Analysis for Real-Time Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.