On the public citation graph

Optimal Fixed Priority Scheduling with Deferred Pre-emption

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

0 signed · 83 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/bf01088593openalex-snapshot

An extendible approach for analyzing fixed priority hard real-time tasks

inferredcites →https://doi.org/10.1007/s11241-005-0507-9openalex-snapshot

Measuring the Performance of Schedulability Tests

inferredcites →https://doi.org/10.1007/s11241-008-9065-2openalex-snapshot

Robust priority assignment for messages on Controller Area Network (CAN)

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/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.1016/s0020-0190(00)00165-4openalex-snapshot

On priority assignment in fixed priority scheduling

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

Finding Response Times in a Real-Time System

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

Sustainable Multiprocessor Scheduling of Sporadic Task Systems

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

Generalized Fixed-Priority Scheduling with Limited Preemptions

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

Scalable real-time system design using preemption thresholds

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

Sustainable Scheduling Analysis

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

Robust Priority Assignment for Fixed Priority Real-Time Systems

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

Real-Time Query Scheduling for Wireless Sensor Networks

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

Response Time Upper Bounds for Fixed Priority Real-Time Systems

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

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

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

Efficient Exact Schedulability Tests for Fixed Priority 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/321738.321743openalex-snapshot

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

inferredcites →https://doi.org/10.5626/jcse.2008.2.1.074openalex-snapshot

Sustainability in Real-time Scheduling

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-39083-3_1openalex-snapshot

Why the Expressive Power of Programming Languages Such as Ada Is Needed for Future Cyber Physical Systems

inferred← citeshttps://doi.org/10.1007/978-981-16-7443-3_7openalex-snapshot

A Survey of Real-Time Scheduling on Multiprocessor Systems

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

Real-time uniprocessor scheduling with fewer preemptions

inferred← citeshttps://doi.org/10.1007/s10664-022-10170-1openalex-snapshot

Optimal priority assignment for real-time systems: a coevolution-based approach

inferred← citeshttps://doi.org/10.1007/s11241-015-9233-0openalex-snapshot

Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms

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.1007/s11241-017-9294-3openalex-snapshot

Exact speedup factors and sub-optimality for non-preemptive scheduling

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.jss.2017.09.008openalex-snapshot

Efficient exact Boolean schedulability tests for fixed priority preemption threshold scheduling

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.1109/access.2020.3031039openalex-snapshot

FANTOM: Fault Tolerant Task-Drop Aware Scheduling for Mixed-Criticality Systems

inferred← citeshttps://doi.org/10.1109/ciss.2015.7086884openalex-snapshot

Energy-aware real-time scheduling on Heterogeneous Multi-Processor

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

The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks

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

Explicit Preemption Placement for Real-Time Conditional Code

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

Limited preemptive scheduling of non-independent task sets

inferred← citeshttps://doi.org/10.1109/icess.2016.41openalex-snapshot

A Non-Work-Conserving Model for P-FRP Fixed Priority Scheduling

inferred← citeshttps://doi.org/10.1109/isorc.2018.00033openalex-snapshot

Design and Analysis for Dual Priority Scheduling

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

Memory efficient global scheduling of real-time tasks

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

Global fixed priority scheduling with deferred pre-emption

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

Priority-Based Functional Reactive Programming (P-FRP) Using Deferred Abort

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

An optimal spin-lock priority assignment algorithm for real-time multi-core systems

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

Adaptive Mixed Criticality Scheduling with Deferred Preemption

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/rtss49844.2020.00020openalex-snapshot

Non-Preemptive Real-Time Multiprocessor Scheduling Beyond Work-Conserving

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

Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1109/tc.2018.2878835openalex-snapshot

The Concept of Unschedulability Core for Optimizing Real-Time Systems with Fixed-Priority Scheduling

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

Speeding Up the Schedulability Analysis and Priority Assignment of Sporadic Tasks Under Uniprocessor FPNS

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

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

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

Mixed criticality systems with weakly-hard constraints

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

Multiprocessor fixed priority scheduling with limited preemptions

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

A Survey of Research into Mixed Criticality Systems

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.17877/de290r-16409openalex-snapshot

Tight integration of cache, path and task-interference modeling for the analysis of hard real time systems

inferred← citeshttps://doi.org/10.23919/date.2017.7926988openalex-snapshot

The concept of unschedulability core for optimizing priority assignment in real-time systems

inferred← citeshttps://doi.org/10.38094/jastt1215openalex-snapshot

CPU Scheduling Techniques: A Review on Novel Approaches Strategy and Performance Assessment

inferred← citeshttps://doi.org/10.4230/lites-v004-i002-a003openalex-snapshot

Per Processor Spin-Based Protocols for Multiprocessor Real-Time Systems

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

inferred← citeshttps://doi.org/10.70675/78874886z37d7z4d0cz910fza71e85a31328openalex-snapshot

Adaptability and reconfiguration of automotive embedded 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.