On the public citation graph
Exact Admission-Control for Integrated Aperiodic and Periodic Tasks
0 signed · 33 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/978-1-4615-5535-3_3openalex-snapshot
Fundamentals of EDF Scheduling
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.1017/9781009260350.002openalex-snapshot
Algorithms+Data Structures = Programs
inferredcites →https://doi.org/10.1109/ipdps.2003.1213083openalex-snapshot
Partitioned aperiodic scheduling on multiprocessors
inferredcites →https://doi.org/10.1109/real.1995.495205openalex-snapshot
Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems
inferredcites →https://doi.org/10.1109/real.1998.739726openalex-snapshot
Integrating multimedia applications in hard real-time systems
inferredcites →https://doi.org/10.1109/real.2001.990610openalex-snapshot
Static-priority scheduling on multiprocessors
inferredcites →https://doi.org/10.1109/real.2002.1181563openalex-snapshot
Analysis of a reservation-based feedback scheduler
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/rttas.2000.852461openalex-snapshot
Efficient scheduling of real-time multi-task applications in dynamic systems
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/rttas.2002.1137392openalex-snapshot
The aperiodic multiprocessor utilization bound for liquid tasks
inferredcites →https://doi.org/10.1109/sfcs.1991.185354openalex-snapshot
On-line scheduling in the presence of overload
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/tse.1989.559777openalex-snapshot
Some Results of the Earliest Deadline Scheduling Algorithm
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2583458openalex-snapshot
Knapsack Problems: Algorithms and Computer Implementations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/ecrts.2006.7openalex-snapshot
Clairvoyant Non-Preemptive EDF Scheduling
inferred← citeshttps://doi.org/10.1109/icdcs.2008.96openalex-snapshot
Reconfigurable Real-Time Middleware for Distributed Cyber-Physical Systems with Aperiodic Events
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/rtas.2006.32openalex-snapshot
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
inferred← citeshttps://doi.org/10.1109/rtas.2007.16openalex-snapshot
Middleware Support for Aperiodic Tasks in Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtss.2005.42openalex-snapshot
Towards Feasible Region Calculus: An End-to-End Schedulability Analysis of Real-Time Multistage Execution
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.2018.2882451openalex-snapshot
Handling Transients of Dynamic Real-Time Workload Under EDF Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2009.67openalex-snapshot
Configurable Middleware for Distributed Real-Time Systems with Aperiodic and Periodic Tasks
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/2442116.2442119openalex-snapshot
Robustness analysis for battery-supported cyber-physical systems
inferred← citeshttps://doi.org/10.7936/k7cf9ncbopenalex-snapshot
Customizing Component Middleware for Distributed Real-Time Systems with Aperiodic and Periodic Tasks
inferred← citeshttps://doi.org/10.7936/k7fx77nnopenalex-snapshot
Roadmap Analysis of Protein-Protein Interactions. Master's Thesis, August 2007
showing the first 14 of 15 · page through all 15
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.