M. Nour, S. Shaheen, G. F. El-Kabbany, Nadia Hegazy
{"title":"Proposal of an analytical solution for the load imbalance problem in parallel systems","authors":"M. Nour, S. Shaheen, G. F. El-Kabbany, Nadia Hegazy","doi":"10.1109/ISPDC.2003.1267660","DOIUrl":null,"url":null,"abstract":"In this paper, a parallel dynamic load balancing algorithm; which offers a good trade-off between the balancing degree and communication costs; is proposed. The proposed algorithm is analyzed, investigated, and implemented. Also, a new mathematical solution for that algorithm is presented. The analytical solution is tested on standard task graphs (STG) as common test-bed benchmarks. All the different parameters concerned with processors, memory, interconnection networks, and task programs are also presented. The new proposed algorithm is compared and evaluated with a traditional dynamic load balancing one. Experimental results are presented by considering a set of criteria for evaluating the overall performance. Simulation and analytical results proved that the proposed algorithm outperforms the chosen one.","PeriodicalId":368813,"journal":{"name":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2003.1267660","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, a parallel dynamic load balancing algorithm; which offers a good trade-off between the balancing degree and communication costs; is proposed. The proposed algorithm is analyzed, investigated, and implemented. Also, a new mathematical solution for that algorithm is presented. The analytical solution is tested on standard task graphs (STG) as common test-bed benchmarks. All the different parameters concerned with processors, memory, interconnection networks, and task programs are also presented. The new proposed algorithm is compared and evaluated with a traditional dynamic load balancing one. Experimental results are presented by considering a set of criteria for evaluating the overall performance. Simulation and analytical results proved that the proposed algorithm outperforms the chosen one.