{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T22:11:13Z","timestamp":1726092673042},"reference-count":71,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"am","delay-in-days":269,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007234","name":"University of Chicago","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007234","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2135310"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.jpdc.2023.104792","type":"journal-article","created":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:01:43Z","timestamp":1698163303000},"page":"104792","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Multi-resource scheduling of moldable workflows"],"prefix":"10.1016","volume":"184","author":[{"given":"Lucas","family":"Perotin","sequence":"first","affiliation":[]},{"given":"Sandhya","family":"Kandaswamy","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4379-4467","authenticated-orcid":false,"given":"Hongyang","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Padma","family":"Raghavan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jpdc.2023.104792_br0010","series-title":"AFIPS'67","first-page":"483","article-title":"Validity of the single processor approach to achieving large scale computing capabilities","author":"Amdahl","year":"1967"},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0020","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/cpe.1631","article-title":"A unified platform for task scheduling on heterogeneous multicore architectures","volume":"23","author":"Augonnet","year":"2011","journal-title":"Concurr. Comput., Pract. Exper."},{"issue":"10","key":"10.1016\/j.jpdc.2023.104792_br0030","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.parco.2006.08.004","article-title":"An improved two-step algorithm for task and data parallel scheduling in distributed memory machines","volume":"32","author":"Bansal","year":"2006","journal-title":"Parallel Comput."},{"issue":"3","key":"10.1016\/j.jpdc.2023.104792_br0040","doi-asserted-by":"crossref","DOI":"10.1145\/3387110","article-title":"Scheduling on two types of resources: a survey","volume":"53","author":"Beaumont","year":"2020","journal-title":"ACM Comput. Surv."},{"issue":"17","key":"10.1016\/j.jpdc.2023.104792_br0050","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4502","article-title":"Fast approximation algorithms for task-based runtime systems","volume":"30","author":"Beaumont","year":"2018","journal-title":"Concurr. Comput., Pract. Exper."},{"key":"10.1016\/j.jpdc.2023.104792_br0060","series-title":"ESA","first-page":"277","article-title":"Parallel algorithms for series parallel graphs","author":"Bodlaender","year":"1996"},{"issue":"6","key":"10.1016\/j.jpdc.2023.104792_br0070","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/MCSE.2013.98","article-title":"Exploiting heterogeneity to enhance scalability","volume":"15","author":"Bosilca","year":"2013","journal-title":"Comput. Sci. Eng."},{"key":"10.1016\/j.jpdc.2023.104792_br0080","series-title":"RTAS","first-page":"55","article-title":"Memory bandwidth reservation system for efficient performance isolation in multi-core platforms","author":"Caccamo","year":"2013"},{"issue":"9","key":"10.1016\/j.jpdc.2023.104792_br0090","doi-asserted-by":"crossref","first-page":"1937","DOI":"10.1109\/TPDS.2018.2813387","article-title":"An improved approximation for scheduling malleable tasks with precedence constraints via iterative method","volume":"29","author":"Chen","year":"2018","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"10.1016\/j.jpdc.2023.104792_br0100","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TPDS.2012.258","article-title":"A 3.42-approximation algorithm for scheduling malleable tasks under precedence constraints","volume":"24","author":"Chen","year":"2013","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jpdc.2023.104792_br0110","author":"Chen"},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0120","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/opre.45.2.302","article-title":"Complexity of the discrete time-cost tradeoff problem for project networks","volume":"45","author":"De","year":"1997","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0130","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(94)00187-H","article-title":"The discrete time-cost tradeoff problem revisited","volume":"81","author":"De","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.jpdc.2023.104792_br0140","series-title":"STACS","article-title":"Approximation algorithms for scheduling with resource and precedence constraints","author":"Demirci","year":"2018"},{"key":"10.1016\/j.jpdc.2023.104792_br0150","series-title":"SC18: International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"466","article-title":"A divide and conquer algorithm for dag scheduling under power constraints","author":"Demirci","year":"2018"},{"issue":"4","key":"10.1016\/j.jpdc.2023.104792_br0160","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jpdc.2023.104792_br0170","series-title":"IPDPS","article-title":"Analysis of a list scheduling algorithm for task graphs on two types of resources","author":"Eyraud-Dubois","year":"2020"},{"key":"10.1016\/j.jpdc.2023.104792_br0180","series-title":"SC Poster","article-title":"Exploiting multi-resource scheduling for HPC","author":"Fan","year":"2019"},{"key":"10.1016\/j.jpdc.2023.104792_br0190","series-title":"HPDC","article-title":"Scheduling beyond CPUs for HPC","author":"Fan","year":"2019"},{"key":"10.1016\/j.jpdc.2023.104792_br0200","series-title":"IPDPS Poster","article-title":"A multiresource job scheduling framework for exascale HPC system","author":"Fan","year":"2018"},{"issue":"87657","key":"10.1016\/j.jpdc.2023.104792_br0210","article-title":"Job scheduling in multiprogrammed parallel systems (extended version)","volume":"RC19790","author":"Feitelson","year":"1997","journal-title":"IBM Res. Rep."},{"issue":"4","key":"10.1016\/j.jpdc.2023.104792_br0220","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1009794729459","article-title":"Optimal on-line scheduling of parallel jobs with dependencies","volume":"1","author":"Feldmann","year":"1998","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0230","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0204015","article-title":"Bounds for multiprocessor scheduling with resource constraints","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jpdc.2023.104792_br0240","series-title":"PASCO","first-page":"15","article-title":"A thread scheduling runtime system for data flow computations on cluster of multi-processors","author":"Gautier","year":"2007"},{"key":"10.1016\/j.jpdc.2023.104792_br0250","series-title":"Proceedings of the 8th USENIX Conference on Networked Systems Design and Implementation","first-page":"323","article-title":"Dominant resource fairness: fair allocation of multiple resource types","author":"Ghodsi","year":"2011"},{"issue":"4","key":"10.1016\/j.jpdc.2023.104792_br0260","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/2740070.2626334","article-title":"Multi-resource packing for cluster schedulers","volume":"44","author":"Grandl","year":"2014","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.jpdc.2023.104792_br0270","series-title":"COMPSAC","article-title":"A multi-resource fair scheduling algorithm in heterogeneous cloud computing","author":"Hamzeh","year":"2020"},{"key":"10.1016\/j.jpdc.2023.104792_br0280","series-title":"IPDPS","first-page":"1187","article-title":"Scheduling functionally heterogeneous systems with utilization balancing","author":"He","year":"2011"},{"key":"10.1016\/j.jpdc.2023.104792_br0290","series-title":"ICPP","first-page":"43","article-title":"Adaptive scheduling of parallel jobs on functionally heterogeneous resources","author":"He","year":"2007"},{"key":"10.1016\/j.jpdc.2023.104792_br0300","series-title":"2019 IEEE International Conference on Networking, Architecture and Storage (NAS)","article-title":"Learning workflow scheduling on multi-resource clusters","author":"Hu","year":"2019"},{"issue":"1138","key":"10.1016\/j.jpdc.2023.104792_br0310","article-title":"An iterative expanding and shrinking process for processor allocation in mixed-parallel workflow scheduling","volume":"5","author":"Huang","year":"2016","journal-title":"SpringerPlus"},{"key":"10.1016\/j.jpdc.2023.104792_br0320","series-title":"CCGrid","article-title":"Low-cost tuning of two-step algorithms for scheduling mixed-parallel applications onto homogeneous clusters","author":"Hunold","year":"2010"},{"key":"10.1016\/j.jpdc.2023.104792_br0330","series-title":"Parallel Processing and Applied Mathematics","first-page":"13","article-title":"Scheduling moldable tasks with precedence constraints and arbitrary speedup functions on multiprocessors","author":"Hunold","year":"2014"},{"key":"10.1016\/j.jpdc.2023.104792_br0340","series-title":"IPDPS","first-page":"172","article-title":"Scheduling monotone moldable jobs in linear time","author":"Jansen","year":"2018"},{"key":"10.1016\/j.jpdc.2023.104792_br0350","series-title":"SPAA","first-page":"86","article-title":"Scheduling malleable tasks with precedence constraints","author":"Jansen","year":"2005"},{"issue":"3","key":"10.1016\/j.jpdc.2023.104792_br0360","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1145\/1159892.1159899","article-title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","volume":"2","author":"Jansen","year":"2006","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"10.1016\/j.jpdc.2023.104792_br0370","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.6061","article-title":"Multi-resource allocation in cloud data centers: a trade-off on fairness and efficiency","volume":"33","author":"Jiang","year":"2021","journal-title":"Concurr. Comput., Pract. Exper."},{"key":"10.1016\/j.jpdc.2023.104792_br0380","series-title":"IEEE INFOCOM","article-title":"Multi-resource allocation: fairness-efficiency tradeoffs in a unifying framework","author":"Joe-Wong","year":"2012"},{"key":"10.1016\/j.jpdc.2023.104792_br0390","series-title":"ICC","article-title":"Per-server dominant-share fairness (PS-DSF): a multi-resource fair allocation mechanism for heterogeneous servers","author":"Khamse-Ashari","year":"2017"},{"key":"10.1016\/j.jpdc.2023.104792_br0400","series-title":"JSSPP","article-title":"Multi-resource aware fairsharing for heterogeneous systems","author":"Klus\u00e1\u010dek","year":"2015"},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0410","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/S0377-2217(02)00264-3","article-title":"An approximation algorithm for scheduling trees of malleable tasks","volume":"142","author":"Lep\u00e8re","year":"2002","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.jpdc.2023.104792_br0420","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1142\/S0129054102001308","article-title":"Approximation algorithms for scheduling malleable tasks under precedence constraints","volume":"13","author":"Lep\u00e8re","year":"2002","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.jpdc.2023.104792_br0430","series-title":"IEEE CLUSTER","first-page":"47","article-title":"Multi-resource scheduling for HPC","author":"Li","year":"2022"},{"key":"10.1016\/j.jpdc.2023.104792_br0440","series-title":"MSST","first-page":"1","article-title":"On the role of burst buffers in leadership-class storage systems","author":"Liu","year":"2012"},{"key":"10.1016\/j.jpdc.2023.104792_br0450","series-title":"SODA","first-page":"167","article-title":"Scheduling malleable and nonmalleable parallel tasks","author":"Ludwig","year":"1994"},{"key":"10.1016\/j.jpdc.2023.104792_br0460","series-title":"USENIX OSDI","article-title":"Looking beyond GPUs for DNN scheduling on multi-tenant clusters","author":"Mohan","year":"2022"},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0470","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S0097539701385995","article-title":"A 3\/2-approximation algorithm for scheduling independent monotonic malleable tasks","volume":"37","author":"Mouni\u00e9","year":"2007","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jpdc.2023.104792_br0480","series-title":"WAOA","first-page":"242","article-title":"Scheduling with an orthogonal resource constraint","author":"Niemeier","year":"2012"},{"key":"10.1016\/j.jpdc.2023.104792_br0490","series-title":"INFOCOM Workshops","article-title":"Online multi-resource scheduling for minimum task completion time in cloud servers","author":"NoroozOliaee","year":"2014"},{"key":"10.1016\/j.jpdc.2023.104792_br0500","series-title":"ICPP","article-title":"Multi-resource list scheduling of moldable parallel jobs under precedence constraints","author":"Perotin","year":"2021"},{"issue":"6","key":"10.1016\/j.jpdc.2023.104792_br0510","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1109\/71.506703","article-title":"Generalized multiprocessor scheduling and applications to matrix computations","volume":"7","author":"Prasanna","year":"1996","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"10.1016\/j.jpdc.2023.104792_br0520","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1109\/TNET.2018.2863647","article-title":"Randomized algorithms for scheduling multi-resource jobs in the cloud","volume":"26","author":"Psychas","year":"2018","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.jpdc.2023.104792_br0530","series-title":"IPDPS","article-title":"Cpr: mixed task and data parallel scheduling for distributed systems","author":"Radulescu","year":"2001"},{"key":"10.1016\/j.jpdc.2023.104792_br0540","series-title":"ICPP","article-title":"A low-cost approach towards mixed task and data parallel scheduling","author":"Radulescu","year":"2001"},{"issue":"11","key":"10.1016\/j.jpdc.2023.104792_br0550","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/71.642945","article-title":"A framework for exploiting task and data parallelism on distributed memory multicomputers","volume":"8","author":"Ramaswamy","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jpdc.2023.104792_br0560","series-title":"Federated Conference on Computer Science and Information Systems (FedCSIS)","doi-asserted-by":"crossref","first-page":"889","DOI":"10.15439\/2016F498","article-title":"Superlinear speedup in HPC systems: why and when?","author":"Ristov","year":"2016"},{"key":"10.1016\/j.jpdc.2023.104792_br0570","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.future.2015.03.014","article-title":"A multi-dimensional job scheduling","volume":"54","author":"Sheikhalishahi","year":"2016","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"10.1016\/j.jpdc.2023.104792_br0580","first-page":"617","article-title":"Improved approximation algorithms for shop scheduling problems","volume":"23","author":"Shmoys","year":"1994"},{"issue":"4","key":"10.1016\/j.jpdc.2023.104792_br0590","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/moor.23.4.909","article-title":"Approximation algorithms for the discrete time-cost tradeoff problem","volume":"23","author":"Skutella","year":"1998","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0600","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/MM.2016.25","article-title":"Knights Landing: second-generation Intel Xeon Phi product","volume":"36","author":"Sodani","year":"2016","journal-title":"IEEE MICRO"},{"key":"10.1016\/j.jpdc.2023.104792_br0610","series-title":"IPDPS","first-page":"194","article-title":"Scheduling parallel tasks under multiple resources: list scheduling vs. pack scheduling","author":"Sun","year":"2018"},{"key":"10.1016\/j.jpdc.2023.104792_br0620","author":"Suter DAGGEN"},{"key":"10.1016\/j.jpdc.2023.104792_br0630","series-title":"SPAA","article-title":"Approximate algorithms scheduling parallelizable tasks","author":"Turek","year":"1992"},{"key":"10.1016\/j.jpdc.2023.104792_br0640","series-title":"CoNEXT","article-title":"Job scheduling for large-scale machine learning clusters","author":"Wang","year":"2020"},{"issue":"2","key":"10.1016\/j.jpdc.2023.104792_br0650","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0221021","article-title":"A heuristic of scheduling parallel tasks and its analysis","volume":"21","author":"Wang","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jpdc.2023.104792_br0660","series-title":"ACM SIGMETRICS","first-page":"415","article-title":"Towards multi-resource fair allocation with placement constraints","author":"Wang","year":"2016"},{"issue":"10","key":"10.1016\/j.jpdc.2023.104792_br0670","doi-asserted-by":"crossref","first-page":"2822","DOI":"10.1109\/TPDS.2014.2362139","article-title":"Multi-resource fair allocation in heterogeneous cloud computing systems","volume":"26","author":"Wang","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jpdc.2023.104792_br0680","series-title":"ICPP","article-title":"Multi resource scheduling with task cloning in heterogeneous clusters","author":"Xu","year":"2022"},{"key":"10.1016\/j.jpdc.2023.104792_br0690","series-title":"RTAS","article-title":"Dynamic cache management using CAT virtualization","author":"Xu","year":"2017"},{"key":"10.1016\/j.jpdc.2023.104792_br0700","series-title":"ACM SIGCOMM","first-page":"428","article-title":"Multi-resource interleaving for deep learning training","author":"Zhao","year":"2022"},{"key":"10.1016\/j.jpdc.2023.104792_br0710","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1007\/s10586-016-0593-6","article-title":"P-aware: a proportional multi-resource scheduling strategy in cloud data center","volume":"19","author":"Zhou","year":"2016","journal-title":"Clust. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731523001624?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731523001624?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T03:15:19Z","timestamp":1700795719000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731523001624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":71,"alternative-id":["S0743731523001624"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2023.104792","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multi-resource scheduling of moldable workflows","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2023.104792","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104792"}}