On the public citation graph

The Partitioned EDF Scheduling of Sporadic Task Systems

https://doi.org/10.1109/rtss.2011.18
0 signed · 32 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/s11241-007-9022-5openalex-snapshot
The partitioned dynamic-priority scheduling of sporadic task systems
inferredcites →https://doi.org/10.1023/b:time.0000033378.56741.14openalex-snapshot
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems
inferredcites →https://doi.org/10.1109/ecrts.2004.4openalex-snapshot
An event stream driven approximation for the analysis of real-time systems
inferredcites →https://doi.org/10.1109/ecrts.2011.20openalex-snapshot
Is Semi-Partitioned Scheduling Practical?
inferredcites →https://doi.org/10.1109/emrts.2000.853989openalex-snapshot
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
inferredcites →https://doi.org/10.1109/emrts.2004.1311020openalex-snapshot
An event stream driven approximation for the analysis of real-time systems
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/rtas.2011.32openalex-snapshot
A Lookup-Table Driven Approach to Partitioned Scheduling
inferredcites →https://doi.org/10.1109/rtcsa.2005.75openalex-snapshot
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small
inferredcites →https://doi.org/10.1109/rtss.2006.47openalex-snapshot
Sustainable Scheduling Analysis
inferredcites →https://doi.org/10.1109/tc.2009.58openalex-snapshot
Schedulability Analysis for Real-Time Systems with EDF Scheduling
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
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.17615/nyex-d314openalex-snapshot
The multiprocessor real-time scheduling of general task systems

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-319-01159-2_3openalex-snapshot
Cloud Conveyors System: A Versatile Application for Exploring Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/s11241-013-9181-5openalex-snapshot
Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103775openalex-snapshot
Resource-efficient scheduling of parallel DAG tasks on identical multiprocessors
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509640openalex-snapshot
Real-time partitioned scheduling on multi-core systems with local and global memories
inferred← citeshttps://doi.org/10.1109/ecrts.2012.43openalex-snapshot
Partitioned Packing and Scheduling for Sporadic Real-Time Tasks in Identical Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2016.26openalex-snapshot
Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtas.2015.7108440openalex-snapshot
Task placement and selection of data consistency mechanisms for real-time multicore applications
inferred← citeshttps://doi.org/10.1109/rtss.2017.00039openalex-snapshot
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization
inferred← citeshttps://doi.org/10.1109/sbesc.2014.32openalex-snapshot
Revealing the Secrets of RUN and QPS: New Trends for Optimal Real-Time Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/sies.2013.6601470openalex-snapshot
Efficient partitioning of sporadic real-time tasks with shared resources and spin locks
inferred← citeshttps://doi.org/10.11113/jt.v77.6204openalex-snapshot
A WEAKLY HARD SCHEDULING APPROACH OF PARTITIONED SCHEDULING ON MULTIPROCESSOR SYSTEMS
inferred← citeshttps://doi.org/10.1145/3320271openalex-snapshot
Partitioning and Selection of Data Consistency Mechanisms for Multicore Real-Time Systems
inferred← citeshttps://doi.org/10.1186/s13677-025-00790-5openalex-snapshot
Energy-aware real-time task partitioning on multi-core processors with shared resources
inferred← citeshttps://doi.org/10.22028/d291-27388openalex-snapshot
Blocking analysis of spin locks under partitioned fixed-priority scheduling
inferred← citeshttps://doi.org/10.26481/dis.20130201cropenalex-snapshot
The power of simple scheduling policies
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.