On the public citation graph

Proportionate Progress: A Notion of Fairness in Resource Allocation

https://doi.org/10.1007/bf01940883
0 signed · 641 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/bf01553887openalex-snapshot
A new algorithm for scheduling periodic, real-time tasks
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/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1057/9781137024411_2openalex-snapshot
Production Sets with Indivisibilities Part I: Generalities
inferredcites →https://doi.org/10.1057/9781137024411_3openalex-snapshot
Production Sets with Indivisibilities Part II. The Case of Two Activities
inferredcites →https://doi.org/10.1145/321738.321743openalex-snapshot
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
inferredcites →https://doi.org/10.1145/321921.321936openalex-snapshot
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
inferredcites →https://doi.org/10.1145/322169.322179openalex-snapshot
A Polynomial Algorithm for the Two-Variable Integer Programming Problem
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.2307/1911124openalex-snapshot
Production Sets with Indivisibilities, Part I: Generalities
inferredcites →https://doi.org/10.2307/1913318openalex-snapshot
Production Sets with Indivisibilities, Part II: The Case of Two Activities

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.1091690openalex-extracted
inferred← citeshttps://doi.org/10.1002/rnc.6171openalex-snapshot
Optimal periodic resource allocation in reactive dynamical systems: Application to microalgal production
inferred← citeshttps://doi.org/10.1002/spe.883openalex-snapshot
AQuoSA—adaptive quality of service architecture
inferred← citeshttps://doi.org/10.1007/0-387-23808-5_5openalex-snapshot
Fair Real-Time Scheduling over a Wireless LAN
inferred← citeshttps://doi.org/10.1007/11561071_53openalex-snapshot
Fairness-Free Periodic Scheduling with Vacations
inferred← citeshttps://doi.org/10.1007/11572961_46openalex-snapshot
A Technique to Reduce Preemption Overhead in Real-Time Multiprocessor Task Scheduling
inferred← citeshttps://doi.org/10.1007/11795490_24openalex-snapshot
New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors
inferred← citeshttps://doi.org/10.1007/11802167_29openalex-snapshot
On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances
inferred← citeshttps://doi.org/10.1007/3-540-45873-5_27openalex-snapshot
Synthesis of Robust Control Systems under Resource Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4020-6264-3_76openalex-snapshot
Multi-criteria Scheduling of Soft Real-time Tasks on Uniform Multiprocessors Using Fuzzy Inference
inferred← citeshttps://doi.org/10.1007/978-1-4615-6069-2_1openalex-snapshot
Real-Time Mutable Broadcast Disks
inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_12openalex-snapshot
Priority Scheduling in the Bamboo Garden Trimming Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-22570-4_9openalex-snapshot
Multiprocessor and Distributed Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-030-35092-5_7openalex-snapshot
Importance-Based Scheduling to Manage Multiple Core Defection in Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-60910-8openalex-snapshot
Embedded System Design
inferred← citeshttps://doi.org/10.1007/978-3-030-60910-8_6openalex-snapshot
Application Mapping
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_18openalex-snapshot
Brief Announcement: Towards Proportionate Fair Assignment
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-03889-6_8openalex-snapshot
Robust Scheduling of Dynamic Real-Time Tasks with Low Overhead for Multi-Core Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-27198-9_1openalex-snapshot
Introduction
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_5openalex-snapshot
Analyzing Non-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-319-51963-0_18openalex-snapshot
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_26openalex-snapshot
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
inferred← citeshttps://doi.org/10.1007/978-3-540-25978-7_51openalex-snapshot
Parallel Fair Round Robin Scheduling in WDM Packet Switching Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-68155-7_33openalex-snapshot
A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_25openalex-snapshot
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_8openalex-snapshot
Deadline Monotonic Scheduling on Uniform Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-3-642-10265-3_32openalex-snapshot
Overview of Multicore Requirements towards Real-Time Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-10665-1_39openalex-snapshot
Task Parallel Scheduling over Multi-core System
inferred← citeshttps://doi.org/10.1007/978-3-642-13550-7_1openalex-snapshot
What to Make of Multicore Processors for Reliable Real-Time Systems?
inferred← citeshttps://doi.org/10.1007/978-3-642-15781-3_20openalex-snapshot
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_21openalex-snapshot
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-3-642-21338-0_3openalex-snapshot
Design and Implementation of a Ravenscar Extension for Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-3-642-22027-2_16openalex-snapshot
PFGN: A Hybrid Multiprocessor Real-Time Scheduling Algorithm for Data Stream Management Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54477-4_2-1openalex-snapshot
Multiprocessor Real-Time Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-662-60421-2_4openalex-snapshot
Fortgeschrittene Planungsverfahren
inferred← citeshttps://doi.org/10.1007/978-94-007-0083-3_3openalex-snapshot
Probabilistic Performance Prediction
inferred← citeshttps://doi.org/10.1007/978-94-007-0083-3_4openalex-snapshot
Resource Management
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-15-6401-7_5-1openalex-snapshot
Real-Time Scheduling for Computing Architectures
inferred← citeshttps://doi.org/10.1007/978-981-16-7443-3_7openalex-snapshot
A Survey of Real-Time Scheduling on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1007/978-981-19-8915-5_27openalex-snapshot
Resource Scheduling Algorithm for Heterogeneous High-Performance Clusters
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_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_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/s00224-008-9134-xopenalex-snapshot
Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game
inferred← citeshttps://doi.org/10.1007/s00446-002-0085-1openalex-snapshot
Nearly optimal perfectly periodic schedules
inferred← citeshttps://doi.org/10.1007/s00453-005-1182-xopenalex-snapshot
General Perfectly Periodic Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-009-9360-xopenalex-snapshot
On Centralized Smooth Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-011-9505-6openalex-snapshot
Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
inferred← citeshttps://doi.org/10.1007/s00500-018-3260-4openalex-snapshot
Task scheduling using Ant Colony Optimization in multicore architectures: a survey
inferred← citeshttps://doi.org/10.1007/s00500-023-08039-6openalex-snapshot
Improved particle swarm optimization algorithm based on grouping and its application in hyperparameter optimization
inferred← citeshttps://doi.org/10.1007/s00778-021-00697-yopenalex-snapshot
Fairness in rankings and recommendations: an overview
inferred← citeshttps://doi.org/10.1007/s10617-016-9176-2openalex-snapshot
Energy efficient semi-partitioned scheduling for embedded multiprocessor streaming systems
inferred← citeshttps://doi.org/10.1007/s10626-019-00285-xopenalex-snapshot
Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
inferred← citeshttps://doi.org/10.1007/s10723-007-9086-4openalex-snapshot
Scheduling for Responsive Grids
inferred← citeshttps://doi.org/10.1007/s10951-006-7040-0openalex-snapshot
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
inferred← citeshttps://doi.org/10.1007/s10951-011-0263-8openalex-snapshot
Windows scheduling of arbitrary-length jobs on multiple machines
inferred← citeshttps://doi.org/10.1007/s10951-022-00754-6openalex-snapshot
Equitable scheduling on a single machine
inferred← citeshttps://doi.org/10.1007/s11227-014-1310-yopenalex-snapshot
A dual speed scheme for dynamic voltage scaling on real-time multiprocessor systems
inferred← citeshttps://doi.org/10.1007/s11227-022-04901-wopenalex-snapshot
gCFS: completely fair scheduling on multiple GPUs for improved multi-DNN execution in terms of performance isolation
inferred← citeshttps://doi.org/10.1007/s11241-006-4687-8openalex-snapshot
Group-Based Pfair Scheduling
inferred← citeshttps://doi.org/10.1007/s11241-006-4961-9openalex-snapshot
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
inferred← citeshttps://doi.org/10.1007/s11241-007-9035-0openalex-snapshot
An $\mathsf{EDF}$ -based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
inferred← citeshttps://doi.org/10.1007/s11241-007-9042-1openalex-snapshot
Tardiness bounds under global EDF scheduling on a multiprocessor
inferred← citeshttps://doi.org/10.1007/s11241-007-9043-yopenalex-snapshot
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm
inferred← citeshttps://doi.org/10.1007/s11241-007-9045-yopenalex-snapshot
A schedulable utilization bound for the multiprocessor $\mathsf{EPDF}$ Pfair algorithm
inferred← citeshttps://doi.org/10.1007/s11241-008-9051-8openalex-snapshot
M-CASH: A real-time resource reclaiming algorithm for 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-010-9092-7openalex-snapshot
Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
inferred← citeshttps://doi.org/10.1007/s11241-010-9109-2openalex-snapshot
LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
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-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-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-013-9183-3openalex-snapshot
Implementation and evaluation of global and partitioned scheduling in a real-time OS
inferred← citeshttps://doi.org/10.1007/s11241-013-9186-0openalex-snapshot
Partitioned EDF scheduling: a closer look
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-9204-xopenalex-snapshot
Unified overhead-aware schedulability analysis for slot-based task-splitting
inferred← citeshttps://doi.org/10.1007/s11241-014-9205-9openalex-snapshot
Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
inferred← citeshttps://doi.org/10.1007/s11241-014-9216-6openalex-snapshot
Utilization-based admission control for aperiodic tasks under EDF scheduling
inferred← citeshttps://doi.org/10.1007/s11241-015-9221-4openalex-snapshot
Architecture aware semi partitioned real-time scheduling on multicore platforms
inferred← citeshttps://doi.org/10.1007/s11241-015-9224-1openalex-snapshot
Hard real-time guarantees in feedback-based resource reservations
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-016-9257-0openalex-snapshot
Real-time processing of streaming big data
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-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-020-09358-9openalex-snapshot
Algorithms for implementing elastic tasks on multiprocessor platforms: a comparative evaluation
inferred← citeshttps://doi.org/10.1007/s11241-021-09364-5openalex-snapshot
Online reconfiguration of regularity-based resource partitions in cyber-physical systems
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.1007/s11265-015-0983-7openalex-snapshot
Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems
inferred← citeshttps://doi.org/10.1007/s11432-009-0151-4openalex-snapshot
Dynamic scheduling model of computing resource based on MAS cooperation mechanism
inferred← citeshttps://doi.org/10.1007/s11432-015-5492-6openalex-snapshot
Credit-based scheme for security-aware and fairness-aware resource allocation in cloud computing
inferred← citeshttps://doi.org/10.1007/s11432-022-3891-4openalex-snapshot
An efficient schedulability analysis based on worst-case interference time for real-time systems
inferred← citeshttps://doi.org/10.1007/s11554-012-0277-2openalex-snapshot
Hardware–software optimizations of reconfigurable multi-core processors for floating-point computations of large sparse matrices
inferred← citeshttps://doi.org/10.1007/s11761-010-0068-1openalex-snapshot
Optimum allocation of distributed service workflows with probabilistic real-time guarantees
inferred← citeshttps://doi.org/10.1007/s13369-020-04980-yopenalex-snapshot
Deadline-Constrained Tasks’ Scheduling in Multi-core Systems Using Harmonic-Aware Load Balancing
inferred← citeshttps://doi.org/10.1007/s42514-025-00242-1openalex-snapshot
Multi-resource any price share fair allocation with placement constraints and an external resource in cloud-edge collaboration systems
inferred← citeshttps://doi.org/10.1007/s42979-022-01398-1openalex-snapshot
An Analytical Study of Multiprocessor Scheduling Using Metaheuristic Approach
inferred← citeshttps://doi.org/10.1016/b978-012198157-0/50007-6openalex-snapshot
Multiprocessor Scheduling in Processor-Based Router Platforms
inferred← citeshttps://doi.org/10.1016/c2012-0-07058-5openalex-snapshot
High-Performance Embedded Computing
inferred← citeshttps://doi.org/10.1016/j.cie.2018.12.070openalex-snapshot
Scheduling workers: A multi-criteria model considering their satisfaction
inferred← citeshttps://doi.org/10.1016/j.comnet.2003.12.017openalex-snapshot
Efficient algorithms for periodic scheduling
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.cor.2011.04.013openalex-snapshot
Scheduling on parallel machines with preemption and transportation delays
inferred← citeshttps://doi.org/10.1016/j.cor.2017.11.008openalex-snapshot
The Weighted Fair Sequences Problem
inferred← citeshttps://doi.org/10.1016/j.egypro.2011.10.341openalex-snapshot
A Multicore Scheduling Algorithm Considering Cache Warm-Up Overheads
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.06.080openalex-snapshot
The directional p-median problem: Definition, complexity, and algorithms
inferred← citeshttps://doi.org/10.1016/j.future.2011.10.005openalex-snapshot
A dual-band priority assignment algorithm for dynamic QoS resource management
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.921openalex-snapshot
DES based Modeling and Fault Diagnosis in Safety-critical Semi-Partitioned Real-time Systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.06.307openalex-snapshot
Energy-Efficient Thermal-Aware Scheduling for RT Tasks Using TCPN
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.inffus.2025.103353openalex-snapshot
A consensus set for the aggregation of partial rankings: The case of the Optimal Set of Bucket Orders Problem
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.jairtraman.2025.102958openalex-snapshot
Fairness metric-based RTA adjustment in the presence of wind uncertainty
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.08.002openalex-snapshot
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.03.001openalex-snapshot
Optimal rate-based scheduling on multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.03.003openalex-snapshot
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103476openalex-snapshot
Perpetual maintenance of machines with different urgency requirements
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2006.02.022openalex-snapshot
A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.011openalex-snapshot
Supporting lock-free synchronization in Pfair-scheduled real-time systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.10.003openalex-snapshot
Utility accrual real-time scheduling for multiprocessor embedded systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.12.003openalex-snapshot
T–L plane-based real-time scheduling for homogeneous multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2010.03.005openalex-snapshot
Partition oriented frame based fair scheduler
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.jpdc.2017.08.012openalex-snapshot
Fair-share scheduling in single-ISA asymmetric multicore architecture via scaled virtual runtime and load redistribution
inferred← citeshttps://doi.org/10.1016/j.jss.2003.12.041openalex-snapshot
Fair scheduling of dynamic task systems on multiprocessors
inferred← citeshttps://doi.org/10.1016/j.jss.2006.09.035openalex-snapshot
Resource management for real-time tasks in mobile robotics
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.2016.11.053openalex-snapshot
Providing fair-share scheduling on multicore computing systems via progress balancing
inferred← citeshttps://doi.org/10.1016/j.micpro.2019.102939openalex-snapshot
HEARS: A heterogeneous energy-aware real-time scheduler
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103124openalex-snapshot
Threshold temperature scaling: Heuristic to address temperature and power issues in MPSoCs
inferred← citeshttps://doi.org/10.1016/j.omega.2016.05.005openalex-snapshot
Fair task allocation in transportation
inferred← citeshttps://doi.org/10.1016/j.orl.2021.04.005openalex-snapshot
The Matroid Cup Game
inferred← citeshttps://doi.org/10.1016/j.procs.2018.07.109openalex-snapshot
Energy Aware Proportionate Slack Management Scheduling for Multiprocessor Systems
inferred← citeshttps://doi.org/10.1016/j.protcy.2013.12.186openalex-snapshot
Reducing Tasks Migration in LRE-TL Real-time Multiprocessor Scheduling Algorithm
inferred← citeshttps://doi.org/10.1016/j.scico.2018.11.004openalex-snapshot
Multi-core cyclic executives for safety-critical systems
inferred← citeshttps://doi.org/10.1016/j.seps.2021.101193openalex-snapshot
Fair and diverse allocation of scarce resources
inferred← citeshttps://doi.org/10.1016/j.suscom.2018.03.003openalex-snapshot
Energy aware frame based fair scheduling
inferred← citeshttps://doi.org/10.1016/j.sysarc.2007.10.002openalex-snapshot
Analyzing composability of applications on MPSoC platforms
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.2016.04.003openalex-snapshot
New response time analysis for global EDF on a multiprocessor platform
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.2018.01.003openalex-snapshot
Increasing resource utilization in mixed-criticality systems using a polymorphic VLIW processor
inferred← citeshttps://doi.org/10.1016/j.sysarc.2020.101847openalex-snapshot
TARTS: A Temperature-Aware Real-Time Deadline-Partitioned Fair Scheduler
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.1016/j.sysarc.2022.102733openalex-snapshot
Partitioning real-time workloads on multi-core virtual machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.008openalex-snapshot
Periodic scheduling with obligatory vacations
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.027openalex-snapshot
Cutting bamboo down to size
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00148-xopenalex-snapshot
Scheduling periodic tasks on uniform multiprocessors
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00231-4openalex-snapshot
Deadline-based scheduling of periodic task systems on multiprocessors
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00149-xopenalex-snapshot
Fair on-line scheduling of a dynamic set of tasks on a single resource
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00089-0openalex-snapshot
Dispatching in perfectly-periodic schedules
inferred← citeshttps://doi.org/10.1023/a:1025120124771openalex-snapshot
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1023/b:mone.0000034703.41393.aaopenalex-snapshot
Adaptive Dissemination of Data in Time-Critical Asymmetric Communication Environments
inferred← citeshttps://doi.org/10.1023/b:time.0000027934.77900.22openalex-snapshot
Resource Reservation in Dynamic Real-Time Systems
inferred← citeshttps://doi.org/10.1023/b:time.0000045315.61234.1eopenalex-snapshot
Real Time Scheduling Theory: A Historical Perspective
inferred← citeshttps://doi.org/10.1049/iet-cdt.2019.0023openalex-snapshot
HEALERS: a heterogeneous energy‐aware low‐overhead real‐time scheduler
inferred← citeshttps://doi.org/10.1063/1.1624652openalex-snapshot
Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
inferred← citeshttps://doi.org/10.1063/1.2747053openalex-snapshot
Bounding the errors for convex dynamics on one or more polytopes
inferred← citeshttps://doi.org/10.1080/17445760.2019.1578880openalex-snapshot
RUN enhancement through Bayesian networks
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.11.3260openalex-snapshot
Scheduling Real-Time Multi-Processor Systems with Distance-Constrained Tasks Using the Early-Release-Fair Model
inferred← citeshttps://doi.org/10.1109/12.709381openalex-snapshot
Pfair scheduling of generalized pinwheel task systems
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.3086304openalex-snapshot
FT-PIP: Flush Task Incorporated Priority-Inheritance Protocol to Reduce Information Leakage on Multiprocessor Real-Time Systems
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/access.2021.3140166openalex-snapshot
Supporting Swap in Real-Time Task Scheduling for Unified Power-Saving in CPU and Memory
inferred← citeshttps://doi.org/10.1109/aiccsa.2015.7507227openalex-snapshot
Reducing the inter processor migrations of the DP-WRAP scheduling
inferred← citeshttps://doi.org/10.1109/aqtr.2012.6237706openalex-snapshot
Simulation-based schedulability tests for multiprocessor real-time systems
inferred← citeshttps://doi.org/10.1109/bigdatasecurity.2017.37openalex-snapshot
Energy-Efficient Task Scheduling and Synchronization for Multicore Real-Time Systems
inferred← citeshttps://doi.org/10.1109/candar64496.2024.00043openalex-snapshot
Context Cache for Multicore RISC-V Processor
inferred← citeshttps://doi.org/10.1109/candar68384.2025.00016openalex-snapshot
iRMTvisor: A Real-Time Hypervisor with IPC Control Scheme
inferred← citeshttps://doi.org/10.1109/candarw53999.2021.00085openalex-snapshot
Real-Time Execution based on Fluid Scheduling by using IPC Control Scheme
inferred← citeshttps://doi.org/10.1109/ccnc08.2007.107openalex-snapshot
Supporting VCR Operation in a Mesh-Based P2P VoD System
inferred← citeshttps://doi.org/10.1109/compsac.2009.117openalex-snapshot
Real-Time Guarantees in Flexible Advance Reservations
inferred← citeshttps://doi.org/10.1109/conielecomp.2012.6189901openalex-snapshot
A multiprocessor real-time scheduling simulation tool
inferred← citeshttps://doi.org/10.1109/csae.2012.6272898openalex-snapshot
A simple model for the energy-efficient optimal 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.2005.18openalex-snapshot
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
inferred← citeshttps://doi.org/10.1109/ecrts.2005.6openalex-snapshot
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2006.10openalex-snapshot
Efficient Synchronization under Global EDF Scheduling on Multiprocessors
inferred← citeshttps://doi.org/10.1109/ecrts.2007.14openalex-snapshot
EDZL Scheduling Analysis
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.33openalex-snapshot
Practical Schedulability Analysis for Generalized Sporadic Tasks in Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.1109/ecrts.2008.9openalex-snapshot
Sporadic Multiprocessor Scheduling with Few Preemptions
inferred← citeshttps://doi.org/10.1109/ecrts.2009.16openalex-snapshot
Supporting Pipelines in Soft Real-Time Multiprocessor Systems
showing the first 200 of 629 · page through all 629
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.