On the public citation graph
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
0 signed · 36 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.1016/0164-1212(95)00105-0openalex-snapshot
Fixed-priority scheduling of real-time systems using utilization bounds
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.368008openalex-snapshot
The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environments
inferredcites →https://doi.org/10.1109/12.729793openalex-snapshot
Minimum achievable utilization for fault-tolerant processing of periodic tasks
inferredcites →https://doi.org/10.1109/32.249662openalex-snapshot
Modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines
inferredcites →https://doi.org/10.1109/32.637146openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/emrts.2001.934000openalex-snapshot
A hyperbolic bound for the rate monotonic algorithm
inferredcites →https://doi.org/10.1109/emrts.2003.1212737openalex-snapshot
A synthetic utilization bound for aperiodic tasks with resource requirements
inferredcites →https://doi.org/10.1109/icdcs.2004.1281610openalex-snapshot
A feasible region for meeting aperiodic end-to-end deadlines in resource pipelines
inferredcites →https://doi.org/10.1109/real.1991.160369openalex-snapshot
Load adjustment in adaptive real-time systems
inferredcites →https://doi.org/10.1109/real.1994.342733openalex-snapshot
Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing
inferredcites →https://doi.org/10.1109/real.1996.563696openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/real.1998.739735openalex-snapshot
A better polynomial-time schedulability test for real-time multiframe tasks
inferredcites →https://doi.org/10.1109/real.2001.990607openalex-snapshot
Aperiodic servers with resource constraints
inferredcites →https://doi.org/10.1109/rtas.2005.22openalex-snapshot
Exact Admission-Control for Integrated Aperiodic and Periodic Tasks
inferredcites →https://doi.org/10.1109/rtas.2005.35openalex-snapshot
On Schedulability Bounds of Static Priority Schedulers
inferredcites →https://doi.org/10.1109/rttas.2001.929862openalex-snapshot
Schedulability analysis and utilization bounds for highly scalable real-time services
inferredcites →https://doi.org/10.1109/wiapp.1999.788017openalex-snapshot
Lifetime behavior and its impact on Web caching
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-319-12436-0_19openalex-snapshot
Fixed-Priority Scheduling Policies and Their Non-utilization Bounds
inferred← citeshttps://doi.org/10.1007/s11241-011-9141-xopenalex-snapshot
Hierarchical CPU utilization control for real-time guarantees in power grid computing
inferred← citeshttps://doi.org/10.1007/s11241-014-9216-6openalex-snapshot
Utilization-based admission control for aperiodic tasks under EDF scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2009.19openalex-snapshot
Hierarchical Utilization Control for Real-Time and Resilient Power Grid
inferred← citeshttps://doi.org/10.1109/icces.2008.4772957openalex-snapshot
On the acceptance tests of aperiodic real-time tasks for FPGAs
inferred← citeshttps://doi.org/10.1109/icdcs.2010.73openalex-snapshot
Reliability Calculus: A Theoretical Framework to Analyze Communication Reliability
inferred← citeshttps://doi.org/10.1109/icist.2011.5765199openalex-snapshot
On a laxity-based real-time scheduling policy for fixed-priority tasks and its non-utilization bound
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935062openalex-snapshot
Scheduling design and analysis for end-to-end heterogeneous flows in an avionics network
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161205openalex-snapshot
On the acceptance tests of aperiodic real-time tasks for FPGAs
inferred← citeshttps://doi.org/10.1109/rtcsa.2013.6732236openalex-snapshot
A new utilization based admission control algorithm for aperiodic tasks with constant time complexity under EDF scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2007.26openalex-snapshot
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers
inferred← citeshttps://doi.org/10.1109/tc.2010.31openalex-snapshot
A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tpds.2009.42openalex-snapshot
FIT: A Flexible, Lightweight, and Real-Time Scheduling System for Wireless Sensor Platforms
inferred← citeshttps://doi.org/10.1109/tpds.2012.51openalex-snapshot
Scheduling Heterogeneous Flows with Delay-Aware Deduplication for Avionics Applications
inferred← citeshttps://doi.org/10.1145/1952522.1952524openalex-snapshot
Nonutilization bounds and feasible regions for arbitrary fixed-priority policies
inferred← citeshttps://doi.org/10.1145/2185395.2185398openalex-snapshot
Sharp utilization thresholds for some realtime scheduling problems
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.