On the public citation graph
Response Time Analysis with Limited Carry-In for Global Earliest Deadline First Scheduling
0 signed · 44 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/978-3-540-77096-1_5openalex-snapshot
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks
inferredcites →https://doi.org/10.1007/s00453-011-9505-6openalex-snapshot
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
inferredcites →https://doi.org/10.1007/s11241-009-9075-8openalex-snapshot
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems
inferredcites →https://doi.org/10.1007/s11241-010-9106-5openalex-snapshot
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
inferredcites →https://doi.org/10.1007/s11241-012-9172-yopenalex-snapshot
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm
inferredcites →https://doi.org/10.1016/j.jss.2012.05.048openalex-snapshot
An experimental comparison of different real-time schedulers on multicore systems
inferredcites →https://doi.org/10.1016/j.sysarc.2010.09.004openalex-snapshot
Tests for global EDF schedulability analysis
inferredcites →https://doi.org/10.1016/j.sysarc.2013.05.012openalex-snapshot
Limited carry-in technique for real-time multi-core scheduling
inferredcites →https://doi.org/10.1109/ecrts.2005.18openalex-snapshot
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/ecrts.2009.31openalex-snapshot
Implementation of a Speedup-Optimal Global EDF Schedulability Test
inferredcites →https://doi.org/10.1109/ecrts.2013.36openalex-snapshot
Suspension-Aware Analysis for Hard Real-Time Multiprocessor Scheduling
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.2003.1253260openalex-snapshot
Multiprocessor EDF and deadline monotonic schedulability analysis
inferredcites →https://doi.org/10.1109/rtcsa.2014.6910502openalex-snapshot
Component-based analysis of hierarchical scheduling using linear hybrid automata
inferredcites →https://doi.org/10.1109/rtcsa.2014.6910543openalex-snapshot
Improving the response time analysis of global fixed-priority multiprocessor scheduling
inferredcites →https://doi.org/10.1109/rtss.2007.31openalex-snapshot
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/rtss.2007.35openalex-snapshot
Techniques for Multiprocessor Global Schedulability Analysis
inferredcites →https://doi.org/10.1109/rtss.2007.41openalex-snapshot
Adapting Futures: Scalability for Real-World Computing
inferredcites →https://doi.org/10.1109/rtss.2009.11openalex-snapshot
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/rtss.2009.31openalex-snapshot
Priority Assignment for Global Fixed Priority Pre-Emptive Scheduling in Multiprocessor Real-Time Systems
inferredcites →https://doi.org/10.1109/rtss.2014.18openalex-snapshot
Time-Reversibility of Schedulability Tests
inferredcites →https://doi.org/10.1109/tc.2014.2308183openalex-snapshot
Composition of Schedulability Analyses for Real-Time Multiprocessor Systems
inferredcites →https://doi.org/10.1145/2656045.2656072openalex-snapshot
Supporting read/write applications in embedded real-time systems via suspension-aware analysis
inferredcites →https://doi.org/10.1145/2659787.2659814openalex-snapshot
A Weak Simulation Relation for Real-Time Schedulability Analysis of Global Fixed Priority Scheduling Using Linear Hybrid Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11241-018-9303-1openalex-snapshot
On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2016.04.003openalex-snapshot
New response time analysis for global EDF on a multiprocessor platform
inferred← citeshttps://doi.org/10.1016/j.sysarc.2018.12.006openalex-snapshot
Pessimism in multicore global schedulability analysis
inferred← citeshttps://doi.org/10.1109/access.2019.2928992openalex-snapshot
Research on Task Priority Model and Algorithm for Satellite Scheduling Problem
inferred← citeshttps://doi.org/10.1109/access.2022.3151891openalex-snapshot
A Survey of Techniques for Reducing Interference in Real-Time Applications on Multicore Platforms
inferred← citeshttps://doi.org/10.1109/rtcsa55878.2022.00022openalex-snapshot
On the Trade-offs between Generalization and Specialization in Real-Time Systems
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00027openalex-snapshot
Conditionally Optimal Task Parallelization for Global EDF on Multi-core Systems
inferred← citeshttps://doi.org/10.1109/rtss52674.2021.00027openalex-snapshot
Conditionally Optimal Parallelization of Real-Time DAG Tasks for Global EDF
inferred← citeshttps://doi.org/10.1109/rtss66672.2025.00012openalex-snapshot
Response Time Analysis for Probabilistic Dag Tasks in Multicore Real-Time Systems
inferred← citeshttps://doi.org/10.1109/tc.2021.3071730openalex-snapshot
Optimal Parallelization of Single/Multi-Segment Real-Time Tasks for Global EDF
inferred← citeshttps://doi.org/10.1109/tcad.2020.2994265openalex-snapshot
Limited Busy Periods in Response Time Analysis for Tasks Under Global EDF Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2017.2679195openalex-snapshot
Improved Carry-in Workload Estimation for Global Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2018.2843763openalex-snapshot
Execution-Efficient Response Time Analysis on Global Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/trustcom/bigdatase/icess.2017.317openalex-snapshot
Integrating Cache-Related Preemption Delay into GEDF Analysis for Multiprocessor Scheduling with On-chip Cache
inferred← citeshttps://doi.org/10.1145/3167132.3167195openalex-snapshot
Assessing the pessimism of current multicore global fixed-priority schedulability analysis
inferred← citeshttps://doi.org/10.1145/3356865openalex-snapshot
Weakly-hard Real-time Guarantees for Earliest Deadline First Scheduling of Independent Tasks
inferred← citeshttps://doi.org/10.1145/3360513openalex-snapshot
Response Time Analysis for Tasks with Fixed Preemption Points under Global Scheduling
inferred← citeshttps://doi.org/10.1145/3465474openalex-snapshot
An Efficient Execution Framework of Two-Part Execution Scenario Analysis
inferred← citeshttps://doi.org/10.1145/3477035openalex-snapshot
Excluding Parallel Execution to Improve Global Fixed Priority Response Time Analysis
inferred← citeshttps://doi.org/10.1145/3696355.3699707openalex-snapshot
Leveraging Parallelism in Global Scheduling to Improve State Space Exploration in the SAG Framework
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.