Sciact
  • EN
  • RU

Scheduling Malleable Jobs Under Topological Constraints Full article

Source Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020
Compilation, Institute of Electrical and Electronics Engineers Inc.. New Orleans, LA, United States.2020. 1154 c. ISBN 9781728168760.
Output data Year: 2020, Pages: 316 - 325 Pages count : 10 DOI: 10.1109/ipdps47924.2020.00041
Tags Approximation algorithms; communications; Input/Output; malleable jobs
Authors Bampis Evripidis 1 , Dogeas Konstantinos 1 , Kononov Alexander 2,3 , Lucarelli Giorgio 4 , Pascual Fanny 1
Affiliations
1 Sorbonne University
2 Sobolev Institute of Mathematics
3 Novosibirsk State University
4 University of Lorraine
Cite: Bampis E. , Dogeas K. , Kononov A. , Lucarelli G. , Pascual F.
Scheduling Malleable Jobs Under Topological Constraints
In compilation Proceedings - 2020 IEEE 34th International Parallel and Distributed Processing Symposium, IPDPS 2020. – Institute of Electrical and Electronics Engineers Inc.., 2020. – C.316 - 325. – ISBN 9781728168760. DOI: 10.1109/ipdps47924.2020.00041 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85088898436
OpenAlex: W3043055047
Citing:
DB Citing
Scopus 3
OpenAlex 5
Altmetrics: