On the public citation graph
Towards Feasible Region Calculus: An End-to-End Schedulability Analysis of Real-Time Multistage Execution
0 signed · 37 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/emrts.2001.934000openalex-snapshot
A hyperbolic bound for the rate monotonic algorithm
inferredcites →https://doi.org/10.1109/emrts.2001.934003openalex-snapshot
Minimum and maximum utilization bounds for multiprocessor RM scheduling
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.1999.818856openalex-snapshot
Sharing resources among periodic and aperiodic tasks with dynamic deadlines
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.2003.1203049openalex-snapshot
Global multiprocessor scheduling of aperiodic tasks using time-independent priorities
inferredcites →https://doi.org/10.1109/tc.2004.1261839openalex-snapshot
A utilization bound for aperiodic tasks and priority driven scheduling
inferredcites →https://doi.org/10.1109/tpds.2004.25openalex-snapshot
Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling
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/358818.358824openalex-snapshot
Experience with processes and monitors in Mesa
inferredcites →https://doi.org/10.1145/58612.59371openalex-snapshot
The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks
inferredcites →https://doi.org/10.1145/59368.59371openalex-snapshot
The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks
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-662-48453-1_9openalex-snapshot
Infrastrukturen werden intelligent
inferred← citeshttps://doi.org/10.1007/978-3-662-59717-0_9openalex-snapshot
Infrastructures Become Intelligent
inferred← citeshttps://doi.org/10.1007/s11241-008-9056-3openalex-snapshot
Delay composition in preemptive and non-preemptive real-time pipelines
inferred← citeshttps://doi.org/10.1007/s11241-020-09352-1openalex-snapshot
Co-scheduling aperiodic real-time tasks with end-to-end firm and soft deadlines in two-stage systems
inferred← citeshttps://doi.org/10.1109/ecrts.2007.80openalex-snapshot
A Delay Composition Theorem for Real-Time Pipelines
inferred← citeshttps://doi.org/10.1109/ecrts.2008.31openalex-snapshot
Transforming Distributed Acyclic Systems into Equivalent Uniprocessors under Preemptive and Non-Preemptive Scheduling
inferred← citeshttps://doi.org/10.1109/ispa.2011.27openalex-snapshot
End-to-End Schedulability Analysis for Bi-directional Real-Time Multistage Pipeline
inferred← citeshttps://doi.org/10.1109/rtcsa.2006.35openalex-snapshot
Generalized Rate Analysis for Media-Processing Platforms
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/rtss.2008.38openalex-snapshot
Delay Composition Algebra: A Reduction-Based Schedulability Algebra for Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtss.2011.24openalex-snapshot
Meeting End-to-End Deadlines through Distributed Local Deadline Assignments
inferred← citeshttps://doi.org/10.1109/soca.2012.6449453openalex-snapshot
Real-time service process scheduling with intermediate deadline overrun management
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/tc.2013.100openalex-snapshot
An On-Line Capacity-Based Admission Control for Real-Time Service Processes
inferred← citeshttps://doi.org/10.17323/2500-2597.2020.4.10.19openalex-snapshot
Technology Foresight and Sustainable Innovation Development in the Complex Dynamical Systems View
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.