{"title":"Dynamic load balancing in multi-agent spatial simulation","authors":"Bhargav A. Mistry, M. Fukuda","doi":"10.1109/PACRIM.2015.7334824","DOIUrl":null,"url":null,"abstract":"This paper presents dynamic load balancing in a parallelizing library for multi-agent spatial simulation (named MASS). Our load-balancing algorithms calculate per-thread CPU load right after every function call and adjust a data size to be passed to each thread for the next function call. We implemented three different thread-based load-balancing algorithms, each using (1) an entire history, (2) a recent time window and (3) a slope of the CPU loads. The paper presents our implementation of these three algorithms in MASS as well as performance evaluation with two multithreaded applications: Wave2D and SugarScape. Furthermore, to demonstrate the slope-based algorithm's superiority to the other two, we compared them over a cluster of computing nodes.","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2015.7334824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper presents dynamic load balancing in a parallelizing library for multi-agent spatial simulation (named MASS). Our load-balancing algorithms calculate per-thread CPU load right after every function call and adjust a data size to be passed to each thread for the next function call. We implemented three different thread-based load-balancing algorithms, each using (1) an entire history, (2) a recent time window and (3) a slope of the CPU loads. The paper presents our implementation of these three algorithms in MASS as well as performance evaluation with two multithreaded applications: Wave2D and SugarScape. Furthermore, to demonstrate the slope-based algorithm's superiority to the other two, we compared them over a cluster of computing nodes.