On the public citation graph

Resource Augmentation Bounds for Approximate Demand Bound Functions

https://doi.org/10.1109/rtss.2011.32
0 signed · 42 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.1109/date.2005.128openalex-snapshot
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling
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/emrts.2004.1311020openalex-snapshot
An event stream driven approximation for the analysis of real-time systems
inferredcites →https://doi.org/10.1109/icppw.2009.32openalex-snapshot
How Hard is Partitioning for the Sporadic Task Model?
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.2002.1181571openalex-snapshot
Approximate schedulability analysis
inferredcites →https://doi.org/10.1109/rtss.2005.40openalex-snapshot
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
inferredcites →https://doi.org/10.1109/tc.2006.113openalex-snapshot
The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1137/1.9781611973075.83openalex-snapshot
EDF-schedulability of synchronous periodic task systems is coNP-hard
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results

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-642-31594-7_56openalex-snapshot
Assigning Sporadic Tasks to Unrelated Parallel Machines
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/s10107-014-0786-9openalex-snapshot
Assigning sporadic tasks to unrelated machines
inferred← citeshttps://doi.org/10.1007/s11241-013-9191-3openalex-snapshot
Task assignment algorithms for two-type heterogeneous multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-016-9255-2openalex-snapshot
Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104743openalex-snapshot
Narrowing the speedup factor gap of partitioned EDF
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.014openalex-snapshot
Online dynamic power management with hard real-time guarantees
inferred← citeshttps://doi.org/10.1109/access.2019.2932799openalex-snapshot
Co-Scheduling of Hybrid Transactions on Multiprocessor Real-Time Database Systems
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509640openalex-snapshot
Real-time partitioned scheduling on multi-core systems with local and global memories
inferred← citeshttps://doi.org/10.1109/ecrts.2012.43openalex-snapshot
Partitioned Packing and Scheduling for Sporadic Real-Time Tasks in Identical Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2016.26openalex-snapshot
Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/ipdps.2016.47openalex-snapshot
Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines
inferred← citeshttps://doi.org/10.1109/rtcsa.2014.6910509openalex-snapshot
Computation offloading for sporadic real-time tasks
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00025openalex-snapshot
Demand Characterization of CPS with Conditionally-Enabled Sensors
inferred← citeshttps://doi.org/10.1109/rtss.2011.19openalex-snapshot
Workload-Aware Partitioning for Maintaining Temporal Consistency upon Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtss.2013.42openalex-snapshot
Task Set Synthesis with Cost Minimization for Sporadic Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtss.2014.31openalex-snapshot
Fixed-Relative-Deadline Scheduling of Hard Real-Time Tasks with Self-Suspensions
inferred← citeshttps://doi.org/10.1109/rtss.2017.00039openalex-snapshot
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization
inferred← citeshttps://doi.org/10.1109/rtss.2018.00058openalex-snapshot
An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00046openalex-snapshot
Tighter Bounds of Speedup Factor of Partitioned EDF for Constrained-Deadline Sporadic Tasks
inferred← citeshttps://doi.org/10.1109/tc.2015.2448088openalex-snapshot
Temporal Consistency Maintenance Upon Partitioned Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/tcad.2020.2994265openalex-snapshot
Limited Busy Periods in Response Time Analysis for Tasks Under Global EDF Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2013.2297308openalex-snapshot
Real-Time Task Scheduling on Island-Based Multi-Core Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2017.2679195openalex-snapshot
Improved Carry-in Workload Estimation for Global Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1145/2380356.2380384openalex-snapshot
Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams
inferred← citeshttps://doi.org/10.1145/2897937.2898046openalex-snapshot
MIRROR
inferred← citeshttps://doi.org/10.1145/2997465.2997497openalex-snapshot
Uniprocessor Scheduling Strategies for Self-Suspending Task Systems
inferred← citeshttps://doi.org/10.1145/3696355.3696362openalex-snapshot
Schedulability Analysis and Performance Optimization for Constrained-Deadline Elastic Tasks
inferred← citeshttps://doi.org/10.17148/ijarcce.2015.45158openalex-snapshot
Survey on Optimal Schedulability Test for Hard Real Time Scheduling
inferred← citeshttps://doi.org/10.26481/dis.20130201cropenalex-snapshot
The power of simple scheduling policies
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.