On the public citation graph

Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules

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

0 signed · 45 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.1002/nav.3800180410openalex-snapshot

Scheduling with earliest start and due date constraints

inferredcites →https://doi.org/10.1006/jpdc.1997.1327openalex-snapshot

An Optimal Multiprocessor Real-Time Scheduling Algorithm

inferredcites →https://doi.org/10.1007/bf01940883openalex-snapshot

Proportionate Progress: A Notion of Fairness in Resource Allocation

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

Work-Conserving Optimal Real-Time Scheduling on Multiprocessors

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

Multiple-resource periodic scheduling problem: how much fairness is necessary?

inferredcites →https://doi.org/10.1109/rtas.2008.17openalex-snapshot

Equivalence between Schedule Representations: Theory and Applications

inferredcites →https://doi.org/10.1109/rtcsa.2006.45openalex-snapshot

Multiprocessor Scheduling with Few Preemptions

inferredcites →https://doi.org/10.1109/rtcsa.2007.34openalex-snapshot

Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems

inferredcites →https://doi.org/10.1109/rtss.2006.10openalex-snapshot

An Optimal Real-Time Scheduling Algorithm for Multiprocessors

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

Preemptive Scheduling of Uniform Processor Systems

inferredcites →https://doi.org/10.1287/mnsc.6.1.1openalex-snapshot

Scheduling with Deadlines and Loss Functions

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-00560-7_41openalex-snapshot

Overhead Control in DP-Fair Work Conserving Real-Time Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1007/978-3-319-22975-1_8openalex-snapshot

On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling

inferred← citeshttps://doi.org/10.1007/978-981-287-251-7_4openalex-snapshot

Soft Real-Time Scheduling

inferred← citeshttps://doi.org/10.1007/978-981-4585-87-3_4-1openalex-snapshot

Soft Real-Time Scheduling

inferred← citeshttps://doi.org/10.1007/s11241-013-9190-4openalex-snapshot

Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

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-015-9237-9openalex-snapshot

Using a lag-balance property to tighten tardiness bounds for global EDF

inferred← citeshttps://doi.org/10.1007/s11241-018-9319-6openalex-snapshot

A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

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

Task Preemption Based on Petri Nets

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/cse-euc.2017.207openalex-snapshot

Overhead Control Heuristics in Boundary Fair Real-Time Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1109/ecrts.2012.11openalex-snapshot

Outstanding Paper Award: Fair Lateness Scheduling: Reducing Maximum Lateness in G-EDF-Like Scheduling

inferred← citeshttps://doi.org/10.1109/ecrts.2013.13openalex-snapshot

Reducing Tardiness under Global Scheduling by Splitting Jobs

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

K_multiprocessor Group (KMG) optimal scheduling algorithm for reducing preemptions and migrations in RTS

inferred← citeshttps://doi.org/10.1109/isorc52013.2021.00018openalex-snapshot

An Evaluation of Adaptive Partitioning of Real-Time Workloads on Linux

inferred← citeshttps://doi.org/10.1109/mcsoc51149.2021.00066openalex-snapshot

An Architecture to Enable Machine-Learning-Based Task Migration for Multi-Core Real-Time Systems

inferred← citeshttps://doi.org/10.1109/rtcsa.2011.57openalex-snapshot

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

inferred← citeshttps://doi.org/10.1109/rtcsa.2012.47openalex-snapshot

Reducing Preemptions and Migrations in EKG

inferred← citeshttps://doi.org/10.1109/rtcsa50079.2020.9203605openalex-snapshot

A Soft-Real-Time-Optimal Semi-Clustered Scheduler with a Constant Tardiness Bound

inferred← citeshttps://doi.org/10.1109/smartcity.2015.194openalex-snapshot

A Discrete DP-Wrap Scheduling Algorithm for Multiprocessor Systems

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

Applications and Challenges of Multi-Core Scheduling in Intelligent Automotive Systems

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

Swapping to reduce preemptions and migrations in EKG

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/3139258.3139277openalex-snapshot

A branch-and-bound algorithm to compute a tighter bound to tardiness for preemptive global EDF scheduler

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

Adaptive partitioning of real-time tasks on multiple processors

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

EDF scheduling of real-time tasks on multiple cores

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

SimPFair: tight fairness at low cost

inferred← citeshttps://doi.org/10.3390/jlpea12020026openalex-snapshot

A Generalistic Approach to Machine-Learning-Supported Task Migration on Real-Time Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1312.4509openalex-snapshot

Cache-aware static scheduling for hard real-time multicore systems based on communication affinities

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.