Name
Abstract | ||
|---|---|---|
A multiple server setting is considered, where each server has tunable speed, and increasing the speed incurs an energy cost. Jobs arrive to a single queue, and each job has two types of sub-tasks, map and reduce, and a
<bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">precedence</b>
constraint among them: any reduce task of a job can only be processed once all the map tasks of the job have been completed. In addition to the scheduling problem, i.e., which task to execute on which server, with tunable speed, an additional decision variable is the choice of speed for each server, so as to minimize a linear combination of the sum of the flow times of jobs/tasks and the total energy cost. The precedence constraints present new challenges for the speed scaling problem with multiple servers, namely that the number of tasks that can be executed at any time may be small but the total number of outstanding tasks might be quite large. We present simple speed scaling algorithms that are shown to have competitive ratios, that depend on the power cost function, and/or the ratio of the size of the largest task and the shortest reduce task, but not on the number of jobs, or the number of servers. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TNET.2022.3142091 | IEEE/ACM Transactions on Networking |
Keywords | DocType | Volume |
Speed scaling,shortest remaining processing time (SRPT),precedence constraints,competitive ratio | Journal | 30 |
Issue | ISSN | Citations |
4 | 1063-6692 | 0 |
PageRank | References | Authors |
0.34 | 29 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rahul Vaze | 1 | 463 | 45.64 |
| Jayakrishnan Nair | 2 | 72 | 20.59 |