On the public citation graph
Controlling Preemption for Better Schedulability in Multi-Core Systems
0 signed · 41 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-006-4961-9openalex-snapshot
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
inferredcites →https://doi.org/10.1007/s11241-010-9113-6openalex-snapshot
Feasibility analysis under fixed priority scheduling with limited preemptions
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/j.sysarc.2010.09.004openalex-snapshot
Tests for global EDF schedulability analysis
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.2005.32openalex-snapshot
The limited-preemption uniprocessor scheduling of sporadic task systems
inferredcites →https://doi.org/10.1109/rtas.2011.30openalex-snapshot
Maximizing Contention-Free Executions in Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/rtcsa.1999.811269openalex-snapshot
Scheduling fixed-priority tasks with preemption threshold
inferredcites →https://doi.org/10.1109/rtcsa.2009.44openalex-snapshot
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
inferredcites →https://doi.org/10.1109/rtss.2006.7openalex-snapshot
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks
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.41openalex-snapshot
Adapting Futures: Scalability for Real-World Computing
inferredcites →https://doi.org/10.1109/rtss.2008.17openalex-snapshot
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
inferredcites →https://doi.org/10.1109/rtss.2011.30openalex-snapshot
Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions
inferredcites →https://doi.org/10.1109/tii.2010.2049654openalex-snapshot
Limited Preemption EDF Scheduling of Sporadic Task Systems
inferredcites →https://doi.org/10.1109/tii.2012.2188805openalex-snapshot
Limited Preemptive Scheduling for Real-Time Systems. A Survey
inferredcites →https://doi.org/10.1109/tpds.2008.129openalex-snapshot
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4866927openalex-extracted
Weakly-Hard Real-Time Support for Ros2
inferred← citeshttps://doi.org/10.1007/978-981-10-8797-4_40openalex-snapshot
Empirical Evaluation of a Real-Time Task Priority Procedure on Small/Medium-Scale Multi-core Systems
inferred← citeshttps://doi.org/10.1007/s11241-014-9213-9openalex-snapshot
Global EDF scheduling for parallel real-time tasks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2013.05.012openalex-snapshot
Limited carry-in technique for real-time multi-core scheduling
inferred← citeshttps://doi.org/10.1088/1742-6596/1673/1/012002openalex-snapshot
Real-Time Scheduling Parallel Tasks on Multicore Platforms
inferred← citeshttps://doi.org/10.1109/access.2020.2992868openalex-snapshot
Response-Time Analysis for Multi-Mode Tasks in Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2013.12openalex-snapshot
Outstanding Paper Award: Analysis of Global EDF for Parallel Tasks
inferred← citeshttps://doi.org/10.1109/icss50103.2020.00024openalex-snapshot
Scheduling Parallel Real-Time Tasks for Multicore Systems
inferred← citeshttps://doi.org/10.1109/les.2020.2966681openalex-snapshot
Improved Schedulability Test for Non-Preemptive Fixed-Priority Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1109/les.2021.3133901openalex-snapshot
Improved Low Time-Complexity Schedulability Test for Nonpreemptive EDF on a Multiprocessor
inferred← citeshttps://doi.org/10.1109/rtas58335.2023.00019openalex-snapshot
Schedulability Analysis of Non-preemptive Sporadic Gang Tasks on Hardware Accelerators
inferred← citeshttps://doi.org/10.1109/rtcsa.2015.9openalex-snapshot
Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis
inferred← citeshttps://doi.org/10.1109/rtss.2013.26openalex-snapshot
Limited Pre-emptive Global Fixed Task Priority
inferred← citeshttps://doi.org/10.1109/rtss49844.2020.00020openalex-snapshot
Non-Preemptive Real-Time Multiprocessor Scheduling Beyond Work-Conserving
inferred← citeshttps://doi.org/10.1109/rtss55097.2022.00021openalex-snapshot
Design and Timing Guarantee for Non-Preemptive Gang Scheduling
inferred← citeshttps://doi.org/10.1109/rtss62706.2024.00048openalex-snapshot
Work-in-Progress: Exploring Limited Preemption Approaches for the Phased Execution Model
inferred← citeshttps://doi.org/10.1109/tc.2014.2308183openalex-snapshot
Composition of Schedulability Analyses for Real-Time Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tc.2015.2500572openalex-snapshot
Global Real-Time Memory-Centric Scheduling for Multicore Systems
inferred← citeshttps://doi.org/10.1109/tc.2017.2704083openalex-snapshot
Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/tpds.2013.2297098openalex-snapshot
Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption
inferred← citeshttps://doi.org/10.1109/tpds.2025.3529218openalex-snapshot
Response Time Analysis and Optimal Priority Assignment for Global Non-Preemptive Fixed-Priority Rigid Gang Scheduling
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539380openalex-snapshot
Preemption Threshold Assignment to Improve Schedulability under Memory Constraints
inferred← citeshttps://doi.org/10.3390/sym12010172openalex-snapshot
Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry 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.