Proportionate progress: A notion of fairness in resource allocation
From MaRDI portal
Publication:1918992
DOI10.1007/BF01940883zbMath0848.68020MaRDI QIDQ1918992
Sanjoy K. Baruah, N. K. Cohen, D. A. Varvel, C. Greg Plaxton
Publication date: 8 October 1996
Published in: Algorithmica (Search for Journal in Brave)
Related Items (65)
Real-time processing of streaming big data ⋮ Real-time scheduling algorithm for safety-critical systems on faulty multicore environments ⋮ Mixed Pfair/ERfair scheduling of asynchronous periodic tasks ⋮ Using a lag-balance property to tighten tardiness bounds for global EDF ⋮ Fair on-line scheduling of a dynamic set of tasks on a single resource ⋮ Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems ⋮ Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling ⋮ Dynamic scheduling model of computing resource based on MAS cooperation mechanism ⋮ Group-based Pfair scheduling ⋮ The non-preemptive scheduling of periodic tasks upon multiprocessors ⋮ The weighted fair sequences problem ⋮ The directional \(p\)-median problem: definition, complexity, and algorithms ⋮ Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN ⋮ Minimizing migrations in fair multiprocessor scheduling of persistent tasks ⋮ {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines ⋮ Perpetual maintenance of machines with different urgency requirements ⋮ Equitable scheduling on a single machine ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ Optimal periodic resource allocation in reactive dynamical systems: Application to microalgal production ⋮ A new fair scheduling algorithm for periodic tasks on multiprocessors ⋮ Windows scheduling of arbitrary-length jobs on multiple machines ⋮ {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling ⋮ Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) ⋮ An optimal boundary fair scheduling algorithm for multiprocessor real-time systems ⋮ Sticky-ERfair: a task-processor affinity aware proportional fair scheduler ⋮ Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound ⋮ Nearly optimal perfectly periodic schedules ⋮ A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract) ⋮ A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm ⋮ Utility accrual real-time scheduling for multiprocessor embedded systems ⋮ T-L plane-based real-time scheduling for homogeneous multiprocessors ⋮ Unified overhead-aware schedulability analysis for slot-based task-splitting ⋮ Partition oriented frame based fair scheduler ⋮ Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms ⋮ Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory ⋮ M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms ⋮ Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach ⋮ Implementation and evaluation of global and partitioned scheduling in a real-time OS ⋮ Partitioned EDF scheduling: a closer look ⋮ Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling ⋮ An optimal boundary fair scheduling ⋮ An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems ⋮ Tardiness bounds under global EDF scheduling on a multiprocessor ⋮ A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm ⋮ Feasibility analysis of sporadic real-time multiprocessor task systems ⋮ On centralized smooth scheduling ⋮ Bamboo garden trimming problem: priority schedulings ⋮ Scheduling on parallel machines with preemption and transportation delays ⋮ Cluster scheduling for real-time systems: utilization bounds and run-time overhead ⋮ Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible ⋮ Smooth scheduling under variable rates or the analog-digital confinement game ⋮ Utilization-based admission control for aperiodic tasks under EDF scheduling ⋮ EDZL Scheduling and Schedulability Analysis for Performance Asymmetric Multiprocessors ⋮ Optimal rate-based scheduling on multiprocessors ⋮ The matroid cup game ⋮ Periodic scheduling with obligatory vacations ⋮ Optimal virtual cluster-based multiprocessor scheduling ⋮ Cutting bamboo down to size ⋮ A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF ⋮ A survey of real-time scheduling on multiprocessor systems ⋮ Deadline-based scheduling of periodic task systems on multiprocessors. ⋮ Scheduling periodic tasks on uniform multiprocessors ⋮ Hard real-time guarantees in feedback-based resource reservations ⋮ Architecture aware semi partitioned real-time scheduling on multicore platforms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for scheduling periodic, real-time tasks
- Time bounds for selection
- Integer Programming with a Fixed Number of Variables
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- Production Sets with Indivisibilities, Part I: Generalities
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Some simple scheduling algorithms
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: Proportionate progress: A notion of fairness in resource allocation
