On the public citation graph

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

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

0 signed · 109 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-007-9022-5openalex-snapshot

The partitioned dynamic-priority scheduling of sporadic task systems

inferredcites →https://doi.org/10.1016/j.jcss.2003.08.002openalex-snapshot

Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

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

An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems

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

Sporadic Multiprocessor Scheduling with Few Preemptions

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/rtcsa.2006.45openalex-snapshot

Multiprocessor Scheduling with Few Preemptions

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

Real-Time Scheduling with Task Splitting on Multiprocessors

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

Tardiness Bounds under Global EDF Scheduling on a Multiprocessor

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

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

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-27198-9openalex-snapshot

Techniques for Building Timing-Predictable Embedded Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_4openalex-snapshot

Analyzing Preemptive Global Scheduling

inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_6openalex-snapshot

Liu and Layland’s Utilization Bound

inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_7openalex-snapshot

Parametric Utilization Bounds

inferred← citeshttps://doi.org/10.1007/978-3-642-13550-7_4openalex-snapshot

Implementing Multicore Real-Time Scheduling Algorithms Based on Task Splitting Using Ada 2012

inferred← citeshttps://doi.org/10.1007/978-981-10-3174-8_35openalex-snapshot

Analysis of Power Management Techniques in Multicore Processors

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

Semi-partitioned Multiprocessor Scheduling

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

Semi-partitioned Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1007/s10470-012-9963-zopenalex-snapshot

Resource management implications and strategies for SDR clouds

inferred← citeshttps://doi.org/10.1007/s11241-009-9073-xopenalex-snapshot

Optimal virtual cluster-based multiprocessor scheduling

inferred← citeshttps://doi.org/10.1007/s11241-011-9114-0openalex-snapshot

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

inferred← citeshttps://doi.org/10.1007/s11241-011-9121-1openalex-snapshot

Cluster scheduling for real-time systems: utilization bounds and run-time overhead

inferred← citeshttps://doi.org/10.1007/s11241-011-9126-9openalex-snapshot

Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

inferred← citeshttps://doi.org/10.1007/s11241-011-9127-8openalex-snapshot

CPU scheduling and memory management for interactive real-time applications

inferred← citeshttps://doi.org/10.1007/s11241-011-9130-0openalex-snapshot

DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

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

FPSL, FPCL and FPZL schedulability analysis

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-012-9165-xopenalex-snapshot

Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach

inferred← citeshttps://doi.org/10.1007/s11241-014-9204-xopenalex-snapshot

Unified overhead-aware schedulability analysis for slot-based task-splitting

inferred← citeshttps://doi.org/10.1007/s11241-016-9258-zopenalex-snapshot

Real-time scheduling algorithm for safety-critical systems on faulty multicore environments

inferred← citeshttps://doi.org/10.1007/s11241-020-09359-8openalex-snapshot

Statically optimal dynamic soft real-time semi-partitioned scheduling

inferred← citeshttps://doi.org/10.1007/s11265-015-0983-7openalex-snapshot

Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems

inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.06.003openalex-snapshot

An optimal boundary fair scheduling algorithm for multiprocessor real-time systems

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

Global EDF-based scheduling with laxity-driven priority promotion

inferred← citeshttps://doi.org/10.1016/j.sysarc.2011.02.008openalex-snapshot

Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

inferred← citeshttps://doi.org/10.1109/access.2020.3044724openalex-snapshot

Improvement to Semi-Partitioned Cyclic Executives for Mixed-Criticality Scheduling on Multiprocessor Platforms

inferred← citeshttps://doi.org/10.1109/access.2021.3120743openalex-snapshot

Q-CSF: Quantum-Aware Compositional Scheduling Framework for Hierarchical Real-Time Systems

inferred← citeshttps://doi.org/10.1109/cdc.2017.8264042openalex-snapshot

An efficient partial-order representation of feasible schedules for online decisions

inferred← citeshttps://doi.org/10.1109/date.2012.6176521openalex-snapshot

Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

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

Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors

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

Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors

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

AIRS: Supporting Interactive Real-Time Applications on Multicore Platforms

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

DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling

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

Is Semi-Partitioned Scheduling Practical?

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

An Optimal Semi-partitioned Scheduler for Uniform Heterogeneous Multiprocessors

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/iccke.2013.6682836openalex-snapshot

Scheduling hard real-time tasks on multi-core using intelligent rate-monotonic

inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470458openalex-snapshot

Load regulating algorithm for static-priority task scheduling on multiprocessors

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

Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.305openalex-snapshot

Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound

inferred← citeshttps://doi.org/10.1109/isorc.2018.00011openalex-snapshot

Mixed-Criticality Scheduling on Multiprocessors with Service Guarantees

inferred← citeshttps://doi.org/10.1109/isqed.2014.6783338openalex-snapshot

Multi-core partitioned scheduling for fixed-priority periodic real-time tasks with enhanced RBound

inferred← citeshttps://doi.org/10.1109/nrsc.2015.7117843openalex-snapshot

C24. Harmonic semi-partitioning scheduling algorithm for multi-core real-time systems

inferred← citeshttps://doi.org/10.1109/pestse.2014.6805324openalex-snapshot

Optimal task allocation and scheduling for power saving in multiprocessor systems

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

Semi-partitioned Fixed-Priority Scheduling on Multiprocessors

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

A Bandwidth Reservation Strategy for Multiprocessor Real-Time Scheduling

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

Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound

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

Maximizing Contention-Free Executions in Multiprocessor Scheduling

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

pCOMPATS: Period-Compatible Task Allocation and Splitting on Multi-core Processors

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/rtas52030.2021.00025openalex-snapshot

Effectively Scheduling Hard and Soft Real-Time Tasks on Multiprocessors

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

A Study of Utilization Bound and Run-Time Overhead for Cluster Scheduling in Multiprocessor Real-Time Systems

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

Practical Aspects of Slot-Based Task-Splitting Dispatching in Its Schedulability Analysis

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

Optimal semi-partitioned scheduling in soft real-time systems

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

Preemption-Light Multiprocessor Scheduling of Sporadic Tasks with High Utilisation Bound

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

Gang EDF Scheduling of Parallel Task Systems

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.1109/rtss.2011.19openalex-snapshot

Workload-Aware Partitioning for Maintaining Temporal Consistency upon Multiprocessor Platforms

inferred← citeshttps://doi.org/10.1109/sies.2011.5953668openalex-snapshot

Implementation and empirical comparison of partitioning-based multi-core scheduling

inferred← citeshttps://doi.org/10.1109/sies.2011.5953669openalex-snapshot

Implementing slot-based task-splitting multiprocessor scheduling

inferred← citeshttps://doi.org/10.1109/sies.2013.6601476openalex-snapshot

Efficient semi-partitioning and rate-monotonic scheduling hard real-time tasks on multi-core systems

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

Temporal Consistency Maintenance Upon Partitioned Multiprocessor Platforms

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

Task Splitting and Load Balancing of Dynamic Real-Time Workloads for Semi-Partitioned 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.2012.114openalex-snapshot

Online Real-Time Task Scheduling in Heterogeneous Multicore System-on-a-Chip

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

Harmonic-Aware Multi-Core Scheduling for Fixed-Priority Real-Time Systems

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/trustcom.2013.151openalex-snapshot

Partitioned Fixed-Priority Real-Time Scheduling Based on Dependent Task-Split on Multicore Platform

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

A survey of hard real-time scheduling for multiprocessor systems

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

Dynamic Cache Reconfiguration for Soft Real-Time Systems

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

CloudIQ

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

Contention-free executions for real-time multiprocessor scheduling

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

Soft Real-Time Semi-Partitioned Scheduling with Restricted Migrations on Uniform Heterogeneous Multiprocessors

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

Harmonic Segment-Based Semi-Partitioning Scheduling on Multi-Core Real-Time Systems

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

Tableau

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

Optimal soft real-time semi-partitioned scheduling made simple (and dynamic)

inferred← citeshttps://doi.org/10.1166/jolpe.2011.1113openalex-snapshot

Dynamic Reconfiguration of Two-Level Cache Hierarchy in Real-Time Embedded Systems

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

Multi-Level Contention-Free Policy for Rate Monotonic Scheduling Algorithm on 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.17615/ttv4-ve96openalex-snapshot

REAL-TIME SCHEDULING ON ASYMMETRIC MULTIPROCESSOR PLATFORMS

inferred← citeshttps://doi.org/10.25148/etd.fi14040815openalex-snapshot

Real-Time Scheduling of Embedded Applications on Multi-Core Platforms

inferred← citeshttps://doi.org/10.32657/10220/47564openalex-snapshot

Multi-core mixed-criticality real-time scheduling

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

Contention-Free Scheduling for Single Preemption Multiprocessor Platforms

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

Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors

inferred← citeshttps://doi.org/10.34626/nfq4-be32openalex-snapshot

Real-Time Scheduling on Multi-core: Theory and Practice

inferred← citeshttps://doi.org/10.4230/oasics.ppes.2011.42openalex-snapshot

Towards the Implementation and Evaluation of Semi-Partitioned Multi-Core Scheduling

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

An Optimal Real-Time Scheduling Approach: From Multiprocessor to Uniprocessor

inferred← citeshttps://doi.org/10.5555/2492708.2492834openalex-snapshot

Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

inferred← citeshttps://doi.org/10.5626/jcse.2013.7.1.67openalex-snapshot

Multicore Real-Time Scheduling to Reduce Inter-Thread Cache Interferences

inferred← citeshttps://doi.org/10.5772/9452openalex-snapshot

A Fixed-Priority Scheduling Algorithm for Multiprocessor Real-Time Systems

inferred← citeshttps://doi.org/10.70675/4f374b8dz5fb0z4537zb8eaz04f320422ae5openalex-snapshot

Aide à la validation temporelle et au dimensionnement de systèmes temps réels dans une démarche dirigée par modèles

inferred← citeshttps://doi.org/10.70675/82225956z8862z4aeaz85f3z3f6eb0f5ac10openalex-snapshot

Etude et évaluation de politiques d'ordonnancement temps réel multiprocesseur

inferred← citeshttps://doi.org/10.70675/9c563d95zfd8cz496dzb1ebz292fe5bcb815openalex-snapshot

Energy efficient scheduling of parallel real-time tasks on heterogeneous multicore systems

showing the first 97 of 98 · page through all 98

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.