On the public citation graph
Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systems
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.1007/bf00365326openalex-snapshot
Dynamic scheduling of real-time tasks under precedence constraints
inferredcites →https://doi.org/10.1007/bf02341920openalex-snapshot
Aperiodic task scheduling for Hard-Real-Time systems
inferredcites →https://doi.org/10.1109/proc.1977.10604openalex-snapshot
Queueing systems, Vol. I: Theory
inferredcites →https://doi.org/10.1109/real.1989.63582openalex-snapshot
Analysis of a synchronization and scheduling discipline for real-time tasks with preemption constraints
inferredcites →https://doi.org/10.1109/real.1992.242671openalex-snapshot
An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems
inferredcites →https://doi.org/10.1145/107971.107976openalex-snapshot
Scheduling periodic and aperiodic tasks in hard real-time computing 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.1002/0471028959.sof276openalex-snapshot
Design of Real‐Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-46506-5_11openalex-snapshot
Scheduling of Real-Time Tasks with Complex Constraints
inferred← citeshttps://doi.org/10.1016/0066-4138(94)90087-6openalex-snapshot
The development of an Artificial Intelligence real-time toolkit: REAKT
inferred← citeshttps://doi.org/10.1016/b978-0-08-042236-7.50056-0openalex-snapshot
The Development of an Artificial Intelligence Real-Time Toolkit: REAKT
inferred← citeshttps://doi.org/10.1016/j.tra.2015.03.016openalex-snapshot
Prioritizing road extension projects with interdependent benefits under time constraint
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00111-1openalex-snapshot
Dynamic real-time channel establishment in multiple access bus networks
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)39936-6openalex-snapshot
Improving Temporal Behavior with Graphical Method in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/32.601081openalex-snapshot
An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems
inferred← citeshttps://doi.org/10.1109/delta.2004.10041openalex-snapshot
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks
inferred← citeshttps://doi.org/10.1109/emwrts.1996.557932openalex-snapshot
A near-optimal algorithm for scheduling soft-aperiodic requests in dynamic priority systems
inferred← citeshttps://doi.org/10.1109/etfa.1999.813085openalex-snapshot
Performance evaluation of four field buses
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9500597openalex-snapshot
HLF-D*: An Approximate Greedy Policy for Age-based Information Freshness of Real-time Updates
inferred← citeshttps://doi.org/10.1109/iceccs.1996.558392openalex-snapshot
An iterative method of task temporal parameter adjustment in hard real-time systems
inferred← citeshttps://doi.org/10.1109/iceccs.1996.558420openalex-snapshot
Alternative priority scheduling in dynamic priority systems
inferred← citeshttps://doi.org/10.1109/icpp.2011.69openalex-snapshot
Combining Hard Periodic and Soft Aperiodic Real-Time Task Scheduling on Heterogeneous Compute Resources
inferred← citeshttps://doi.org/10.1109/isie.1999.801754openalex-snapshot
A hardware scheduler for complex real-time systems
inferred← citeshttps://doi.org/10.1109/rtcsa.1995.528753openalex-snapshot
A soft aperiodic task scheduling algorithm in dynamic-priority systems
inferred← citeshttps://doi.org/10.1109/rtcsa.1996.554989openalex-snapshot
Optimal aperiodic scheduling for dynamic-priority systems
inferred← citeshttps://doi.org/10.1109/rtcsa.1996.554992openalex-snapshot
Scheduling of hard-aperiodic requests in dynamic priority systems
inferred← citeshttps://doi.org/10.1109/rtcsa.1999.811293openalex-snapshot
Soft aperiodic task scheduling on hard real-time multiprocessor systems
inferred← citeshttps://doi.org/10.1109/rtcsa.2005.72openalex-snapshot
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
inferred← citeshttps://doi.org/10.1109/tc.2003.1183950openalex-snapshot
A fault-tolerant scheduling algorithm for real-time periodic tasks with possible software faults
inferred← citeshttps://doi.org/10.1109/wfcs.1997.634296openalex-snapshot
A performance analysis of distributed hard-real time applications
inferred← citeshttps://doi.org/10.1145/353171.353174openalex-snapshot
Object-oriented real-time concurrency
inferred← citeshttps://doi.org/10.1145/354222.353174openalex-snapshot
Object-oriented real-time concurrency
inferred← citeshttps://doi.org/10.2498/cit.2000.03.06openalex-snapshot
A Hardware Architecture for Scheduling Complex Real-Time Task Sets
inferred← citeshttps://doi.org/10.2514/6.1995-989openalex-snapshot
A real-time performability evaluation tool
inferred← citeshttps://doi.org/10.5555/968879.969132openalex-snapshot
Quasi-static scheduling for real-time systems with hard and soft tasks
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.