On the public citation graph
Feasibility of Fork-Join Real-Time Task Graph Models
0 signed · 40 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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:1021711220939openalex-snapshot
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
inferredcites →https://doi.org/10.1109/32.637146openalex-snapshot
A multiframe model for real-time tasks
inferredcites →https://doi.org/10.1109/ecrts.2008.27openalex-snapshot
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
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.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.22openalex-snapshot
Improved Multiprocessor Global Schedulability Analysis 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/real.1996.563696openalex-snapshot
A multiframe model for 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/rtas.2013.6531098openalex-snapshot
A real-time scheduling service for parallel tasks
inferredcites →https://doi.org/10.1109/rtcsa.2010.25openalex-snapshot
Preemptive Uniprocessor Scheduling of Non-cyclic GMF Task Systems
inferredcites →https://doi.org/10.1109/rtss.2005.40openalex-snapshot
The Partitioned Multiprocessor Scheduling of Sporadic Task Systems
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.19openalex-snapshot
The Non-cyclic Recurring Real-Time Task Model
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.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/rtss.2013.41openalex-snapshot
Combinatorial Abstraction Refinement for Feasibility Analysis
inferredcites →https://doi.org/10.1145/2518148.2518158openalex-snapshot
The fork-join real-time task model
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/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.7936/k71r6nr4openalex-snapshot
Real-Time Scheduling of Parallel Tasks under a General 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-319-68690-5_1openalex-snapshot
Towards Customizable CPS: Composability, Efficiency and Predictability
inferred← citeshttps://doi.org/10.1109/candar.2018.00025openalex-snapshot
Scheduling of Malleable Fork-Join Tasks with Constraint Programming
inferred← citeshttps://doi.org/10.1109/rtas.2019.00022openalex-snapshot
Calculating Response-Time Bounds for OpenMP Task Systems with Conditional Branches
inferred← citeshttps://doi.org/10.1109/rtcsa.2016.13openalex-snapshot
Transforming Real-Time Task Graphs to Improve Schedulability
inferred← citeshttps://doi.org/10.1109/rtcsa.2017.8046322openalex-snapshot
Benchmarking OpenMP programs for real-time scheduling
inferred← citeshttps://doi.org/10.1109/rtss.2016.035openalex-snapshot
BUNDLE: Real-Time Multi-threaded Scheduling to Reduce Cache Contention
inferred← citeshttps://doi.org/10.1109/tc.2020.2984502openalex-snapshot
Algorithms for Computing the WCRT Bound of OpenMP Task Systems With Conditional Branches
inferred← citeshttps://doi.org/10.1109/tcad.2020.3012174openalex-snapshot
Efficient Feasibility Analysis for Graph-Based Real-Time Task Systems
inferred← citeshttps://doi.org/10.1145/3373400.3373409openalex-snapshot
Energy-aware scheduling of malleable fork-join tasks under a deadline constraint on heterogeneous multicores
inferred← citeshttps://doi.org/10.1145/3378678.3391875openalex-snapshot
Scheduling of moldable fork-join tasks with inter- and intra-task communications
inferred← citeshttps://doi.org/10.15803/ijnc.9.2_131openalex-snapshot
A Constraint Programming Approach to Scheduling of Malleable Tasks
inferred← citeshttps://doi.org/10.1587/transfun.2021vlp0003openalex-snapshot
Simultaneous Scheduling and Core-Type Optimization for Moldable Fork-Join Tasks on Heterogeneous Multicores
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.