On the public citation graph

Uniprocessor Scheduling Under Precedence Constraints

https://doi.org/10.1109/rtas.2006.44
0 signed · 23 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/3-540-69346-7_28openalex-snapshot
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
inferredcites →https://doi.org/10.1007/978-3-540-25960-2_22openalex-snapshot
Single Machine Scheduling with Precedence Constraints: Extended Abstract
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.1016/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1016/j.dam.2004.07.009openalex-snapshot
Multiprocessor scheduling under precedence constraints: Polyhedral results
inferredcites →https://doi.org/10.1023/b:time.0000045315.61234.1eopenalex-snapshot
Real Time Scheduling Theory: A Historical Perspective
inferredcites →https://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot
Rate Monotonic vs. EDF: Judgment Day
inferredcites →https://doi.org/10.1109/12.338100openalex-snapshot
How to integrate precedence constraints and shared resources in real-time scheduling
inferredcites →https://doi.org/10.1109/tc.2003.1214341openalex-snapshot
Rate monotonic analysis: the hyperbolic bound
inferredcites →https://doi.org/10.1109/tc.2004.103openalex-snapshot
Schedulability analysis of periodic fixed priority systems
inferredcites →https://doi.org/10.1145/1086228.1086263openalex-snapshot
Efficient embedded software design with synchronous models
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1287/moor.1050.0158openalex-snapshot
Single-Machine Scheduling with Precedence Constraints

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.02.003openalex-snapshot
A capacity sharing and stealing strategy for open real-time systems
inferred← citeshttps://doi.org/10.1109/access.2025.3603030openalex-snapshot
Balancing Power and Performance With Task Dependencies in Multi-Core Systems
inferred← citeshttps://doi.org/10.1109/iccas.2013.6704078openalex-snapshot
A scheduling for periodic robot software components
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536568openalex-snapshot
Shared resources and precedence constraints with capacity sharing and stealing
inferred← citeshttps://doi.org/10.1109/rtas.2008.23openalex-snapshot
Optimizing the Implementation of Communication in Synchronous Reactive Models
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.2007.52openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1109/tse.2007.1017openalex-snapshot
Semantics-Preserving Design of Embedded Control Software from Synchronous Models
inferred← citeshttps://doi.org/10.1109/tse.2007.70718openalex-snapshot
Semantics-Preserving Design of Embedded Control Software from Synchronous Models
inferred← citeshttps://doi.org/10.9790/0661-0744652openalex-snapshot
Performance analysis of N-computing device under various load conditions
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.