Pub Date : 2021-11-11DOI: 10.1109/cits52676.2021.9618074
Georgios L. Stavrinides, H. Karatza
One of the key challenges in distributed systems is the effective and efficient resource assignment for the incoming workload. To this end, two novel task routing strategies are proposed and compared to two well-known policies, Probabilistic and Shortest Queue routing. The proposed techniques aim to provide substantially better performance than the Probabilistic policy and incur significantly less overhead than the Shortest Queue strategy. The performance of the four routing techniques is evaluated via simulation, by taking also into account the implementation effort and the routing overhead required in each case. The performance of the resource assignment strategies is examined under different cases of system load and task service time variability. The simulation results reveal that the proposed routing strategies perform significantly better than the Probabilistic policy. Furthermore, the proposed heuristics could be used in large-scale distributed systems, where the Shortest Queue strategy, even though in theory outperforms other policies, in practice does not scale well, due to the excessive amount of information it requires for each routing decision.
{"title":"Resource Assignment Strategies for Bags-of-Tasks in Distributed Systems","authors":"Georgios L. Stavrinides, H. Karatza","doi":"10.1109/cits52676.2021.9618074","DOIUrl":"https://doi.org/10.1109/cits52676.2021.9618074","url":null,"abstract":"One of the key challenges in distributed systems is the effective and efficient resource assignment for the incoming workload. To this end, two novel task routing strategies are proposed and compared to two well-known policies, Probabilistic and Shortest Queue routing. The proposed techniques aim to provide substantially better performance than the Probabilistic policy and incur significantly less overhead than the Shortest Queue strategy. The performance of the four routing techniques is evaluated via simulation, by taking also into account the implementation effort and the routing overhead required in each case. The performance of the resource assignment strategies is examined under different cases of system load and task service time variability. The simulation results reveal that the proposed routing strategies perform significantly better than the Probabilistic policy. Furthermore, the proposed heuristics could be used in large-scale distributed systems, where the Shortest Queue strategy, even though in theory outperforms other policies, in practice does not scale well, due to the excessive amount of information it requires for each routing decision.","PeriodicalId":211570,"journal":{"name":"2021 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114842537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：