On the public citation graph
Proceedings of the 20th International Conference on Real-Time and Network Systems
0 signed · 34 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/bf00365393openalex-snapshot
Stack-based scheduling of realtime processes
inferredcites →https://doi.org/10.1007/bf01088593openalex-snapshot
An extendible approach for analyzing fixed priority hard real-time tasks
inferredcites →https://doi.org/10.1007/bf01995675openalex-snapshot
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
inferredcites →https://doi.org/10.1007/s11241-005-0507-9openalex-snapshot
Measuring the Performance of Schedulability Tests
inferredcites →https://doi.org/10.1007/s11241-006-9010-1openalex-snapshot
Sensitivity analysis for fixed-priority real-time systems
inferredcites →https://doi.org/10.1007/s11241-009-9079-4openalex-snapshot
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
inferredcites →https://doi.org/10.1016/0166-5316(82)90024-4openalex-snapshot
On the complexity of fixed-priority scheduling of periodic, real-time tasks
inferredcites →https://doi.org/10.1049/sej.1993.0034openalex-snapshot
Applying new scheduling theory to static priority pre-emptive scheduling
inferredcites →https://doi.org/10.1093/comjnl/29.5.390openalex-snapshot
Finding Response Times in a Real-Time System
inferredcites →https://doi.org/10.1109/ecrts.2008.26openalex-snapshot
Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications
inferredcites →https://doi.org/10.1109/icons.2007.18openalex-snapshot
Dealing with execution-overruns to improve the temporal robustness of real-time systems scheduled FP and EDF
inferredcites →https://doi.org/10.1109/real.1989.63567openalex-snapshot
The rate monotonic scheduling algorithm: exact characterization and average case behavior
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.1990.128748openalex-snapshot
Fixed priority scheduling of periodic task sets with arbitrary deadlines
inferredcites →https://doi.org/10.1109/rtss.2007.47openalex-snapshot
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
inferredcites →https://doi.org/10.1109/tc.2004.103openalex-snapshot
Schedulability analysis of periodic fixed priority systems
inferredcites →https://doi.org/10.1145/1465611.1465613openalex-snapshot
Multiprogramming for hybrid computation
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/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11704-017-6477-yopenalex-snapshot
Template-based AADL automatic code generation
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.micpro.2017.06.011openalex-snapshot
Hardware-accelerated analysis of real-time Networks-on-Chip
inferred← citeshttps://doi.org/10.1016/j.precisioneng.2011.09.002openalex-snapshot
Effect of sampling jitter and control jitter on positioning error in motion control systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2019.01.001openalex-snapshot
Workload-aware harmonic partitioned scheduling for fixed-priority probabilistic real-time tasks on multiprocessors
inferred← citeshttps://doi.org/10.1016/j.sysarc.2020.101847openalex-snapshot
TARTS: A Temperature-Aware Real-Time Deadline-Partitioned Fair Scheduler
inferred← citeshttps://doi.org/10.1016/j.sysarc.2024.103234openalex-snapshot
Providing spatial isolation for Mixed-Criticality Systems
inferred← citeshttps://doi.org/10.1145/2670529.2754965openalex-snapshot
WCET-Aware Dynamic D-cache Locking for A Single Task
inferred← citeshttps://doi.org/10.1145/2808704.2754965openalex-snapshot
WCET-Aware Dynamic D-cache Locking for A Single Task
inferred← citeshttps://doi.org/10.1145/3046683openalex-snapshot
WCET-Aware Dynamic I-Cache Locking for a Single Task
inferred← citeshttps://doi.org/10.1145/3078633.3081033openalex-snapshot
Integrating task scheduling and cache locking for multicore real-time embedded systems
inferred← citeshttps://doi.org/10.1145/3487581openalex-snapshot
Cache Interference-aware Task Partitioning for Non-preemptive Real-time Multi-core Systems
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.03274openalex-snapshot
Modular Low-Cost Robotics: What Communication Infrastructure?
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.