On the public citation graph

Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions

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

0 signed · 50 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/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/0166-5316(82)90024-4openalex-snapshot

On the complexity of fixed-priority scheduling of periodic, real-time tasks

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.1093/comjnl/29.5.390openalex-snapshot

Finding Response Times in a Real-Time System

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

Preemption Points Placement for Sporadic Task Sets

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/etfa.2010.5640984openalex-snapshot

Exact response-time analysis for fixed-priority preemption-threshold scheduling

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

Preemptively scheduling hard-real-time sporadic tasks on one processor

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

Scalable real-time system design using preemption thresholds

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

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

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

Limited Preemption EDF Scheduling of Sporadic Task Systems

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

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

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-319-01159-2_3openalex-snapshot

Cloud Conveyors System: A Versatile Application for Exploring Cyber-Physical 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/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-9276-5openalex-snapshot

Using non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs

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

A review of priority assignment in real-time systems

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

MTU configuration for real-time switched Ethernet networks

inferred← citeshttps://doi.org/10.1109/access.2025.3550384openalex-snapshot

Cache-Aware Timing Analysis of Limited Preemption Scheduling With Fixed Preemption Points in Set-Associative Mapping

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

Generalized Fixed-Priority Scheduling with Limited Preemptions

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

Optimizing stack memory requirements for real-time embedded applications

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

Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform

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/rtas68450.2026.00033openalex-snapshot

Time-Predictable Acceleration of Deep Neural Networks on FPGA SoCs with Multi-Core DPUs

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

Global fixed priority scheduling with deferred pre-emption

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

Scheduling Real-Time Packets with Non-preemptive Regions on Priority-Based NoCs

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.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/sies.2012.6356568openalex-snapshot

Global schedulability analysis of a synchronization protocol based on replenishment-bounded overrun for compositional real-time systems

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/sies.2015.7185062openalex-snapshot

Extended support for limited preemption fixed priority scheduling for OSEK/AUTOSAR-compliant operating systems

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/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.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.23919/date.2017.7926990openalex-snapshot

Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform with caches

inferred← citeshttps://doi.org/10.5255/ukda-sn-856905openalex-snapshot

Survey of Ghanaian Lecturers on Teaching Critical Thinking, 2021-2022

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.