On the public citation graph

A Quadratic-Time Response Time Upper Bound with a Tightness Property

https://doi.org/10.1109/rtss.2015.9
0 signed · 41 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/bf01088593openalex-snapshot
An extendible approach for analyzing fixed priority hard real-time tasks
inferredcites →https://doi.org/10.1007/s11241-011-9137-6openalex-snapshot
Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
inferredcites →https://doi.org/10.1016/0165-6074(94)90080-9openalex-snapshot
Holistic schedulability analysis for distributed hard real-time systems
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.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.2004.4openalex-snapshot
An event stream driven approximation for the analysis of real-time systems
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/emrts.2004.1311020openalex-snapshot
An event stream driven approximation for the analysis of real-time systems
inferredcites →https://doi.org/10.1109/emwrts.1997.613774openalex-snapshot
On the schedulability analysis for distributed hard real-time systems
inferredcites →https://doi.org/10.1109/etfa.2010.5641165openalex-snapshot
Exploiting harmonic periods to improve linearly approximated response-time upper bounds
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.2015.7108445openalex-snapshot
Budgeted generalized rate monotonic analysis for the partitioned, yet globally scheduled uniprocessor model
inferredcites →https://doi.org/10.1109/rtss.2007.31openalex-snapshot
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/rtss.2007.41openalex-snapshot
Adapting Futures: Scalability for Real-World Computing
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.2008.25openalex-snapshot
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard
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/rtss.2013.31openalex-snapshot
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
inferredcites →https://doi.org/10.1109/rtss.2016.041openalex-snapshot
k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis
inferredcites →https://doi.org/10.1109/rttas.1996.509537openalex-snapshot
Adding instruction cache effect to schedulability analysis of preemptive real-time systems
inferredcites →https://doi.org/10.1109/tc.2008.167openalex-snapshot
A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
inferredcites →https://doi.org/10.1109/tc.2013.209openalex-snapshot
The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks
inferredcites →https://doi.org/10.1109/tc.2014.2346178openalex-snapshot
An fptas for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation
inferredcites →https://doi.org/10.1145/2362336.2362352openalex-snapshot
Optimization of task allocation and priority assignment in hard real-time distributed systems
inferredcites →https://doi.org/10.1145/24068.24069openalex-snapshot
Response times in level-structured 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-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/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.1109/hpcc-css-icess.2015.276openalex-snapshot
Simulation-Driven Optimization of Real-Time Control Tasks
inferred← citeshttps://doi.org/10.1109/rtss.2016.037openalex-snapshot
Systems with Dynamic Real-Time Guarantees in Uncertain and Faulty Execution Environments
inferred← citeshttps://doi.org/10.1109/rtss.2016.041openalex-snapshot
k2Q: A Quadratic-Form Response Time and Schedulability Analysis Framework for Utilization-Based Analysis
inferred← citeshttps://doi.org/10.1145/2997465.2997483openalex-snapshot
Quantifying the Effect of Period Ratios on Schedulability of Rate Monotonic
inferred← citeshttps://doi.org/10.1145/3313151.3313168openalex-snapshot
Optimization techniques for time-critical cyber-physical 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.23919/date.2019.8715017openalex-snapshot
Simple and General Methods for Fixed-Priority Schedulability in Optimization Problems
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.