On the public citation graph

Maximizing Contention-Free Executions in Multiprocessor Scheduling

https://doi.org/10.1109/rtas.2011.30

0 signed · 51 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-008-9061-6openalex-snapshot

EDZL scheduling analysis

inferredcites →https://doi.org/10.1007/s11241-009-9073-xopenalex-snapshot

Optimal virtual cluster-based multiprocessor scheduling

inferredcites →https://doi.org/10.1007/s11241-010-9092-7openalex-snapshot

Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

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/s0020-0190(02)00231-4openalex-snapshot

Deadline-based scheduling of periodic task systems on multiprocessors

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

Work-Conserving Optimal Real-Time Scheduling on Multiprocessors

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

Sporadic Multiprocessor Scheduling with Few Preemptions

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/emrts.2000.853990openalex-snapshot

Early-release fair scheduling

inferredcites →https://doi.org/10.1109/real.2001.990610openalex-snapshot

Static-priority scheduling on multiprocessors

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

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

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

LLF Schedulability Analysis on Multiprocessor Platforms

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

Proportionate progress

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-981-19-5331-6_2openalex-snapshot

Exploring the Scheduling Techniques for the RTOS

inferred← citeshttps://doi.org/10.1007/s00607-017-0562-9openalex-snapshot

Real-time uniprocessor scheduling with fewer preemptions

inferred← citeshttps://doi.org/10.1007/s11241-012-9157-xopenalex-snapshot

Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

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.1016/j.jpdc.2014.06.011openalex-snapshot

Using an adversary simulator to evaluate global EDF scheduling of sporadic task sets on multiprocessors

inferred← citeshttps://doi.org/10.1016/j.jss.2011.07.002openalex-snapshot

Zero-laxity based real-time multiprocessor scheduling

inferred← citeshttps://doi.org/10.1016/j.jss.2014.11.019openalex-snapshot

Capturing urgency and parallelism using quasi-deadlines for real-time multiprocessor scheduling

inferred← citeshttps://doi.org/10.1016/j.jss.2015.12.004openalex-snapshot

Thread-level priority assignment in global multiprocessor scheduling for DAG tasks

inferred← citeshttps://doi.org/10.1016/j.jss.2017.11.027openalex-snapshot

Multi-level contention-free policy for real-time multiprocessor scheduling

inferred← citeshttps://doi.org/10.1016/j.jss.2019.04.067openalex-snapshot

Improved schedulability analysis of the contention-free policy for real-time systems

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

Schedulability Performance Improvement via Task Split in Real-Time Systems

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/icpads.2016.0046openalex-snapshot

An Optimized RM Algorithm by Task Affinity on Multi-Core Processor

inferred← citeshttps://doi.org/10.1109/les.2024.3376801openalex-snapshot

A Graph Attention Network Approach to Partitioned Scheduling in Real-Time Systems

inferred← citeshttps://doi.org/10.1109/rtas.2012.33openalex-snapshot

Schedulability Analysis and Priority Assignment for Global Job-Level Fixed-Priority Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1109/rtas.2015.7108416openalex-snapshot

The Packing Server for real-time scheduling of MapReduce workflows

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

ML for RT: Priority Assignment Using Machine Learning

inferred← citeshttps://doi.org/10.1109/rtss.2012.56openalex-snapshot

Controlling Preemption for Better Schedulability in Multi-Core Systems

inferred← citeshttps://doi.org/10.1109/rtss.2012.58openalex-snapshot

Extending Task-level to Job-level Fixed Priority Assignment and Schedulability Analysis Using Pseudo-deadlines

inferred← citeshttps://doi.org/10.1109/rtss.2017.00038openalex-snapshot

Beyond Implicit-Deadline Optimality: A Multiprocessor Scheduling Framework for Constrained-Deadline Tasks

inferred← citeshttps://doi.org/10.1109/tc.2012.279openalex-snapshot

Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems

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.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/tse.2012.75openalex-snapshot

EDZL Schedulability Analysis in Real-Time Multicore Scheduling

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

Contention-free executions for real-time multiprocessor scheduling

inferred← citeshttps://doi.org/10.11591/ijece.v10i2.pp1805-1813openalex-snapshot

Reinforcement learning based multi core scheduling (RLBMCS) for real time systems

inferred← citeshttps://doi.org/10.14801/jkiit.2019.17.9.31openalex-snapshot

Response-Time Analysis for Contention-Free Fixed-Priority Scheduling Algorithm

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

A Task Parameter Inference Framework for Real-Time Embedded Systems

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

Contention-Free Scheduling for Single Preemption Multiprocessor Platforms

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

Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System

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.