Resource augmentation for weighted flow-time explained by dual fitting
From MaRDI portal
Publication:5743472
zbMATH Open1422.68319MaRDI QIDQ5743472FDOQ5743472
Authors:
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095213
Recommendations
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Speed scaling for weighted flow time
- Speed scaling with an arbitrary power function
- Title not available (Why is that?)
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Scalably Scheduling Power-Heterogeneous Processors
- A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
- Server scheduling in the L p norm
- Better Algorithms for Minimizing Average Flow-Time on Related Machines
- An online scalable algorithm for minimizing \(\ell_k\)-norms of weighted flow time on unrelated machines
- LATIN 2004: Theoretical Informatics
- Minimizing total flow time and total completion time with immediate dispatching
- Title not available (Why is that?)
- Algorithms for minimizing weighted flow time
Cited In (19)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- An improved approximation algorithm for scheduling under arborescence precedence constraints
- Non-Clairvoyant Precedence Constrained Scheduling.
- Lagrangian duality in online scheduling with resource augmentation and speed scaling
- Energy efficient scheduling of parallelizable jobs
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Ranking on arbitrary graphs: rematch via continuous linear programming
- Non-clairvoyantly scheduling to minimize convex functions
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- Welfare maximization with production costs: a primal dual approach
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- Fair scheduling via iterative quasi-uniform sampling
- Non-preemptive flow-time minimization via rejections
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions
- Rejecting jobs to minimize load and maximum flow-time
- Title not available (Why is that?)
- Minimizing maximum (weighted) flow-time on related and unrelated machines
This page was built for publication: Resource augmentation for weighted flow-time explained by dual fitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743472)
