On the public citation graph

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

https://doi.org/10.1109/rtcsa.2009.44

0 signed · 91 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/bf00365393openalex-snapshot

Stack-based scheduling of realtime processes

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.1016/b978-155860702-6/50016-8openalex-snapshot

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

inferredcites →https://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot

Rate Monotonic vs. EDF: Judgment Day

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

Priority inheritance protocols: an approach to real-time synchronization

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

Reducing the number of preemptions in fixed priority scheduling

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

The limited-preemption uniprocessor scheduling of sporadic task systems

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

Worst-Case Response Time Analysis of Real-Time Tasks under Fixed-Priority Scheduling with Deferred Preemption Revisited

inferredcites →https://doi.org/10.1109/emrts.2001.934032openalex-snapshot

A new kernel approach for modular real-time systems development

inferredcites →https://doi.org/10.1109/emrts.2004.1311016openalex-snapshot

Reducing the number of preemptions in fixed priority scheduling

inferredcites →https://doi.org/10.1109/ipdps.2006.1639406openalex-snapshot

Schedulability analysis of non-preemptive recurring real-time tasks

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

Fixed priority scheduling of periodic task sets with arbitrary deadlines

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

Fixed priority scheduling periodic tasks with varying execution priority

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

On non-preemptive scheduling of period and sporadic tasks

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/rtss.2006.49openalex-snapshot

Tightening the Bounds on Feasible Preemption Points

inferredcites →https://doi.org/10.1109/tc.2004.103openalex-snapshot

Schedulability analysis of periodic fixed priority systems

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

Optimal task placement to improve cache performance

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

Tightening the bounds on feasible preemptions

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

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

inferredcites →https://doi.org/10.5555/1898953.1899101openalex-snapshot

Schedulability analysis of non-preemptive recurring real-time tasks

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/978-3-319-12012-6_18openalex-snapshot

Effective Disaster Management to Enhance the Cloud Performance

inferred← citeshttps://doi.org/10.1007/978-3-642-25873-2_24openalex-snapshot

Partially Non-Preemptive Dual Priority Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1007/978-81-322-2523-2_61openalex-snapshot

Scheduling Real-Time Transactions Using Deferred Preemptive Technique

inferred← citeshttps://doi.org/10.1007/s00607-017-0562-9openalex-snapshot

Real-time uniprocessor scheduling with fewer preemptions

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-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.future.2026.108661openalex-snapshot

Semi-clairvoyant scheduling for mixed-criticality systems with deferred preemption

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

Schedulability analysis and stack size minimization with preemption thresholds and mixed-criticality scheduling

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

Checkpointing for single core energy-neutral real-time systems

inferred← citeshttps://doi.org/10.1049/iet-cdt.2017.0163openalex-snapshot

Implementation of nMPRA CPU architecture based on preemptive hardware scheduler engine and different scheduling algorithms

inferred← citeshttps://doi.org/10.1109/daas.2018.8396064openalex-snapshot

Synthesis analysis and evaluation of hardware scheduler based on different scheduling algorithms

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

Generalized Fixed-Priority Scheduling with Limited Preemptions

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

Explicit Preemption Placement for Real-Time Conditional Code

inferred← citeshttps://doi.org/10.1109/ecs.2014.6892673openalex-snapshot

Ensured availability of resources in a highly reliable mode through enhanced approaches for effective disaster management in cloud

inferred← citeshttps://doi.org/10.1109/emsoft.2013.6658596openalex-snapshot

Limited preemptive scheduling of non-independent task sets

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

Comparative evaluation of limited preemptive methods

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

Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling

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

Target-sensitive systems: Analysis and implementation issues

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/iccubea.2015.76openalex-snapshot

Limited Preemptive Disk Scheduling for Real Time Database System

inferred← citeshttps://doi.org/10.1109/ispa.2013.6703783openalex-snapshot

Sufficient condition for real-time non-preemptive scheduling of interactive multimedia tasks

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

Improving schedulability of fixed-priority real-time systems using shapers

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

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

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

Global fixed priority scheduling with deferred pre-emption

inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203643openalex-snapshot

Preemption-Aware Allocation, Deadline Assignment for Conditional DAGs on Partitioned EDF

inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203646openalex-snapshot

Integrating Preemption Thresholds with Limited Preemption Scheduling

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

Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions

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

Controlling Preemption for Better Schedulability in Multi-Core Systems

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

Optimal Fixed Priority Scheduling with Deferred Pre-emption

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

Limited Pre-emptive Global Fixed Task Priority

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/rtss.2015.17openalex-snapshot

Quantifying the Exact Sub-optimality of Non-preemptive Scheduling

inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00032openalex-snapshot

Segment Streaming for the Three-Phase Execution Model: Design and Implementation

inferred← citeshttps://doi.org/10.1109/sies.2011.5953674openalex-snapshot

Towards preemption control using CPU frequency scaling in sporadic task systems

inferred← citeshttps://doi.org/10.1109/sies.2012.6356581openalex-snapshot

Probabilistic preemption control using frequency scaling for sporadic real-time tasks

inferred← citeshttps://doi.org/10.1109/sies.2013.6601465openalex-snapshot

An energy-aware algorithm exploiting limited preemptive scheduling under fixed priorities

inferred← citeshttps://doi.org/10.1109/tcad.2024.3372447openalex-snapshot

Inter-Task Energy-Hotspot Elimination in Fixed-Priority Real-Time Embedded Systems

inferred← citeshttps://doi.org/10.1109/tii.2010.2049654openalex-snapshot

Limited Preemption EDF Scheduling of Sporadic Task Systems

inferred← citeshttps://doi.org/10.1109/tii.2010.2053378openalex-snapshot

Parameter Selection for Real-Time Controllers in Resource-Constrained Systems

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/tpds.2013.2297098openalex-snapshot

Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption

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/1879021.1879036openalex-snapshot

Reducing stack with intra-task threshold priorities in real-time systems

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

Extending fixed task-priority schedulability by interference limitation

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

Improved feasibility of fixed-priority scheduling with deferred preemption using preemption thresholds for preemption points

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

A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems

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

Minimizing Stack and Communication Memory Usage in Real-Time Embedded Applications

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

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption

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

Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resources

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

Performance-aware task scheduling for energy harvesting nonvolatile processors considering power switching overhead

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

Optimal priority and threshold assignment for fixed-priority preemption threshold 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/3696355.3696366openalex-snapshot

ILP representation for Limited Preemption in Energy-Neutral Single-Core Systems

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

Taking One for the Team: Trading Overhead and Blocking for Optimal Critical-Section Granularity with a Shared GPU

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

Total Execution Order in Fault-Tolerant Real-Time Systems

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

A Robust Approach for Ensuring Total Order Execution of Replicated Sporadic Tasks in Fault-Tolerant Multiprocessor Real-Time Systems

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

Real-time Limited Preemptive Scheduling

inferred← citeshttps://doi.org/10.5555/2555754.2555772openalex-snapshot

Limited preemptive scheduling of non-independent task sets

inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/6597openalex-snapshot

Operating System Contribution to Composable Timing Behaviour in High-Integrity Real-Time Systems

inferred← citeshttps://doi.org/10.6100/ir755346openalex-snapshot

Composition and synchronization of real-time components upon one processor

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.