On the public citation graph
Multiprocessor Scheduling with Few Preemptions
0 signed · 159 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.
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.
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/bf01995675openalex-snapshot
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
inferredcites →https://doi.org/10.1016/0166-5316(82)90024-4openalex-snapshot
On the complexity of fixed-priority scheduling of periodic, real-time tasks
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/j.jcss.2003.08.002openalex-snapshot
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
inferredcites →https://doi.org/10.1023/a:1008098013753openalex-snapshot
Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment
inferredcites →https://doi.org/10.1109/ipps.1992.223068openalex-snapshot
Multiprocessor scheduling of periodic tasks in a hard real-time environment
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.2006.45openalex-snapshot
Multiprocessor Scheduling with Few Preemptions
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1287/opre.26.1.127openalex-snapshot
On a Real-Time Scheduling Problem
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-030-79701-0_2openalex-snapshot
Real-Time Scheduling: Background and Trends
inferred← citeshttps://doi.org/10.1007/978-3-032-19684-2_15openalex-snapshot
Scheduling Algorithm with Setting Semi-highest Priority and Schedulability Test
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-94-007-2792-2_32openalex-snapshot
Energy-Constrained Scheduling for Weakly-Hard Real-Time Tasks on Multiprocessors
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/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/s10617-012-9086-xopenalex-snapshot
On the hard-real-time scheduling of embedded streaming applications
inferred← citeshttps://doi.org/10.1007/s10846-021-01477-0openalex-snapshot
Distributed Planning for Serving Cooperative Tasks with Time Windows: A Game Theoretic Approach
inferred← citeshttps://doi.org/10.1007/s11227-021-04101-yopenalex-snapshot
Semi-partitioned scheduling of mixed-criticality system on multiprocessor platforms
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-9120-2openalex-snapshot
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
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-9130-0openalex-snapshot
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling
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-9201-0openalex-snapshot
An optimal boundary fair scheduling
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-9251-6openalex-snapshot
Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-016-9257-0openalex-snapshot
Real-time processing of streaming big data
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/c2012-0-07058-5openalex-snapshot
High-Performance Embedded Computing
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2015.07.003openalex-snapshot
An unfair semi-greedy real-time multiprocessor scheduling algorithm
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.12.007openalex-snapshot
A new fair scheduling algorithm for periodic tasks on multiprocessors
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.2017.11.027openalex-snapshot
Multi-level contention-free policy for real-time multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.jss.2020.110886openalex-snapshot
Dynamic partitioned scheduling of real-time tasks on ARM big.LITTLE architectures
inferred← citeshttps://doi.org/10.1016/j.suscom.2017.06.001openalex-snapshot
LAMCS: A leakage aware DVFS based mixed task set scheduler for multi-core processors
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.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.1016/j.sysarc.2021.102313openalex-snapshot
An exact comparison of global, partitioned, and semi-partitioned fixed-priority real-time multiprocessor schedulers
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/cbase67452.2025.11335502openalex-snapshot
Functional-Safety-Aware Semi-Partitioned Scheduling for Mixed-Criticality Systems
inferred← citeshttps://doi.org/10.1109/cec.2011.5949712openalex-snapshot
GART: A genetic algorithm based real-time system scheduler
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/ecrts.2008.15openalex-snapshot
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1109/ecrts.2008.28openalex-snapshot
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
inferred← citeshttps://doi.org/10.1109/ecrts.2008.9openalex-snapshot
Sporadic Multiprocessor Scheduling with Few Preemptions
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.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.2012.36openalex-snapshot
U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks
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.25openalex-snapshot
An Optimal Semi-partitioned Scheduler for Uniform Heterogeneous Multiprocessors
inferred← citeshttps://doi.org/10.1109/ic3.2014.6897184openalex-snapshot
Design and development of a real time scheduling algorithm for mixed task set on multi-core processors
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/icitcs.2015.7292943openalex-snapshot
An Efficient Zero-Laxity Based Real-Time Multiprocessor Scheduling Algorithm
inferred← citeshttps://doi.org/10.1109/icoa.2019.8727672openalex-snapshot
Reducing the inter processor preemptions of the EDHS 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/ipdps.2008.4536299openalex-snapshot
Portioned static-priority scheduling on multiprocessors
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/isorc.2008.19openalex-snapshot
Energy-Efficient Optimal Real-Time Scheduling on Multiprocessors
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/les.2010.2089672openalex-snapshot
A Low-Overhead Partition-Oriented ERfair Scheduler for Hard Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1109/rtas.2008.17openalex-snapshot
Equivalence between Schedule Representations: Theory and Applications
inferred← citeshttps://doi.org/10.1109/rtas.2009.25openalex-snapshot
Notional Processors: An Approach for Multiprocessor Scheduling
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/rtas61025.2024.00028openalex-snapshot
Strict Partitioning for Sporadic Rigid Gang Tasks
inferred← citeshttps://doi.org/10.1109/rtcsa.2007.61openalex-snapshot
Real-Time Scheduling with Task Splitting on Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtcsa.2008.15openalex-snapshot
New Abstraction for Optimal Real-Time Scheduling on Multiprocessors
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.2011.67openalex-snapshot
Practical Aspects of Slot-Based Task-Splitting Dispatching in Its Schedulability Analysis
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.2014.6910532openalex-snapshot
Optimal semi-partitioned scheduling in soft real-time systems
inferred← citeshttps://doi.org/10.1109/rtss.2007.31openalex-snapshot
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtss.2007.41openalex-snapshot
Adapting Futures: Scalability for Real-World Computing
inferred← citeshttps://doi.org/10.1109/rtss.2008.44openalex-snapshot
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1109/rtss.2010.13openalex-snapshot
LLF Schedulability Analysis on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/rtss.2010.22openalex-snapshot
Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules
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.29openalex-snapshot
Response Time Analysis of Hierarchical Scheduling: The Synchronized Deferrable Servers Approach
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/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/sbesc60926.2023.10324260openalex-snapshot
Partitioning and Server Shadowing for Scheduling Periodic Real-time Tasks on Multiprocessors
inferred← citeshttps://doi.org/10.1109/sies.2008.4577677openalex-snapshot
Dynamic voltage and frequency scaling for optimal real-time scheduling on multiprocessors
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.6601479openalex-snapshot
Towards implementation of Virtual-Clustered multiprocessor scheduling in Linux
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.2008.129openalex-snapshot
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
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/trustcom.2013.151openalex-snapshot
Partitioned Fixed-Priority Real-Time Scheduling Based on Dependent Task-Split on Multicore Platform
inferred← citeshttps://doi.org/10.1109/uemcon53757.2021.9666584openalex-snapshot
Energy-Aware Task Migration Through Ant-Colony Optimization for Multiprocessors
inferred← citeshttps://doi.org/10.1145/1450058.1450078openalex-snapshot
Portioned EDF-based scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1145/1644993.1645064openalex-snapshot
Optimal RM scheduling for simply periodic tasks on uniform multiprocessors
inferred← citeshttps://doi.org/10.1145/1851166.1851173openalex-snapshot
Multiprocessor real-time scheduling considering concurrency and urgency
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/2038617.2038625openalex-snapshot
Swapping to reduce preemptions and migrations in EKG
inferred← citeshttps://doi.org/10.1145/2038642.2038672openalex-snapshot
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
inferred← citeshttps://doi.org/10.1145/2245276.2232032openalex-snapshot
A semi-partitioned real-time scheduling approach for periodic task systems on multicore 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/2452537.2452546openalex-snapshot
Enhancing the real-time capabilities of the Linux kernel
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/3341105.3373937openalex-snapshot
Adaptive partitioning of real-time tasks on multiple processors
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.1145/3412816.3412817openalex-snapshot
EDF scheduling of real-time tasks on multiple cores
inferred← citeshttps://doi.org/10.1145/3412821.3412824openalex-snapshot
An adaptive, utilization-based approach to schedule real-time tasks for ARM big.LITTLE architectures
inferred← citeshttps://doi.org/10.11606/d.55.2010.tde-19052010-163816openalex-snapshot
Provisão integrada de QoS relativa e absoluta em serviços computacionais interativos com requisitos de responsividade de tempo real
inferred← citeshttps://doi.org/10.1201/9781003338413-4openalex-snapshot
Mapping, Scheduling, and Schedulability Analysis
inferred← citeshttps://doi.org/10.12677/csa.2022.1212298openalex-snapshot
A Task Scheduling Algorithm Based on uC/OS-II and Its Improved Implementation
inferred← citeshttps://doi.org/10.12694/scpe.v19i3.1397openalex-snapshot
Reducing the Interprocessors Migrations of the EKG Algorithm
inferred← citeshttps://doi.org/10.17615/ttv4-ve96openalex-snapshot
REAL-TIME SCHEDULING ON ASYMMETRIC MULTIPROCESSOR PLATFORMS
inferred← citeshttps://doi.org/10.2197/ipsjjip.26.202openalex-snapshot
Multiprocessor Semi-fixed-priority Scheduling
inferred← citeshttps://doi.org/10.2478/s13537-011-0023-zopenalex-snapshot
Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors
inferred← citeshttps://doi.org/10.26076/310a-0e50openalex-snapshot
An Energy-Efficient Semi-Partitioned Approach for Hard Real-Time Systems with Voltage and Frequency Islands
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/sym12091515openalex-snapshot
Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System
inferred← citeshttps://doi.org/10.3390/sym13081488openalex-snapshot
Dynamic Priority Real-Time Scheduling on Power Asymmetric Multicore Processors
inferred← citeshttps://doi.org/10.34626/3r8w-w070openalex-snapshot
Energy and Temperature Aware Real-Time Systems
inferred← citeshttps://doi.org/10.34626/nfq4-be32openalex-snapshot
Real-Time Scheduling on Multi-core: Theory and Practice
inferred← citeshttps://doi.org/10.4018/978-1-60960-827-9.ch011openalex-snapshot
Execution and Resource Management in QoS-Aware Virtualized Infrastructures
inferred← citeshttps://doi.org/10.4218/etrij.15.0114.0349openalex-snapshot
Energy-constrained Real-time Scheduling for Tasks with (m, k)-firm Deadlines on Multiprocessors
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.4304/jsw.6.11.2308-2320openalex-snapshot
Two-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1001.3716openalex-snapshot
A Multicore Processor based Real-Time System for Automobile management application
inferred← citeshttps://doi.org/10.48550/arxiv.1512.07351openalex-snapshot
Energy-aware Fixed-Priority Multi-core Scheduling for Real-time Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08540openalex-snapshot
Distributed Planning for Serving Cooperative Tasks with Time Windows: A Game Theoretic Approach
inferred← citeshttps://doi.org/10.5392/jkca.2009.9.12.052openalex-snapshot
Optimal RM Scheduling for Simply Periodic Tasks on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.5555/2616606.2617117openalex-snapshot
System-level scheduling of real-time streaming applications using a semi-partitioned approach
inferred← citeshttps://doi.org/10.5772/9452openalex-snapshot
A Fixed-Priority Scheduling Algorithm for Multiprocessor Real-Time Systems
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/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/5cb5afb1z8f17z4224zbfb5z748ab69171cfopenalex-snapshot
Task scheduling on heterogeneous multi-core
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/82225956z8862z4aeaz85f3z3f6eb0f5ac10openalex-snapshot
Etude et évaluation de politiques d'ordonnancement temps réel multiprocesseur
inferred← citeshttps://doi.org/10.70675/8ea528dfz70f5z4f61z83f8z822b93d5be62openalex-snapshot
Sûreté temporelle pour les systèmes temps réel multiprocesseurs
inferred← citeshttps://doi.org/10.70675/9c563d95zfd8cz496dzb1ebz292fe5bcb815openalex-snapshot
Energy efficient scheduling of parallel real-time tasks on heterogeneous multicore systems
inferred← citeshttps://doi.org/10.70675/d090d426za945z4753za48dzc1a208094436openalex-snapshot
Stochastic analysis of stationary real-time systems
inferred← citeshttps://doi.org/10.70675/f440e352z52f5z4c4dz8879ze373d63c1825openalex-snapshot
Analyse et ordonnancement d’un système hiérarchique virtualisé composé d’applications temps réel strictes
inferred← citeshttps://doi.org/10.7763/lnse.2013.v1.14openalex-snapshot
A Hierarchical Scheduling Approach for Symmetric Multiprocessing Based Real Time Systems on VxWorks
showing the first 147 of 148 · page through all 148
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.