Scheduling Malleable Jobs under Topological Constraints

Evripidis Bampis, Konstantinos Dogeas, Alexander Kononov, Giorgio Lucarelli, Fanny Pascual

Результат исследования: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференциинаучнаярецензирование

Аннотация

Bleuse et al. (EuroPar 2018) introduced a general model for interference-aware scheduling in large scale parallel platforms. They considered two different types of communications: the flows induced by data exchanges during computations and the flows related to Input/Output operations. Rather than taking into account these communications explicitly, they restrict the possible allocations of a job by external topological constraints. In their work, jobs are considered to be rigid: a job requires a specific number of machines in order to be executed. Here, we first adopt the same framework for the platform and the aforementioned topological constraints. We show that there is no polynomial time approximation algorithm under the rigid setting with ratio smaller than 3/2, unless P = NP. Then, we focus on the malleable setting. We show that in the proportional-malleable setting, where the work of every job remains constant independently of the number of machines on which it is executed, the scheduling problem remains NPhard even in the uniform case, where the maximum number of machines is the same for all the jobs. Then, we propose a 2-approximation algorithm for this case. Furthermore, we present an approximation algorithm solving the more general case where the maximum number of machines is job-dependent and the work of the jobs is increasing with respect to the number of used machines, due to the communication overhead.

Язык оригиналаанглийский
Название основной публикацииProceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020
ИздательInstitute of Electrical and Electronics Engineers Inc.
Страницы316-325
Число страниц10
ISBN (электронное издание)9781728168760
DOI
СостояниеОпубликовано - 1 мая 2020
Событие34th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2020 - New Orleans, Соединенные Штаты Америки
Продолжительность: 18 мая 202022 мая 2020

Серия публикаций

НазваниеProceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020

Конференция

Конференция34th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2020
СтранаСоединенные Штаты Америки
ГородNew Orleans
Период18.05.202022.05.2020

Fingerprint Подробные сведения о темах исследования «Scheduling Malleable Jobs under Topological Constraints». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать

    Bampis, E., Dogeas, K., Kononov, A., Lucarelli, G., & Pascual, F. (2020). Scheduling Malleable Jobs under Topological Constraints. В Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020 (стр. 316-325). [9139853] (Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS47924.2020.00041