On the public citation graph
Response Time Upper Bounds for Fixed Priority Real-Time Systems
0 signed · 73 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-63875-x_44openalex-snapshot
Sensitivity analysis of real-time task sets
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-007-9012-7openalex-snapshot
Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised
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/j.ipl.2007.04.006openalex-snapshot
Optimal -monotonic priority assignment
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/12.57058openalex-snapshot
Priority inheritance protocols: an approach to real-time synchronization
inferredcites →https://doi.org/10.1109/ecrts.2005.1openalex-snapshot
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines
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.2003.1212722openalex-snapshot
Initial values for online response time calculations
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.1998.739773openalex-snapshot
Improved response-time analysis calculations
inferredcites →https://doi.org/10.1109/rtas.2007.17openalex-snapshot
Minimising Task Migration and Priority Changes in Mode Transitions
inferredcites →https://doi.org/10.1109/rtcsa.2007.54openalex-snapshot
Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters
inferredcites →https://doi.org/10.1109/tc.2003.1183948openalex-snapshot
An improved rate-monotonic admission control and its applications
inferredcites →https://doi.org/10.1109/tc.2003.1214341openalex-snapshot
Rate monotonic analysis: the hyperbolic bound
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.1145/1465611.1465613openalex-snapshot
Multiprogramming for hybrid computation
inferredcites →https://doi.org/10.1145/1478873.1478995openalex-snapshot
Scheduling of time critical processes
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-030-47487-4openalex-snapshot
A Journey of Embedded and Cyber-Physical Systems : Essays Dedicated to Peter Marwedel on the Occasion of His 70th Birthday
inferred← citeshttps://doi.org/10.1007/978-3-030-47487-4_4openalex-snapshot
On the Formalism and Properties of Timing Analyses in Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_33openalex-snapshot
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks
inferred← citeshttps://doi.org/10.1007/978-3-319-33810-1_3openalex-snapshot
Improving the Efficiency of Schedulability Tests for Fixed Priority Preemptive Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-16256-5_13openalex-snapshot
On the Schedulability Analysis for Dynamic QoS Management in Distributed Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-18378-2_20openalex-snapshot
Determining Actual Response Time in P-FRP
inferred← citeshttps://doi.org/10.1007/s11241-009-9078-5openalex-snapshot
Approximation techniques for response-time analysis of static-priority tasks
inferred← citeshttps://doi.org/10.1007/s11241-011-9137-6openalex-snapshot
Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
inferred← citeshttps://doi.org/10.1007/s11241-017-9282-7openalex-snapshot
Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
inferred← citeshttps://doi.org/10.1007/s11241-024-09423-7openalex-snapshot
Minimizing cache usage with fixed-priority and earliest deadline first scheduling
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.08.001openalex-snapshot
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2012.11.003openalex-snapshot
Modeling and efficient solving of extra-functional properties for adaptation in networked embedded real-time systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2023.102928openalex-snapshot
Compositional verification of embedded real-time systems
inferred← citeshttps://doi.org/10.1109/access.2022.3143037openalex-snapshot
A Schedulability Test for Sporadic Task DM Scheduling Based on Density Upper Bound
inferred← citeshttps://doi.org/10.1109/compsac61105.2024.00019openalex-snapshot
Scalable Computation of Inter-Core Bounds Through Exact Abstractions
inferred← citeshttps://doi.org/10.1109/ecrts.2010.27openalex-snapshot
A Polynomial-Time Algorithm for Computing Response Time Bounds in Static Priority Scheduling Employing Multi-linear Workload Bounds
inferred← citeshttps://doi.org/10.1109/etfa.2010.5641165openalex-snapshot
Exploiting harmonic periods to improve linearly approximated response-time upper bounds
inferred← citeshttps://doi.org/10.1109/etfa.2010.5641360openalex-snapshot
Utilization-based schedulability analysis for switched Ethernet aiming dynamic QoS management
inferred← citeshttps://doi.org/10.1109/etfa.2018.8502493openalex-snapshot
A Sensitivity Analysis for Mixed Criticality: Trading Criticality with Computational Resource
inferred← citeshttps://doi.org/10.1109/hpcc-css-icess.2015.298openalex-snapshot
Design-Space Reduction for Architectural Optimization of Automotive Embedded Systems
inferred← citeshttps://doi.org/10.1109/icct62411.2024.10946326openalex-snapshot
Real-Time DAG Task Allocation Strategy for Multiprocessor by Optimistic Parallelism
inferred← citeshttps://doi.org/10.1109/isorc.2011.26openalex-snapshot
Determining Actual Response Time in P-FRP Using Idle-Period Game Board
inferred← citeshttps://doi.org/10.1109/ojies.2024.3373232openalex-snapshot
A Scalable Real-Time SDN-Based MQTT Framework for Industrial Applications
inferred← citeshttps://doi.org/10.1109/rtas.2014.6925990openalex-snapshot
Schedulability tests for tasks with Variable Rate-dependent Behaviour under fixed priority scheduling
inferred← citeshttps://doi.org/10.1109/rtas58335.2023.00033openalex-snapshot
Work in Progress: Response Time Analysis of Real-Time Quantum Computing Systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.28openalex-snapshot
Schedulability Analysis for Real-Time P-FRP Tasks under Fixed Priority Scheduling
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.2015.9openalex-snapshot
A Quadratic-Time Response Time Upper Bound with a Tightness Property
inferred← citeshttps://doi.org/10.1109/saso.2011.19openalex-snapshot
Towards Self-Adaptation in Real-Time, Networked Systems: Efficient Solving of System Constraints for Automotive Embedded Systems
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/tc.2015.2449857openalex-snapshot
Transparent Real-Time Task Scheduling on Temporal Resource Partitions
inferred← citeshttps://doi.org/10.1109/trustcom.2011.131openalex-snapshot
Release Offset Bounds for Response Time Analysis of P-FRP Using Exhaustive Enumeration
inferred← citeshttps://doi.org/10.1109/wfcs.2012.6242539openalex-snapshot
Controller Area Network (CAN): Response time analysis with offsets
inferred← citeshttps://doi.org/10.1145/2452537.2452544openalex-snapshot
Traffic shaping to reduce jitter in controller area network (CAN)
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/2834848.2834849openalex-snapshot
Response time bounds for sporadic arbitrary-deadline tasks under global fixed-priority scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1145/2966986.2967042openalex-snapshot
Formulating customized specifications for resource allocation problem of distributed embedded systems
inferred← citeshttps://doi.org/10.1145/3696355.3696358openalex-snapshot
The Power of Duality: Response Time Analysis meets Integer Programming
inferred← citeshttps://doi.org/10.1145/3696355.3696359openalex-snapshot
Online Admission Test for Real-Time Tasks with Arrival Curves for Server Platforms
inferred← citeshttps://doi.org/10.1155/2016/5196092openalex-snapshot
Bounds on Worst-Case Deadline Failure Probabilities in Controller Area Networks
inferred← citeshttps://doi.org/10.1234/rci.v2i3.55openalex-snapshot
Diseño y análisis de tiempo real de un controlador para motor de corriente directa
inferred← citeshttps://doi.org/10.13084/2175-8018.v03n06a04openalex-snapshot
Generación de Tareas Periódicas y Aperiódicas para Simulación de Sistemas de Tiempo Real
inferred← citeshttps://doi.org/10.23919/date.2019.8715017openalex-snapshot
Simple and General Methods for Fixed-Priority Schedulability in Optimization Problems
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539203openalex-snapshot
Simultaneous Multithreading and Common-Period Sporadic Tasks in Hard Real-Time
inferred← citeshttps://doi.org/10.3390/electronics14010098openalex-snapshot
A Tetris-Based Task Allocation Strategy for Real-Time Operating Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1912.01161openalex-snapshot
Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter
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.