On the public citation graph

Tightening the Bounds on Feasible Preemption Points

https://doi.org/10.1109/rtss.2006.49

0 signed · 66 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44520-x_26openalex-snapshot

A Fast and Accurate Approach to Analyze Cache Memory Behavior

inferredcites →https://doi.org/10.1023/a:1008190423977openalex-snapshot

Timing Analysis for Data and Wrap-Around Fill Caches

inferredcites →https://doi.org/10.1049/sej.1993.0034openalex-snapshot

Applying new scheduling theory to static priority pre-emptive scheduling

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.392980openalex-snapshot

An accurate worst case timing analysis for RISC processors

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/ecrts.2006.32openalex-snapshot

WCET-Centric Software-controlled Instruction Caches for Hard Real-Time Systems

inferredcites →https://doi.org/10.1109/ecrts.2006.33openalex-snapshot

Worst case timing analysis of input dependent data cache behavior

inferredcites →https://doi.org/10.1109/emwrts.1996.557940openalex-snapshot

Adding instruction cache effect to an exact schedulability analysis of preemptive real-time systems

inferredcites →https://doi.org/10.1109/hpca.2002.995708openalex-snapshot

Let's study whole-program cache behaviour analytically

inferredcites →https://doi.org/10.1109/pact.1999.807544openalex-snapshot

Automatic analytical modeling for the estimation of cache misses

inferredcites →https://doi.org/10.1109/real.1989.63567openalex-snapshot

The rate monotonic scheduling algorithm: exact characterization and average case behavior

inferredcites →https://doi.org/10.1109/real.1996.563722openalex-snapshot

Cache modeling for real-time software: beyond direct mapped instruction caches

inferredcites →https://doi.org/10.1109/real.2002.1181567openalex-snapshot

Low-complexity algorithms for static cache locking in multitasking hard real-time systems

inferredcites →https://doi.org/10.1109/rtas.2005.12openalex-snapshot

Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns

inferredcites →https://doi.org/10.1109/rtas.2006.14openalex-snapshot

Bounding Preemption Delay within Data Cache Reference Patterns for Real-Time Tasks

inferredcites →https://doi.org/10.1109/rttas.1996.509540openalex-snapshot

Efficient worst case timing analysis of data caching

inferredcites →https://doi.org/10.1145/1017753.1017798openalex-snapshot

Multiple process execution in cache related preemption delay analysis

inferredcites →https://doi.org/10.1145/325478.325479openalex-snapshot

Cache miss equations

inferredcites →https://doi.org/10.1145/334012.334025openalex-snapshot

Program path analysis to bound cache-related preemption delay in preemptive real-time systems

inferredcites →https://doi.org/10.1145/378795.378859openalex-snapshot

Exact analysis of the cache behavior of nested loops

inferredcites →https://doi.org/10.1145/781027.781062openalex-snapshot

Data cache locking for higher program predictability

inferredcites →https://doi.org/10.1145/781061.781062openalex-snapshot

Data cache locking for higher program predictability

inferredcites →https://doi.org/10.1145/944645.944698openalex-snapshot

Accurate estimation of cache-related preemption delay

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-3-031-45410-3_8openalex-snapshot

Limited Preemptive Scheduling

inferred← citeshttps://doi.org/10.1007/s11241-010-9113-6openalex-snapshot

Feasibility analysis under fixed priority scheduling with limited preemptions

inferred← citeshttps://doi.org/10.1007/s11241-011-9129-6openalex-snapshot

Making DRAM refresh predictable

inferred← citeshttps://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

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.1016/j.micpro.2020.103183openalex-snapshot

Resource-efficient cyber-physical systems design: A survey

inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.10.005openalex-snapshot

GPUart - An application-based limited preemptive GPU real-time scheduler for embedded systems

inferred← citeshttps://doi.org/10.1109/ecrts.2010.23openalex-snapshot

Making DRAM Refresh Predictable

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.2014.25openalex-snapshot

Explicit Preemption Placement for Real-Time Conditional Code

inferred← citeshttps://doi.org/10.1109/etfa.2010.5641199openalex-snapshot

Comparative evaluation of limited preemptive methods

inferred← citeshttps://doi.org/10.1109/etfa.2011.6059014openalex-snapshot

Scheduling non-preemptive hard real-time tasks with strict periods

inferred← citeshttps://doi.org/10.1109/etfa.2014.7005308openalex-snapshot

Hybrid energy-aware scheduling based on renewal process in real-time systems

inferred← citeshttps://doi.org/10.1109/euc.2010.47openalex-snapshot

Preemption Control Using Frequency Scaling in Fixed Priority Scheduling

inferred← citeshttps://doi.org/10.1109/euc.2011.46openalex-snapshot

Job Phasing Aware Preemption Deferral

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.2008.19openalex-snapshot

Hybrid Timing Analysis of Modern Processor Pipelines via Hardware/Software Interactions

inferred← citeshttps://doi.org/10.1109/rtas.2009.28openalex-snapshot

Bounding Worst-Case Response Times of Tasks under PIP

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/rtas48715.2020.00-19openalex-snapshot

Cache-aware response time analysis for real-time tasks with fixed preemption points

inferred← citeshttps://doi.org/10.1109/rtcsa.2009.44openalex-snapshot

Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling

inferred← citeshttps://doi.org/10.1109/rtcsa.2009.46openalex-snapshot

A Compositional Scheduling Framework for Digital Avionics Systems

inferred← citeshttps://doi.org/10.1109/rtcsa.2010.40openalex-snapshot

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

inferred← citeshttps://doi.org/10.1109/rtss.2008.12openalex-snapshot

Merging State and Preserving Timing Anomalies in Pipelines of High-End Processors

inferred← citeshttps://doi.org/10.1109/rtss.2011.31openalex-snapshot

Cache Related Pre-emption Delay Aware Response Time Analysis for Fixed Priority Pre-emptive Systems

inferred← citeshttps://doi.org/10.1109/rtss.2014.25openalex-snapshot

Integrating Cache-Related Pre-Emption Delays into Analysis of Fixed Priority Scheduling with Pre-Emption Thresholds

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/tii.2012.2188805openalex-snapshot

Limited Preemptive Scheduling for Real-Time Systems. A Survey

inferred← citeshttps://doi.org/10.1109/tsmca.2012.2199305openalex-snapshot

Energy-Efficient Scheduling in Nonpreemptive Systems With Real-Time Constraints

inferred← citeshttps://doi.org/10.1145/1366283.1366292openalex-snapshot

Using sequencing to trigger a better analysis

inferred← citeshttps://doi.org/10.1145/1629395.1629421openalex-snapshot

CheckerCore

inferred← citeshttps://doi.org/10.1145/2516821.2516831openalex-snapshot

Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption

inferred← citeshttps://doi.org/10.1145/2905055.2905156openalex-snapshot

Scheduling Real-Time task using dynamic Preemption Threshold

inferred← citeshttps://doi.org/10.1587/transinf.2016edp7447openalex-snapshot

Incorporating Security Constraints into Mixed-Criticality Real-Time Scheduling

inferred← citeshttps://doi.org/10.34626/4a2t-x523openalex-snapshot

Task management with a real-time operating system for an automated vehicle

inferred← citeshttps://doi.org/10.34626/hstm-w464openalex-snapshot

Real-time Limited Preemptive Scheduling

inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.709.542openalex-snapshot

A Novel Cache Sharing Scheme and Implementation in Multi-Core Real-Time Linux System

inferred← citeshttps://doi.org/10.70675/d34d7258z6ae2z430bzbab6zfc3ca093b036openalex-snapshot

Quantum approaches for Worst-Case Execution-Times analysis of programs

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.