On the public citation graph

Timing-Anomaly Free Dynamic Scheduling of Conditional DAG Tasks on Multi-Core Systems

https://doi.org/10.1145/3358236
0 signed · 57 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/978-3-319-08696-5openalex-snapshot
Multiprocessor Scheduling for Real-Time Systems
inferredcites →https://doi.org/10.1007/s11241-012-9166-9openalex-snapshot
Multi-core real-time scheduling for generalized parallel task models
inferredcites →https://doi.org/10.1109/71.503776openalex-snapshot
Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors
inferredcites →https://doi.org/10.1109/ecrts.2013.14openalex-snapshot
Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms
inferredcites →https://doi.org/10.1109/ecrts.2013.31openalex-snapshot
Response-Time Analysis of Parallel Fork-Join Workloads with Real-Time Constraints
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/ecrts.2015.27openalex-snapshot
The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks
inferredcites →https://doi.org/10.1109/rtas.2017.2openalex-snapshot
Timing-Anomaly Free Dynamic Scheduling of Task-Based Parallel Applications
inferredcites →https://doi.org/10.1109/rtss.2010.42openalex-snapshot
Scheduling Parallel Real-Time Tasks on Multi-core Processors
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.2016.2584064openalex-snapshot
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems
inferredcites →https://doi.org/10.1109/tpds.2013.57openalex-snapshot
List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table
inferredcites →https://doi.org/10.1109/tpds.2017.2777449openalex-snapshot
Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1145/344588.344618openalex-snapshot
Static scheduling algorithms for allocating directed task graphs to multiprocessors
inferredcites →https://doi.org/10.1177/109434200101500212openalex-snapshot
Embedded/Real-Time Systems
inferredcites →https://doi.org/10.4108/icst.simutools2010.8667openalex-snapshot
Random graph generation for scheduling simulations

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11227-026-08340-9openalex-snapshot
Priority list scheduling algorithm for response time analysis optimization using dependency-driven non-critical nodes parallelism factor
inferred← citeshttps://doi.org/10.1007/s11241-021-09375-2openalex-snapshot
Bounding the execution time of parallel applications on unrelated multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-025-09444-wopenalex-snapshot
Toward state-aware scheduling of machine-learning workloads
inferred← citeshttps://doi.org/10.1016/j.future.2022.05.005openalex-snapshot
Optimizing data placement and size configuration for morphable NVM based SPM in embedded multicore systems
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2024.106995openalex-snapshot
Fixed node determination and analysis in directed acyclic graphs of structured networks
inferred← citeshttps://doi.org/10.1016/j.simpat.2023.102746openalex-snapshot
McSad: A Monte Carlo-based end-to-end scheduling anomaly detection method for distributed real-time systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2021.102385openalex-snapshot
Computing exact WCRT for typed DAG tasks on heterogeneous multi-core processors
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102484openalex-snapshot
Response time analysis of parallel tasks on accelerator-based heterogeneous platforms
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/access.2021.3130407openalex-snapshot
A Global DAG Task Scheduler Using Deep Reinforcement Learning and Graph Convolution Network
inferred← citeshttps://doi.org/10.1109/asap61560.2024.00015openalex-snapshot
Fault-tolerant DAG Scheduling with Runtime Reconfiguration on Multicore Real-Time Systems
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247927openalex-snapshot
Response Time Analysis and Optimization of DAG Tasks Exploiting Mutually Exclusive Execution
inferred← citeshttps://doi.org/10.1109/ds-rt55542.2022.9932084openalex-snapshot
DAG Scheduling Considering Parallel Execution for High-Load Processing on Clustered Many-core Processors
inferred← citeshttps://doi.org/10.1109/icites59818.2023.10356887openalex-snapshot
DRL-based Task Scheduling and Shared Resource Allocation for Multi-Core Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtcsa52859.2021.00022openalex-snapshot
Timing-Anomaly Free Dynamic Scheduling of Periodic DAG Tasks with Non-Preemptive Nodes
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00022openalex-snapshot
DAG Scheduling and Analysis on Multiprocessor Systems: Exploitation of Parallelism and Dependency
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/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.00030openalex-snapshot
Co-Located Parallel Scheduling of Threads to Optimize Cache Sharing
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00024openalex-snapshot
ROTA-I/O: Hardware/Algorithm Co-design for Real-Time I/O Control with Improved Timing Accuracy and Robustness
inferred← citeshttps://doi.org/10.1109/rtss66672.2025.00063openalex-snapshot
Work-in-Progress: A Timing-Anomaly Free Dynamic Scheduling on Heterogeneous Systems
inferred← citeshttps://doi.org/10.1109/sies62473.2024.10767927openalex-snapshot
A Structure-Aware DAG Scheduling and Allocation on Heterogeneous Multicore Systems
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/tc.2025.3604469openalex-snapshot
Multi-Path Bound for Parallel Tasks With Conditional Branches
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.2022.3200527openalex-snapshot
Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks
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/tcad.2024.3507563openalex-snapshot
Multipath Bound for DAG Tasks
inferred← citeshttps://doi.org/10.1145/3412841.3441895openalex-snapshot
Partial order based non-preemptive communication scheduling towards real-time networks-on-chip
inferred← citeshttps://doi.org/10.1145/3477018openalex-snapshot
Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors
inferred← citeshttps://doi.org/10.1145/3477037openalex-snapshot
HMDS: A Makespan Minimizing DAG Scheduler for Heterogeneous Distributed Systems
inferred← citeshttps://doi.org/10.1145/3631527openalex-snapshot
DAG-Order: An Order-Based Dynamic DAG Scheduling for Real-Time Networks-on-Chip
inferred← citeshttps://doi.org/10.1145/3649329.3657372openalex-snapshot
A Cache/Algorithm Co-design for Parallel Real-Time Systems with Data Dependency on Multi/Many-core System-on-Chips
inferred← citeshttps://doi.org/10.1145/3706628.3708864openalex-snapshot
FlightVGM: Efficient Video Generation Model Inference with Online Sparsification and Hybrid Precision on FPGAs
inferred← citeshttps://doi.org/10.1145/3770858openalex-snapshot
Near-Optimal Cache Sharing through Co-Located Parallel Scheduling of Threads
inferred← citeshttps://doi.org/10.3390/app13052779openalex-snapshot
DAG Hierarchical Schedulability Analysis for Avionics Hypervisor in Multicore Processors
inferred← citeshttps://doi.org/10.5070/sr32158647openalex-snapshot
[Solution] End-to-end Scheduling of Real-time Task Pipelines on Multiprocessors
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.