On the public citation graph

Reducing Preemptions and Migrations in Real-Time Multiprocessor Scheduling Algorithms by Releasing the Fairness

https://doi.org/10.1109/rtcsa.2011.57
0 signed · 37 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/bf01940883openalex-snapshot
Proportionate Progress: A Notion of Fairness in Resource Allocation
inferredcites →https://doi.org/10.1007/s11241-011-9121-1openalex-snapshot
Cluster scheduling for real-time systems: utilization bounds and run-time overhead
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.1109/ecrts.2008.15openalex-snapshot
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors
inferredcites →https://doi.org/10.1109/ecrts.2009.22openalex-snapshot
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
inferredcites →https://doi.org/10.1109/ecrts.2010.34openalex-snapshot
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
inferredcites →https://doi.org/10.1109/ecrts.2011.20openalex-snapshot
Is Semi-Partitioned Scheduling Practical?
inferredcites →https://doi.org/10.1109/emrts.2000.853990openalex-snapshot
Early-release fair scheduling
inferredcites →https://doi.org/10.1109/ipps.1995.395946openalex-snapshot
Fast scheduling of periodic tasks on multiple resources
inferredcites →https://doi.org/10.1109/real.1999.818857openalex-snapshot
Pfair scheduling of fixed and migrating periodic tasks on multiple resources
inferredcites →https://doi.org/10.1109/real.2003.1253262openalex-snapshot
Multiple-resource periodic scheduling problem: how much fairness is necessary?
inferredcites →https://doi.org/10.1109/rtcsa.2000.896405openalex-snapshot
Pfair scheduling: beyond periodic task systems
inferredcites →https://doi.org/10.1109/rtcsa.2006.45openalex-snapshot
Multiprocessor Scheduling with Few Preemptions
inferredcites →https://doi.org/10.1109/rtss.2006.10openalex-snapshot
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
inferredcites →https://doi.org/10.1109/rtss.2009.16openalex-snapshot
Preemption-Light Multiprocessor Scheduling of Sporadic Tasks with High Utilisation Bound
inferredcites →https://doi.org/10.1109/rtss.2010.22openalex-snapshot
Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules
inferredcites →https://doi.org/10.1145/1450058.1450078openalex-snapshot
Portioned EDF-based scheduling on multiprocessors
inferredcites →https://doi.org/10.1145/167088.167194openalex-snapshot
Proportionate progress
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.1002/cpe.6438openalex-snapshot
Cluster formation techniques for hierarchical real time tasks allocation on multiprocessor system
inferred← citeshttps://doi.org/10.1007/978-981-4585-18-7_38openalex-snapshot
A Modified LRE-TL Real-Time Multiprocessor Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/s11241-012-9165-xopenalex-snapshot
Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
inferred← citeshttps://doi.org/10.1007/s11241-014-9207-7openalex-snapshot
Scheduling algorithms to reduce the static energy consumption of real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-021-09367-2openalex-snapshot
Dynamic power management under the RUN scheduling algorithm: a slack filling approach
inferred← citeshttps://doi.org/10.1016/j.sysarc.2017.07.001openalex-snapshot
Cluster-based multicore real-time mixed-criticality scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2017.07.003openalex-snapshot
Reduction of task migrations and preemptions in optimal real-time scheduling for multiprocessors by using dynamic T-L plane
inferred← citeshttps://doi.org/10.1109/access.2019.2900288openalex-snapshot
Investigating the Schedulability of Periodic Real-Time Tasks in Virtualized Cloud Environment
inferred← citeshttps://doi.org/10.1109/access.2020.3024692openalex-snapshot
Flow Network Models for Online Scheduling Real-Time Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1109/access.2021.3086698openalex-snapshot
Maximizing Utilization and Minimizing Migration in Thermal-Aware Energy-Efficient Real-Time Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1109/ecrts.2012.36openalex-snapshot
U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks
inferred← citeshttps://doi.org/10.1109/etfa.2012.6489568openalex-snapshot
Efficiency evaluation of overhead control heuristics in DP-Fair multiprocessor scheduling
inferred← citeshttps://doi.org/10.1109/rtcsa.2012.47openalex-snapshot
Reducing Preemptions and Migrations in EKG
inferred← citeshttps://doi.org/10.1109/rtss.2011.17openalex-snapshot
RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor
inferred← citeshttps://doi.org/10.1145/2516821.2516839openalex-snapshot
A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1145/3322643openalex-snapshot
Thermal-aware Real-time Scheduling Using Timed Continuous Petri Nets
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/6597openalex-snapshot
Operating System Contribution to Composable Timing Behaviour in High-Integrity Real-Time Systems
inferred← citeshttps://doi.org/10.70675/807a2565zc27fz441fzb8d8zfae60f0c133bopenalex-snapshot
Scheduling sequential or parallel hard real-time pre-emptive tasks upon identical multiprocessor platforms
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.