On the public citation graph

On the Decomposition-Based Global EDF Scheduling of Parallel Real-Time Tasks

https://doi.org/10.1109/rtss.2016.031

0 signed · 77 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-642-35476-2_2openalex-snapshot

Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks

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.1023/a:1008022923184openalex-snapshot

A New Approach for Scheduling of Parallelizable Tasks in Real-Time Multiprocessor Systems

inferredcites →https://doi.org/10.1093/ietisy/e89-d.6.1962openalex-snapshot

Optimal Scheduling for Real-Time Parallel Tasks

inferredcites →https://doi.org/10.1109/ecrts.2012.37openalex-snapshot

Techniques Optimizing the Number of Processors to Schedule Multi-threaded Tasks

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.31openalex-snapshot

Response-Time Analysis of Parallel Fork-Join Workloads with Real-Time Constraints

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.22openalex-snapshot

Improved Multiprocessor Global Schedulability Analysis of Sporadic DAG Task Systems

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.26openalex-snapshot

Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems

inferredcites →https://doi.org/10.1109/emsoft.2015.7318254openalex-snapshot

The federated scheduling of systems of conditional sporadic DAG tasks

inferredcites →https://doi.org/10.1109/ipdps.2015.33openalex-snapshot

Federated Scheduling of Sporadic DAG Task 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/rtss.2009.42openalex-snapshot

Gang EDF Scheduling of Parallel Task Systems

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/tpds.2013.2297919openalex-snapshot

Parallel Real-Time Scheduling of DAGs

inferredcites →https://doi.org/10.1145/2502524.2502530openalex-snapshot

Parallel scheduling for cyber-physical systems

inferredcites →https://doi.org/10.1145/2516821.2516836openalex-snapshot

Global EDF scheduling of directed acyclic graphs on multiprocessor systems

inferredcites →https://doi.org/10.1145/2659787.2659815openalex-snapshot

Response-Time Analysis of Synchronous Parallel Tasks in Multiprocessor Systems

inferredcites →https://doi.org/10.1145/2659787.2659818openalex-snapshot

A Stretching Algorithm for Parallel Real-time DAG Tasks on Multiprocessor Systems

inferredcites →https://doi.org/10.1145/2834848.2834864openalex-snapshot

Response time analysis for G-EDF and G-DM scheduling of sporadic DAG-tasks with arbitrary deadline

inferredcites →https://doi.org/10.4108/icst.simutools2010.8667openalex-snapshot

Random graph generation for scheduling simulations

inferredcites →https://doi.org/10.48550/arxiv.1212.2778openalex-snapshot

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model

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-27933-1_2openalex-snapshot

Analysis of Real-Time Execution Models for Container-Based Control Applications

inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_9openalex-snapshot

Characterizations of Parallel Real-Time Workloads

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-16-7443-3_7openalex-snapshot

A Survey of Real-Time Scheduling on Multiprocessor Systems

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/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.sysarc.2018.08.004openalex-snapshot

Bounding carry-in interference for synchronous parallel tasks under global fixed-priority 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.2020.101870openalex-snapshot

Federated scheduling for Typed DAG tasks scheduling analysis on heterogeneous multi-cores

inferred← citeshttps://doi.org/10.1049/el.2019.3017openalex-snapshot

Optimising earliest deadline first scheduling for parallel real‐time tasks on multiprocessors

inferred← citeshttps://doi.org/10.1109/dac18072.2020.9218584openalex-snapshot

DPCP-p: A Distributed Locking Protocol for Parallel Real-Time Tasks

inferred← citeshttps://doi.org/10.1109/hipc50609.2020.00035openalex-snapshot

AMCilk: A Framework for Multiprogrammed Parallel Workloads

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/icsess49938.2020.9237693openalex-snapshot

Improved DAG Tasks Stretching Algorithm Based on Multi-core Processors

inferred← citeshttps://doi.org/10.1109/isie51358.2023.10228012openalex-snapshot

Evaluation of Isolation and Communication Mechanisms for Real-Time Containers

inferred← citeshttps://doi.org/10.1109/isorc.2019.00039openalex-snapshot

Semi-Federated Scheduling of Mixed-Criticality System for Sporadic DAG Tasks

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/rtcsa52859.2021.00022openalex-snapshot

Timing-Anomaly Free Dynamic Scheduling of Periodic DAG Tasks with Non-Preemptive Nodes

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/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.00033openalex-snapshot

Suspension-Based Locking Protocols for Parallel Real-Time Tasks

inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00019openalex-snapshot

AI Meets Real-Time: Addressing Real-World Complexities in Graph Response-Time Analysis

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.00050openalex-snapshot

Virtually-Federated Scheduling of Parallel Real-Time Tasks

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/rtss66672.2025.00019openalex-snapshot

A Soft-Real-Time Optimal Scheduler for DAG Tasks with Node-Level Self Dependencies

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.2020.2990282openalex-snapshot

DAG-Fluid: A Real-Time Scheduling Algorithm for DAGs

inferred← citeshttps://doi.org/10.1109/tc.2022.3198634openalex-snapshot

A Unified Blocking Analysis for Parallel Tasks With Spin Locks Under Global Fixed Priority Scheduling

inferred← citeshttps://doi.org/10.1109/tc.2024.3441823openalex-snapshot

Response-Time Analysis of Bundled Gang Tasks Under Partitioned FP Scheduling

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.2021.3114261openalex-snapshot

Locking Protocols for Parallel Real-Time Tasks With Semaphores Under Federated 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.2022.3200527openalex-snapshot

Response-Time Analysis of Limited-Preemptive Sporadic DAG Tasks

inferred← citeshttps://doi.org/10.1109/tcad.2023.3264729openalex-snapshot

Design and Blocking Analysis of Locking Protocols for Real-Time DAG Tasks Under Federated Scheduling

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.2777449openalex-snapshot

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms

inferred← citeshttps://doi.org/10.1109/tpds.2019.2929048openalex-snapshot

Scheduling Parallel Real-Time Tasks on the Minimum Number of Processors

inferred← citeshttps://doi.org/10.1109/tpds.2022.3213024openalex-snapshot

Scheduling Parallel Real-Time Tasks on Virtual Processors

inferred← citeshttps://doi.org/10.1142/s0218126618501013openalex-snapshot

Improved Decomposition-Based Global EDF Scheduling of DAGs

inferred← citeshttps://doi.org/10.1145/3358603openalex-snapshot

Real-Time Scheduling of DAG Tasks with Arbitrary Deadlines

inferred← citeshttps://doi.org/10.17615/ttv4-ve96openalex-snapshot

REAL-TIME SCHEDULING ON ASYMMETRIC MULTIPROCESSOR PLATFORMS

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.48550/arxiv.1904.06995openalex-snapshot

The Proceedings of First Work-in-Progress Session of The CSI International Symposium on Real-Time and Embedded Systems and Technologies

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.