Su, Yu and Ren, Xiaoqi and Vardi, Shai and Wierman, Adam and He, Yuxiong (2019) Communication-Aware Scheduling of Precedence-Constrained Tasks. ACM SIGMETRICS Performance Evaluation Review, 47 (2). pp. 21-23. ISSN 0163-5999. doi:10.1145/3374888.3374897. https://resolver.caltech.edu/CaltechAUTHORS:20191205-110845019
![]() |
PDF
- Published Version
See Usage Policy. 619kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20191205-110845019
Abstract
Jobs in large-scale machine learning platforms are expressed using a computational graph of tasks with precedence constraints. To handle such precedence-constrained tasks that have machine-dependent communication demands in settings with heterogeneous service rates and communication times, we propose a new scheduling framework, Generalized Earliest Time First (GETF), that improves upon stateof- the-art results in the area. Specifically, we provide the first provable, worst-case approximation guarantee for the goal of minimizing the makespan of tasks with precedence constraints on related machines with machine-dependent communication times.
Item Type: | Article | ||||||
---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||
ORCID: |
| ||||||
Additional Information: | © 2019 is held by author/owner(s). | ||||||
Issue or Number: | 2 | ||||||
DOI: | 10.1145/3374888.3374897 | ||||||
Record Number: | CaltechAUTHORS:20191205-110845019 | ||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20191205-110845019 | ||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
ID Code: | 100209 | ||||||
Collection: | CaltechAUTHORS | ||||||
Deposited By: | Tony Diaz | ||||||
Deposited On: | 05 Dec 2019 19:23 | ||||||
Last Modified: | 16 Nov 2021 17:52 |
Repository Staff Only: item control page