Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time
| Autor: | Kunal Agrawal, Benjamin Moseley, Kefu Lu, Jing Li |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
020203 distributed computing
Mathematical optimization Speedup Parallelizable manifold Computer science Maximum flow problem 0102 computer and information sciences 02 engineering and technology Parallel computing Directed acyclic graph 01 natural sciences Upper and lower bounds Scheduling (computing) FIFO and LIFO accounting 010201 computation theory & mathematics Work stealing 0202 electrical engineering electronic engineering information engineering |
| Zdroj: | SPAA |
| DOI: | 10.1145/2935764.2935782 |
| Popis: | In this paper we study the problem of scheduling a set of dynamic multithreaded jobs with the objective of minimizing the maximum latency experienced by any job. We assume that jobs arrive online and the scheduler has no information about the arrival rate, arrival time or work distribution of the jobs. The scheduling goal is to minimize the maximum amount of time between the arrival of a job and its completion --- this goal is referred to in scheduling literature as maximum flow time. While theoretical online scheduling of parallel jobs has been studied extensively, most prior work has focussed on a highly stylized model of parallel jobs called the "speedup curves model." We model parallel jobs as directed acyclic graphs, which is a more realistic way to model dynamic multithreaded jobs.In this context, we prove that a simple First-In-First-Out scheduler is (1+e)-speed O(1/e)-competitive for any e >0. We then develop a more practical work-stealing scheduler and show that it has a maximum flow time of O(1/e2 max{opt,ln(n)}) for n jobs, with (1+e)-speed. This result is essentially tight as we also provide a lower bound of Ω(log(n)) for work stealing. In addition, for the case where jobs have weights (typically representing priorities) and the objective is minimizing the maximum weighted flow time, we show a non-clairvoyant algorithm is (1+e)-speed O(1/e2)-competitive for any e >0, which is essentially the best positive result that can be shown in the online setting for the weighted case due to strong lower bounds without resource augmentation.After establishing theoretical results, we perform an empirical study of work-stealing. Our results indicate that, on both real world and synthetic workloads, work-stealing performs almost as well as an optimal scheduler. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|