On the public citation graph

Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization

0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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/s10951-009-0137-5openalex-snapshot
Open problems in real-time scheduling
inferredcites →https://doi.org/10.1016/0020-0190(80)90123-4openalex-snapshot
A note on preemptive scheduling of periodic, real-time tasks
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/ecrts.2015.32openalex-snapshot
Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines Is Strongly coNP-Complete
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.1137/1.9781611973075.83openalex-snapshot
EDF-schedulability of synchronous periodic task systems is coNP-hard
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-031-73751-0_1openalex-snapshot
All About Time
inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_1openalex-snapshot
Towards Customizable CPS: Composability, Efficiency and Predictability
inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_35openalex-snapshot
Complexity of Uniprocessor Scheduling Analysis
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_35-1openalex-snapshot
Complexity of Uniprocessor Scheduling Analysis
inferred← citeshttps://doi.org/10.1007/s11241-017-9279-2openalex-snapshot
Parameter adaptation for generalized multiframe tasks: schedulability analysis, case study, and applications to self-suspending tasks
inferred← citeshttps://doi.org/10.1109/isorc58943.2023.00016openalex-snapshot
A Scheduling Model Inspired by Security Considerations
inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00038openalex-snapshot
Balancing Security and Schedulability: WCET Evaluation and Security Optimization in CPS
inferred← citeshttps://doi.org/10.1109/rtcsa.2016.15openalex-snapshot
Parameter Adaption for Generalized Multiframe Tasks and Applications to Self-Suspending Tasks
inferred← citeshttps://doi.org/10.1109/rtcsa.2019.8864569openalex-snapshot
Cutting the Unnecessary Deadlines in EDF
inferred← citeshttps://doi.org/10.1109/rtss.2017.00020openalex-snapshot
Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00036openalex-snapshot
Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland’s Bound
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00040openalex-snapshot
Partitioned Scheduling of Recurrent Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00046openalex-snapshot
Tighter Bounds of Speedup Factor of Partitioned EDF for Constrained-Deadline Sporadic Tasks
inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00011openalex-snapshot
Rethinking Tractability for Schedulability Analysis
inferred← citeshttps://doi.org/10.1109/sate.2016.29openalex-snapshot
Keynote
inferred← citeshttps://doi.org/10.1145/2997465.2997498openalex-snapshot
MILP-based Deadline Assignment for End-to-End Flows in Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.1145/3696355.3696362openalex-snapshot
Schedulability Analysis and Performance Optimization for Constrained-Deadline Elastic 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.