On the public citation graph

RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor

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

0 signed · 150 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.3800210113openalex-snapshot

Some simple scheduling algorithms

inferredcites →https://doi.org/10.1007/978-3-642-59312-3openalex-snapshot

Elements of Mathematics

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

Scheduling aperiodic tasks in dynamic priority systems

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

Proportionate Progress: A Notion of Fairness in Resource Allocation

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

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

inferredcites →https://doi.org/10.1007/s00453-007-9083-9openalex-snapshot

Generalization of EDF and LLF: Identifying All Optimal Online Algorithms for Minimizing Maximum Lateness

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.1007/s11241-010-9109-2openalex-snapshot

LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

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

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

inferredcites →https://doi.org/10.1016/s0020-0190(01)00148-xopenalex-snapshot

Scheduling periodic tasks on uniform multiprocessors

inferredcites →https://doi.org/10.1023/a:1008030427220openalex-snapshot

Generalized Multiframe Tasks

inferredcites →https://doi.org/10.1023/b:time.0000048932.30002.d9openalex-snapshot

Rate Monotonic vs. EDF: Judgment Day

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

On-line scheduling of real-time tasks

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

Multiprocessor online scheduling of hard-real-time tasks

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

Scheduling coprocessor for enhanced least-laxity-first scheduling in hard real-time systems

inferredcites →https://doi.org/10.1109/emwrts.1997.613785openalex-snapshot

A scheme for scheduling hard real-time applications in open system environment

inferredcites →https://doi.org/10.1109/ipps.1995.395946openalex-snapshot

Fast scheduling of periodic tasks on multiple resources

inferredcites →https://doi.org/10.1109/isorc.2006.64openalex-snapshot

Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems

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/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/rtas.2010.35openalex-snapshot

A Bandwidth Reservation Strategy for Multiprocessor Real-Time Scheduling

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

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

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

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

Approximation Algorithms for NP-Hard Problems

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

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

inferredcites →https://doi.org/10.1201/9780203489802-37openalex-snapshot

Scheduling real-time tasks: algorithms and complexity

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

Scheduling with Deadlines and Loss Functions

inferredcites →https://doi.org/10.1287/opre.27.5.925openalex-snapshot

Preemptive Scheduling with Due Dates

inferredcites →https://doi.org/10.17615/nyex-d314openalex-snapshot

The multiprocessor real-time scheduling of general task systems

inferredcites →https://doi.org/10.3233/emc-2005-00052openalex-snapshot

Adapting Pfair scheduling for symmetric multiprocessors

inferredcites →https://doi.org/10.5555/314613.314707openalex-snapshot

The power of migration in multi-processor scheduling of real-time systems

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

Analysis and Performance Measure of Dynamic Cluster Based Hierarchical Real Time Scheduling for Distributed Systems

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-642-54477-4_6-1openalex-snapshot

Mixed-Criticality Real-Time Systems

inferred← citeshttps://doi.org/10.1007/978-981-15-6401-7_5-1openalex-snapshot

Real-Time Scheduling for Computing Architectures

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

Multiprocessor Real-Time Locking Protocols

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-287-251-7_3openalex-snapshot

Practical Considerations in Optimal Multiprocessor 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_10-1openalex-snapshot

Multiprocessor Real-Time Locking Protocols

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

Semi-partitioned Multiprocessor Scheduling

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

Practical Considerations in Optimal Multiprocessor 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/978-981-97-9314-3_5openalex-snapshot

Real-Time Scheduling for Computing Architectures

inferred← citeshttps://doi.org/10.1007/s10617-023-09267-7openalex-snapshot

Scheduling and energy savings for small scale embedded FreeRTOS-based real-time systems

inferred← citeshttps://doi.org/10.1007/s10617-023-09268-6openalex-snapshot

Supporting single and multi-core resource access protocols on object-oriented RTOSes

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-013-9190-4openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s11241-014-9201-0openalex-snapshot

An optimal boundary fair 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-016-9251-6openalex-snapshot

Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems

inferred← citeshttps://doi.org/10.1007/s11241-017-9284-5openalex-snapshot

rt-muse: measuring real-time characteristics of execution platforms

inferred← citeshttps://doi.org/10.1007/s11241-017-9291-6openalex-snapshot

Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors

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.1007/s11241-021-09367-2openalex-snapshot

Dynamic power management under the RUN scheduling algorithm: a slack filling approach

inferred← citeshttps://doi.org/10.1007/s11241-021-09374-3openalex-snapshot

Shared resources in multiprocessor real-time systems scheduled by RUN

inferred← citeshttps://doi.org/10.1007/s11241-025-09435-xopenalex-snapshot

Worst case response time analysis for completely fair scheduling in Linux systems

inferred← citeshttps://doi.org/10.1016/c2012-0-07058-5openalex-snapshot

High-Performance Embedded Computing

inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.036openalex-snapshot

Real time scheduler for multiprocessor systems based on continuous control using Timed Continuous Petri Nets

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.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.1080/17445760.2023.2243420openalex-snapshot

mcDVFS: cycle conserving DVFS scheduler for multi-core mixed criticality systems

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

Optimal Multiprocessor Real-Time Scheduling Based on RUN for Practical Imprecise Computation with Harmonic Periodic Task Sets

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

U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks

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

Reducing Tardiness under Global Scheduling by Splitting Jobs

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

Global EDF Schedulability Analysis for Synchronous Parallel Tasks on Multicore Platforms

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

OUTSTANDING PAPER: Optimal and Adaptive Multiprocessor Real-Time Scheduling: The Quasi-Partitioning Approach

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

Putting RUN into Practice: Implementation and Evaluation

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

Experimental Evaluation of Optimal Schedulers Based on Partitioned Proportionate Fairness

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

WCET(m) Estimation in Multi-core Systems Using Single Core Equivalence

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/etfa.2015.7301484openalex-snapshot

Scheduling of mixed-criticality systems with RUN

inferred← citeshttps://doi.org/10.1109/icpads47876.2019.00063openalex-snapshot

Implementation of Fluid Scheduling Using IPC Control Mechanism

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

Seeking Time-Composable Partitions of Tasks for COTS Multicore Processors

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

Optimal Multiprocessor Real-Time Scheduling Based on RUN with Voltage and Frequency Scaling

inferred← citeshttps://doi.org/10.1109/isorc49007.2020.00015openalex-snapshot

Heuristic partitioning of real-time tasks on multi-processors

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/mcsoc2018.2018.00028openalex-snapshot

A Novel Task-to-Processor Assignment Approach for Optimal Multiprocessor Real-Time Scheduling

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

Scaling global scheduling with message passing

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

Reducing Preemptions and Migrations in EKG

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

The Carousel-EDF scheduling algorithm for multiprocessor systems

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

Adaptive Local Assignment Algorithm for Scheduling Soft-Aperiodic Tasks on Multiprocessors

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/rtcsa52859.2021.00010openalex-snapshot

Processor and Bus Co-scheduling Strategies for Real-time Tasks with Multiple Service-levels

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

Time-Reversibility of Schedulability Tests

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

MC-Fluid: Fluid Model-Based Mixed-Criticality Scheduling on Multiprocessors

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

Optimal Real-Time Scheduling on Two-Type Heterogeneous Multicore Platforms

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/rtss52674.2021.00033openalex-snapshot

Heterogeneous Quasi-Partitioned Scheduling

inferred← citeshttps://doi.org/10.1109/rtss59052.2023.00043openalex-snapshot

Work-in-Progress: Towards an Autonomous Real-Time Scheduling Framework for Multi-Core Platforms

inferred← citeshttps://doi.org/10.1109/sbesc.2014.32openalex-snapshot

Revealing the Secrets of RUN and QPS: New Trends for Optimal Real-Time Multiprocessor Scheduling

inferred← citeshttps://doi.org/10.1109/sbesc49506.2019.9046074openalex-snapshot

Improved task packing for shared resources in multiprocessor real-time systems scheduled by RUN under SBLP

inferred← citeshttps://doi.org/10.1109/sbesc51047.2020.9277858openalex-snapshot

On the Design and Implementation of Real-Time Resource Access Protocols

inferred← citeshttps://doi.org/10.1109/sbesc60926.2023.10324231openalex-snapshot

Dealing with Soft Aperiodic Tasks in RUN

inferred← citeshttps://doi.org/10.1109/sbesc60926.2023.10324260openalex-snapshot

Partitioning and Server Shadowing for Scheduling Periodic Real-time Tasks on Multiprocessors

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

System-Wide Time versus Density Tradeoff in Real-Time Multicore Fluid Scheduling

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

DAG-Fluid: A Real-Time Scheduling Algorithm for DAGs

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

Multiprocessor Real-Time Systems with Shared Resources: Utilization Bound and Mapping

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

Global EDF Schedulability Analysis for Parallel Tasks on Multi-Core Platforms

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

A global optimal scheduling algorithm for multiprocessor low-power platforms

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

An evaluation of the RUN algorithm in LITMUS RT

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

Supporting Global Resource Sharing in RUN-scheduled Multiprocessor Systems

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

Optimizing Preemption-Overhead Accounting in Multiprocessor Real-Time Systems

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

SPRINT

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

Generalized mixed-criticality scheduling based on RUN

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

Performance evaluation of RUNT algorithm

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

A Survey of Research into Mixed Criticality 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/3139258.3139280openalex-snapshot

Migrate when necessary

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

Tableau

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

Performance Analysis of Real-Time Scheduling Algorithms

inferred← citeshttps://doi.org/10.1201/9781003338413-4openalex-snapshot

Mapping, Scheduling, and Schedulability Analysis

inferred← citeshttps://doi.org/10.2197/ipsjjip.26.202openalex-snapshot

Multiprocessor Semi-fixed-priority Scheduling

inferred← citeshttps://doi.org/10.23919/date.2017.7927090openalex-snapshot

Near-optimal deployment of dataflow applications on many-core platforms with real-time guarantees

inferred← citeshttps://doi.org/10.25560/33813openalex-snapshot

Energy-efficient optimal control for real-time computing systems

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

A Comparative Study on the Schedulability of the EDZL Scheduling Algorithm on Multiprocessors

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

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

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

inferred← citeshttps://doi.org/10.4230/lipics.ecrts.2020.6openalex-snapshot

Analysis of EDF for Real-Time Multiprocessor Systems with Resource Sharing

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

Migrate when necessary: toward partitioned reclaiming for soft real-time tasks

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/1caeb214za920z4f71z986ez2d0b61df720fopenalex-snapshot

Scheduling of Dependent Tasks with Probabilistic Execution Times on Multi-core Processors

inferred← citeshttps://doi.org/10.70675/674710dbz7113z4bdez9666z8cb40f7a8eb5openalex-snapshot

Mise en oeuvre de politiques d'ordonnancement temps réel multiprocesseur prouvée

inferred← citeshttps://doi.org/10.70675/807a2565zc27fz441fzb8d8zfae60f0c133bopenalex-snapshot

Scheduling sequential or parallel hard real-time pre-emptive tasks upon identical multiprocessor platforms

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/a9f7a5a5z36d4z4148zbff7z01f09c833679openalex-snapshot

Scheduling of parallel real-time DAG tasks on multiprocessor systems

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.