On the public citation graph

Federated Scheduling of Sporadic DAG Task Systems

https://doi.org/10.1109/ipdps.2015.33
0 signed · 96 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.1002/j.1538-7305.1966.tb01709.xopenalex-snapshot
Bounds for Certain Multiprocessing Anomalies
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.1016/b978-155860702-6/50016-8openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
inferredcites →https://doi.org/10.1109/ecrts.2013.12openalex-snapshot
Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks
inferredcites →https://doi.org/10.1109/ecrts.2013.32openalex-snapshot
Feasibility Analysis in the Sporadic DAG Task Model
inferredcites →https://doi.org/10.1109/ecrts.2014.23openalex-snapshot
Analysis of Federated and Global Scheduling for Parallel Real-Time Tasks
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.1998.739736openalex-snapshot
A general model for recurring real-time tasks
inferredcites →https://doi.org/10.1109/rtas.2011.15openalex-snapshot
The Digraph Real-Time Task Model
inferredcites →https://doi.org/10.1109/rtss.2010.23openalex-snapshot
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers
inferredcites →https://doi.org/10.1109/rtss.2011.27openalex-snapshot
Multi-core Real-Time Scheduling for Generalized Parallel Task Models
inferredcites →https://doi.org/10.1109/rtss.2012.59openalex-snapshot
A Generalized Parallel Task Model for Recurrent Real-time Processes
inferredcites →https://doi.org/10.1109/tc.2006.113openalex-snapshot
The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
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/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1287/opre.26.1.22openalex-snapshot
Complexity of Scheduling under Precedence Constraints
inferredcites →https://doi.org/10.48550/arxiv.1212.2778openalex-snapshot
Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
inferredcites →https://doi.org/10.5555/2755753.2757121openalex-snapshot
The federated scheduling of constrained-deadline sporadic DAG task systems
inferredcites →https://doi.org/10.7873/date.2015.0200openalex-snapshot
The Federated Scheduling of Constrained-Deadline Sporadic DAG 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-030-35540-1_4openalex-snapshot
Response Time Analysis of Typed DAG Tasks for G-FP Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-031-94892-3_52openalex-snapshot
An Optimization Framework for DAG Task Allocation on Symmetric Multicore Systems: Exploiting the Layered Node Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_55openalex-snapshot
Scheduling Parallelizable Jobs Online to Maximize Throughput
inferred← citeshttps://doi.org/10.1007/978-981-13-1026-3_5openalex-snapshot
On the Soft Real-Time Scheduling of Parallel Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_28openalex-snapshot
Parallel Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_28-1openalex-snapshot
Parallel Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/s11227-024-06685-7openalex-snapshot
Energy-harvesting-aware federated scheduling of parallel real-time tasks
inferred← citeshttps://doi.org/10.1007/s11241-016-9255-2openalex-snapshot
Federated scheduling admits no constant speedup factors for constrained-deadline DAG task systems
inferred← citeshttps://doi.org/10.1007/s11241-023-09397-yopenalex-snapshot
The shape of a DAG: bounding the response time using long paths
inferred← citeshttps://doi.org/10.1007/s11241-023-09403-3openalex-snapshot
A survey on real-time DAG scheduling, revisiting the Global-Partitioned Infinity War
inferred← citeshttps://doi.org/10.1007/s11241-024-09421-9openalex-snapshot
Real-time scheduling for parallel tasks with resource reclamation
inferred← citeshttps://doi.org/10.1016/j.ins.2021.10.072openalex-snapshot
Exploit the data level parallelism and schedule dependent tasks on the multi-core processors
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.03.006openalex-snapshot
Algorithms for hierarchical and semi-partitioned parallel scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.10.006openalex-snapshot
Building real-time parallel task systems on multi-cores: A hierarchical scheduling approach
inferred← citeshttps://doi.org/10.1016/j.sysarc.2020.101742openalex-snapshot
Real-time scheduling of parallel tasks with tight deadlines
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102692openalex-snapshot
The BH-mixed scheduling algorithm for DAG tasks with constrained deadlines
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103372openalex-snapshot
A cache-aware DAG scheduling method on multicores: Exploiting node affinity and deferred executions
inferred← citeshttps://doi.org/10.1109/ds-rt52167.2021.9576150openalex-snapshot
Federated Scheduling in Clustered Many-core Processors
inferred← citeshttps://doi.org/10.1109/emsoft.2015.7318254openalex-snapshot
The federated scheduling of systems of conditional sporadic DAG tasks
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00280openalex-snapshot
A Temporal Dependency Aware Approach for Scheduling Real-Time Tasks on Multi-Core Platforms
inferred← citeshttps://doi.org/10.1109/iccke.2018.8566678openalex-snapshot
Semi-Federated Scheduling of Multiple Periodic Real-Time DAGs of Non-Preemptable Tasks
inferred← citeshttps://doi.org/10.1109/ipdps.2017.22openalex-snapshot
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling
inferred← citeshttps://doi.org/10.1109/rtas.2016.7461364openalex-snapshot
Trading Cores for Memory Bandwidth in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtas48715.2020.00005openalex-snapshot
Bringing Inter-Thread Cache Benefits to Federated Scheduling
inferred← citeshttps://doi.org/10.1109/rtas61025.2024.00020openalex-snapshot
DAG Scheduling with Execution Groups
inferred← citeshttps://doi.org/10.1109/rtas68450.2026.00031openalex-snapshot
AI Inference in the Heat: Thermal-Aware Strict Partitioning for Configurable Real-Time Gang Tasks
inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203643openalex-snapshot
Preemption-Aware Allocation, Deadline Assignment for Conditional DAGs on Partitioned EDF
inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203660openalex-snapshot
Efficient Deterministic Federated Scheduling for Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtss.2016.031openalex-snapshot
On the Decomposition-Based Global EDF Scheduling of Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtss.2017.00015openalex-snapshot
Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtss.2018.00018openalex-snapshot
Making OpenVX Really "Real Time"
inferred← citeshttps://doi.org/10.1109/rtss.2018.00061openalex-snapshot
Reservation-Based Federated Scheduling for Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00026openalex-snapshot
An Efficient Utilization-Based Test for Scheduling Hard Real-Time Sporadic DAG Task Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00036openalex-snapshot
OpenVX and Real-Time Certification: The Troublesome History
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00037openalex-snapshot
LAG-Based Analysis Techniques for Scheduling Multiprocessor Hard Real-Time Sporadic DAGs
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00042openalex-snapshot
Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00050openalex-snapshot
Virtually-Federated Scheduling of Parallel Real-Time Tasks
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00045openalex-snapshot
Exact Response-Time Bounds of Periodic DAG Tasks under Server-Based Global Scheduling
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00046openalex-snapshot
Response Time Analysis for Prioritized DAG Task with Mutually Exclusive Vertices
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00047openalex-snapshot
Bounding the Response Time of DAG Tasks Using Long Paths
inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00013openalex-snapshot
Holistically Budgeting Processing Graphs
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00038openalex-snapshot
Mixed-Criticality Federated Scheduling for Relaxed-Deadline DAG Tasks
inferred← citeshttps://doi.org/10.1109/rtss66672.2025.00019openalex-snapshot
A Soft-Real-Time Optimal Scheduler for DAG Tasks with Node-Level Self Dependencies
inferred← citeshttps://doi.org/10.1109/smc52423.2021.9658724openalex-snapshot
An Efficient Scheduling Algorithm for Interdependent Tasks in Heterogeneous Multi-core Systems
inferred← citeshttps://doi.org/10.1109/tc.2019.2936477openalex-snapshot
Utilization-Tensity Bound for Real-Time DAG Tasks under Global EDF Scheduling
inferred← citeshttps://doi.org/10.1109/tc.2021.3111512openalex-snapshot
A Fluid Scheduling Algorithm for DAG Tasks with Constrained or Arbitrary Deadlines
inferred← citeshttps://doi.org/10.1109/tc.2023.3244632openalex-snapshot
A New Federated Scheduling Algorithm for Arbitrary-Deadline DAG Tasks
inferred← citeshttps://doi.org/10.1109/tc.2023.3280137openalex-snapshot
Parallel Path Progression DAG Scheduling
inferred← citeshttps://doi.org/10.1109/tc.2025.3603674openalex-snapshot
A Hybrid Approach to Refine WCRT Bounds for DAG Scheduling Using Anomaly Classification
inferred← citeshttps://doi.org/10.1109/tcad.2018.2857362openalex-snapshot
A Capacity Augmentation Bound for Real-Time Constrained-Deadline Parallel Tasks Under GEDF
inferred← citeshttps://doi.org/10.1109/tcad.2020.2966486openalex-snapshot
Capacity Augmentation Function for Real-Time Parallel Tasks With Constrained Deadlines Under GEDF Scheduling
inferred← citeshttps://doi.org/10.1109/tcad.2022.3197532openalex-snapshot
Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling Algorithms
inferred← citeshttps://doi.org/10.1109/tcad.2023.3241221openalex-snapshot
Real-Time Scheduling of Conditional DAG Tasks With Intra-Task Priority Assignment
inferred← citeshttps://doi.org/10.1109/tcad.2024.3402566openalex-snapshot
Longer Is Shorter: Making Long Paths to Improve the Worst-Case Response Time of DAG Tasks
inferred← citeshttps://doi.org/10.1109/tpds.2017.2777454openalex-snapshot
Blocking Analysis for Spin Locks in Real-Time Parallel Tasks
inferred← citeshttps://doi.org/10.1109/tpds.2019.2916696openalex-snapshot
Response Time Bounds for Typed DAG Parallel Tasks on Heterogeneous Multi-Cores
inferred← citeshttps://doi.org/10.1109/tpds.2022.3179328openalex-snapshot
Real-Time Scheduling of Parallel Task Graphs With Critical Sections Across Different Vertices
inferred← citeshttps://doi.org/10.1109/tpds.2022.3213024openalex-snapshot
Scheduling Parallel Real-Time Tasks on Virtual Processors
inferred← citeshttps://doi.org/10.1109/tpds.2025.3611446openalex-snapshot
New Scheduling Algorithm and Analysis for Partitioned Periodic DAG Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1145/2997465.2997486openalex-snapshot
Reducing Response-Time Bounds for DAG-Based Task Systems on Heterogeneous Multicore Platforms
inferred← citeshttps://doi.org/10.1145/2997465.2997499openalex-snapshot
Schedulability analysis of dependent probabilistic real-time tasks
inferred← citeshttps://doi.org/10.1145/3087556.3087590openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3316781.3317907openalex-snapshot
Scheduling and Analysis of Parallel Real-Time Tasks with Semaphores
inferred← citeshttps://doi.org/10.1145/3358603openalex-snapshot
Real-Time Scheduling of DAG Tasks with Arbitrary Deadlines
inferred← citeshttps://doi.org/10.1145/3477018openalex-snapshot
Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors
inferred← citeshttps://doi.org/10.1145/3489467openalex-snapshot
Holistic Resource Allocation Under Federated Scheduling for Parallel Real-time Tasks
inferred← citeshttps://doi.org/10.1145/3534879.3534892openalex-snapshot
Analysis of Federated Scheduling for Integer-Valued Workloads
inferred← citeshttps://doi.org/10.17615/ttv4-ve96openalex-snapshot
REAL-TIME SCHEDULING ON ASYMMETRIC MULTIPROCESSOR PLATFORMS
inferred← citeshttps://doi.org/10.2197/ipsjjip.30.646openalex-snapshot
LET Paradigm Scheduling Algorithm Considering Parallel Processing on Clustered Many-core Processor
inferred← citeshttps://doi.org/10.2197/ipsjjip.33.79openalex-snapshot
Dedicated Processor Allocation Scheduling for High-load Tasks on Clustered Many-core Processors
inferred← citeshttps://doi.org/10.23919/date.2019.8714859openalex-snapshot
Analyzing GEDF Scheduling for Parallel Real-Time Tasks with Arbitrary Deadlines
inferred← citeshttps://doi.org/10.23919/date56975.2023.10137259openalex-snapshot
On the Degree of Parallelism in Real-Time Scheduling of DAG Tasks
inferred← citeshttps://doi.org/10.34626/xjb6-w471openalex-snapshot
Timing Analysis of General Purpose Graphics Processing Units for Real-Time Systems: Models and Analyses
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00017openalex-snapshot
New Analysis Techniques for Supporting Hard Real-Time Sporadic DAG Task Systems on Multiprocessors
inferred← citeshttps://doi.org/10.48550/arxiv.2011.06762openalex-snapshot
Schedulability Bounds for Parallel Real-Time Tasks under Global Rate-Monotonic Scheduling
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.