On scheduling in map-reduce and flow-shops
The map-reduce paradigm is now standard in industry and academia for processing large-
scale data. In this work, we formalize job scheduling in map-reduce as a novel …
scale data. In this work, we formalize job scheduling in map-reduce as a novel …
A tutorial on amortized local competitiveness in online scheduling
Recently the use of potential functions to analyze online scheduling algorithms has become
popular [19, 7, 29, 13, 31, 4, 30, 3, 21, 15, 14, 28, 12, 2, 5, 6, 9, 11, 23, 33, 24, 8, 17, 16, 25 …
popular [19, 7, 29, 13, 31, 4, 30, 3, 21, 15, 14, 28, 12, 2, 5, 6, 9, 11, 23, 33, 24, 8, 17, 16, 25 …
Competitive algorithms from competitive equilibria: Non-clairvoyant scheduling under polyhedral constraints
We introduce and study a general scheduling problem that we term the Polytope Scheduling
problem (PSP). In this problem, jobs can have different arrival times and sizes, and the rates …
problem (PSP). In this problem, jobs can have different arrival times and sizes, and the rates …
Scalably scheduling processes with arbitrary speedup curves
J Edmonds, K Pruhs - ACM Transactions on Algorithms (TALG), 2012 - dl.acm.org
Scalably scheduling processes with arbitrary speedup curves Page 1 28 Scalably Scheduling
Processes with Arbitrary Speedup Curves JEFF EDMONDS, York University KIRK PRUHS …
Processes with Arbitrary Speedup Curves JEFF EDMONDS, York University KIRK PRUHS …
Selfishmigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors
We consider the classical problem of minimizing the total weighted flow-time for unrelated
machines in the online non-clairvoyant setting. In this problem, a set of jobs J arrive over …
machines in the online non-clairvoyant setting. In this problem, a set of jobs J arrive over …
Scheduling heterogeneous processors isn't as easy as you think
We consider preemptive online scheduling algorithms to minimize the total
weighted/unweighted flow time plus energy for speed-scalable heterogeneous …
weighted/unweighted flow time plus energy for speed-scalable heterogeneous …
Energy efficient scheduling of parallelizable jobs
This paper considers scheduling parallelizable jobs in the non-clairvoyant speed scaling
setting to minimize the objective of weighted flow time plus energy. Previously, strong lower …
setting to minimize the objective of weighted flow time plus energy. Previously, strong lower …
Lagrangian duality in online scheduling with resource augmentation and speed scaling
KT Nguyen - Algorithms–ESA 2013: 21st Annual European …, 2013 - Springer
We present an unified approach to study online scheduling problems in the resource
augmentation/speed scaling models. Potential function method is extensively used for …
augmentation/speed scaling models. Potential function method is extensively used for …
Coordination mechanisms from (almost) all scheduling policies
We study the price of anarchy of coordination mechanisms for a scheduling problem where
each job j has a weight wj, processing time pij, assignment cost hij, and communication …
each job j has a weight wj, processing time pij, assignment cost hij, and communication …
Better algorithms and hardness for broadcast scheduling via a discrepancy approach
We study the broadcast scheduling problem with the objective of minimizing the average
response time. There is a single server that can hold n pages of unit size, and multiple …
response time. There is a single server that can hold n pages of unit size, and multiple …