On the public citation graph

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

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

0 signed · 62 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-54947-1openalex-snapshot

Specification and Compositional Verification of Real-Time Systems

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-007-9012-7openalex-snapshot

Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised

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/0020-0190(80)90123-4openalex-snapshot

A note on preemptive scheduling of periodic, real-time tasks

inferredcites →https://doi.org/10.1016/0020-0190(81)90066-1openalex-snapshot

Scheduling periodically occurring tasks on multiple processors

inferredcites →https://doi.org/10.1016/0020-0190(83)90117-5openalex-snapshot

Scheduling unit-time tasks with integer release times and deadlines

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

The Spring kernel: a new paradigm for real-time systems

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/real.1989.63567openalex-snapshot

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

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/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/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.1137/0210018openalex-snapshot

Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines

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

Multiple process execution in cache related preemption delay analysis

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

Rapid and low-cost context-switch through embedded processor customization for real-time and control applications

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

Quantifying the cost of context switch

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

Optimal task placement to improve cache performance

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

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

inferredcites →https://doi.org/10.4230/oasics.wcet.2008.1664openalex-snapshot

WCET Analysis for Preemptive 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-031-45410-3_8openalex-snapshot

Limited Preemptive Scheduling

inferred← citeshttps://doi.org/10.1007/978-81-322-2135-7_18openalex-snapshot

Event Monitoring for Adaptive Multi-priority Streaming Time Sensitive-Based EDF 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-015-9220-5openalex-snapshot

Combinatorial abstraction refinement for feasibility analysis of static priorities

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/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/daas.2018.8396064openalex-snapshot

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

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

Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors

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

Efficiency evaluation of overhead control heuristics in DP-Fair multiprocessor scheduling

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

Towards collaborative resource sharing under real-time conditions in multitasking and multicore environments

inferred← citeshttps://doi.org/10.1109/isorc58943.2023.00016openalex-snapshot

A Scheduling Model Inspired by Security Considerations

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

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

inferred← citeshttps://doi.org/10.1109/rtas65571.2025.00027openalex-snapshot

Reconciling ROS 2 with Classical Real-Time Scheduling of Periodic Tasks

inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00038openalex-snapshot

Balancing Security and Schedulability: WCET Evaluation and Security Optimization in CPS

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

Optimal Fixed Priority Scheduling with Deferred Pre-emption

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

Partitioned Fixed-Priority Scheduling of Parallel Tasks Without Preemptions

inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00035openalex-snapshot

RT-MOT: Confidence-Aware Real-Time Scheduling Framework for Multi-Object Tracking Tasks

inferred← citeshttps://doi.org/10.1109/rtss66672.2025.00026openalex-snapshot

CF-DETR: Coarse-to-Fine Transformer for Real-Time Object Detection

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

Probabilistic Response Time Analysis for Fixed Preemption Point Selection

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

An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation

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

Batch-MOT: Batch-Enabled Real-Time Scheduling for Multiobject Tracking Tasks

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

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

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

Parametric utilization bounds for implicit-deadline periodic tasks in automotive 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.2478/s13537-011-0023-zopenalex-snapshot

Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors

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

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.