On the public citation graph
Accounting for Cache-Related Preemption Delay in Dynamic Priority Schedulability Analysis
0 signed · 42 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.1016/s0898-1221(98)90205-xopenalex-snapshot
Hard real-time computing systems: Predictable scheduling algorithms and applications
inferredcites →https://doi.org/10.1023/a:1008119029962openalex-snapshot
Guest Editorial: A Review of Worst-Case Execution-Time Analysis
inferredcites →https://doi.org/10.1023/a:1008141130870openalex-snapshot
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
inferredcites →https://doi.org/10.1023/a:1008149332687openalex-snapshot
Worst Case Execution Time Analysis for a Processor with Branch Prediction
inferredcites →https://doi.org/10.1023/a:1021711220939openalex-snapshot
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
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/32.950317openalex-snapshot
Bounding cache-related preemption delay for real-time systems
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/micro.1997.645830openalex-snapshot
MediaBench: a tool for evaluating and synthesizing multimedia and communications systems
inferredcites →https://doi.org/10.1109/real.2004.17openalex-snapshot
Design Space Exploration and System Optimization with SymTA/S — Symbolic Timing Analysis for Systems
inferredcites →https://doi.org/10.1145/1065910.1065933openalex-snapshot
Scalable precision cache analysis for preemptive scheduling
inferredcites →https://doi.org/10.1145/315773.315778openalex-snapshot
Performance estimation of embedded software with instruction cache modeling
inferredcites →https://doi.org/10.1145/944696.944698openalex-snapshot
Accurate estimation of cache-related preemption delay
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-10-0557-2_49openalex-snapshot
Scheduling Algorithms for Cache Effect Optimisationin Partitioned Systems
inferred← citeshttps://doi.org/10.1007/978-981-13-0224-4_49openalex-snapshot
Low-Complexity MPN Preemption Policy for Real-Time Task Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-96-0165-3_26openalex-snapshot
DPAPC: Deterministic Process-Aware Partitioned Cache for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/s11241-014-9204-xopenalex-snapshot
Unified overhead-aware schedulability analysis for slot-based task-splitting
inferred← citeshttps://doi.org/10.1007/s11241-015-9222-3openalex-snapshot
The limited-preemptive feasibility of real-time tasks on uniprocessors
inferred← citeshttps://doi.org/10.1007/s11241-015-9228-xopenalex-snapshot
Cache related pre-emption delays in hierarchical scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2015.04.003openalex-snapshot
A composable real-time architecture for replicated railway applications
inferred← citeshttps://doi.org/10.1109/date.2012.6176520openalex-snapshot
Preemption delay analysis for floating non-preemptive region scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2009.21openalex-snapshot
A New Notion of Useful Cache Block to Improve the Bounds of Cache-Related Preemption Delay
inferred← citeshttps://doi.org/10.1109/ecrts.2010.9openalex-snapshot
Preemption Points Placement for Sporadic Task Sets
inferred← citeshttps://doi.org/10.1109/ecrts.2011.28openalex-snapshot
Optimal Selection of Preemption Points to Minimize Preemption Overhead
inferred← citeshttps://doi.org/10.1109/ecrts.2013.22openalex-snapshot
Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/etfa.2014.7005198openalex-snapshot
Temporal isolation with preemption delay accounting
inferred← citeshttps://doi.org/10.1109/etfa.2015.7301405openalex-snapshot
Addressing cache related preemption delay in fixed priority assignment
inferred← citeshttps://doi.org/10.1109/iccic.2014.7238541openalex-snapshot
Minimizing cache related preemption delay in preemptive scheduler
inferred← citeshttps://doi.org/10.1109/isorc52572.2022.9812766openalex-snapshot
Security-Cognizant Real-Time Scheduling
inferred← citeshttps://doi.org/10.1109/rtas.2008.18openalex-snapshot
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
inferred← citeshttps://doi.org/10.1109/rtas.2013.6531081openalex-snapshot
Integrating cache related pre-emption delay analysis into EDF scheduling
inferred← citeshttps://doi.org/10.1109/rtas48715.2020.00005openalex-snapshot
Bringing Inter-Thread Cache Benefits to Federated Scheduling
inferred← citeshttps://doi.org/10.1109/rtas65571.2025.00011openalex-snapshot
Work in Progress: Reducing WCET Estimation by Increasing the Number of Persistent Blocks
inferred← citeshttps://doi.org/10.1109/rtcsa.2009.24openalex-snapshot
Towards Real Multi-criticality Scheduling
inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00030openalex-snapshot
Co-Located Parallel Scheduling of Threads to Optimize Cache Sharing
inferred← citeshttps://doi.org/10.1109/sies.2012.6356570openalex-snapshot
An improved preemption delay upper bound for floating non-preemptive region
inferred← citeshttps://doi.org/10.1109/tc.2012.279openalex-snapshot
Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems
inferred← citeshttps://doi.org/10.1109/tpds.2016.2516519openalex-snapshot
Many-Core Real-Time Task Scheduling with Scratchpad Memory
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.317openalex-snapshot
Integrating Cache-Related Preemption Delay into GEDF Analysis for Multiprocessor Scheduling with On-chip Cache
inferred← citeshttps://doi.org/10.1109/vlsid60093.2024.00049openalex-snapshot
Certifiable and Efficient Autonomous Cyber-Physical Systems Design
inferred← citeshttps://doi.org/10.1201/9781420043839.ch1openalex-snapshot
Worst-Case Execution Time and Energy Analysis
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.