{"title":"Coordinated and Hindsight Resources Allocation in Distributed Computing","authors":"V. Toporkov, D. Yemelyanov","doi":"10.1109/PDCAT46702.2019.00023","DOIUrl":null,"url":null,"abstract":"In this work, we consider heuristic algorithms for parallel jobs execution and efficient resources allocation in heterogeneous computing environments. Existing modern job-flow execution features and realities impose many restrictions for the resources allocation procedures. Emerging virtual organizations and incorporated economic scheduling models allow users and resource owners to compete for suitable allocations based on market principles and fair scheduling policies. Subject to these features a special dynamic programming scheme is proposed to select resources depending on how they fit a particular job execution duration. Hindsight approach makes it possible to select between several different scenarios obtained with the same base scheduling procedure. Based on a conservative backfilling scheduling procedure we study how different resources allocation heuristics affect integral job-flow scheduling characteristics in a dedicated simulation environment.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT46702.2019.00023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this work, we consider heuristic algorithms for parallel jobs execution and efficient resources allocation in heterogeneous computing environments. Existing modern job-flow execution features and realities impose many restrictions for the resources allocation procedures. Emerging virtual organizations and incorporated economic scheduling models allow users and resource owners to compete for suitable allocations based on market principles and fair scheduling policies. Subject to these features a special dynamic programming scheme is proposed to select resources depending on how they fit a particular job execution duration. Hindsight approach makes it possible to select between several different scenarios obtained with the same base scheduling procedure. Based on a conservative backfilling scheduling procedure we study how different resources allocation heuristics affect integral job-flow scheduling characteristics in a dedicated simulation environment.