Proportionate progress: A notion of fairness in resource allocation
From MaRDI portal
Publication:1918992
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4215346 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- A new algorithm for scheduling periodic, real-time tasks
- Integer Programming with a Fixed Number of Variables
- Production Sets with Indivisibilities, Part I: Generalities
- Production Sets with Indivisibilities, Part II: The Case of Two Activities
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Some simple scheduling algorithms
- Time bounds for selection
Cited in
(68)- An efficient implementation of a VNS heuristic for the weighted fair sequences problem
- Architecture aware semi partitioned real-time scheduling on multicore platforms
- Hard real-time guarantees in feedback-based resource reservations
- Optimal periodic resource allocation in reactive dynamical systems: Application to microalgal production
- scientific article; zbMATH DE number 744092 (Why is no real title available?)
- An optimal boundary fair scheduling
- Equitable scheduling on a single machine
- Real-time processing of streaming big data
- Perpetual maintenance of machines with different urgency requirements
- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)
- The matroid cup game
- M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms
- Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
- Periodic scheduling with obligatory vacations
- Bamboo garden trimming problem: priority schedulings
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
- Smooth scheduling under variable rates or the analog-digital confinement game
- Scheduling on parallel machines with preemption and transportation delays
- A novel intelligent method for task scheduling in multiprocessor systems using genetic algorithm
- A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
- Cluster scheduling for real-time systems: utilization bounds and run-time overhead
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- Proportional optimization and fairness
- Using a lag-balance property to tighten tardiness bounds for global EDF
- The directional \(p\)-median problem: definition, complexity, and algorithms
- EDZL scheduling and schedulability analysis for performance asymmetric multiprocessors
- Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
- Partitioned EDF scheduling: a closer look
- Scheduling periodic tasks on uniform multiprocessors
- Cutting bamboo down to size
- The weighted fair sequences problem
- The non-preemptive scheduling of periodic tasks upon multiprocessors
- Laxity dynamics and LLF schedulability analysis on multiprocessor platforms
- A new fair scheduling algorithm for periodic tasks on multiprocessors
- Real-time scheduling algorithm for safety-critical systems on faulty multicore environments
- A survey of real-time scheduling on multiprocessor systems
- Implementation and evaluation of global and partitioned scheduling in a real-time OS
- Partition oriented frame based fair scheduler
- Group-based Pfair scheduling
- An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
- A linear proportional effort allocation rule
- Utility accrual real-time scheduling for multiprocessor embedded systems
- Utilization-based admission control for aperiodic tasks under EDF scheduling
- Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory
- Dynamic scheduling model of computing resource based on MAS cooperation mechanism
- Minimizing migrations in fair multiprocessor scheduling of persistent tasks
- Optimal rate-based scheduling on multiprocessors
- A characterization of the proportional rule in multi-issue allocation situations
- Windows scheduling of arbitrary-length jobs on multiple machines
- An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
- Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
- Nearly optimal perfectly periodic schedules
- Unified overhead-aware schedulability analysis for slot-based task-splitting
- A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
- On centralized smooth scheduling
- Sticky-ERfair: a task-processor affinity aware proportional fair scheduler
- Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
- Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling
- Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
- {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
- Tardiness bounds under global EDF scheduling on a multiprocessor
- T-L plane-based real-time scheduling for homogeneous multiprocessors
- Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling
- Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
- Optimal virtual cluster-based multiprocessor scheduling
- Deadline-based scheduling of periodic task systems on multiprocessors.
This page was built for publication: Proportionate progress: A notion of fairness in resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918992)
