{"title":"逻辑仿真中集群时间扭曲的动态负载平衡","authors":"Hervé Avril, C. Tropper","doi":"10.1145/238788.238804","DOIUrl":null,"url":null,"abstract":"We present, in this paper, a dynamic load balancing aJ.gorit.hm developed for Clustered Time Warp, a hybrid approach which makes we of Time Warp bet.wwn clusters of LPs and a sequent.isl mechanism within the clusters. The load balancing algorithm focuses on distributing the load of the sirnnlat.ion evenly among the processors and then tries to reduce interprocesmr communicatiorw We make nse of a triggering techniqne based on the thronghpnt of the sinmlat.ion system. The algorithm was implemented and its performance W-M rneasnred usin two of the largest 8 benchmark digital circnits of the I CAS’89 series. In order t,o measnre the effects of the algorithm on worklm.d distribution, inter-proces..or communication and rollbacks, we defined three dktinct met rim. Results show that by dynamicaJ1y balancing the load, the throughput was improved by 40 to 100% when compared to Time Warp. Thrcmghpnt. is the nnmbw of non rolled-back message events per unit time. It’hen the algorithm tried to reduce inter-processor communication, rollbacks were substantially rwlnced. Nevertheless, no substantial improvement was observed on the overall simulation time, sng Ming that f load distribution is the most important actor to be taken into consideration in speeding up the simulation of d@jt.ai circuits.","PeriodicalId":326232,"journal":{"name":"Proceedings of Symposium on Parallel and Distributed Tools","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"59","resultStr":"{\"title\":\"The Dynamic Load Balancing of Clustered Time Warp for Logic Simulation\",\"authors\":\"Hervé Avril, C. Tropper\",\"doi\":\"10.1145/238788.238804\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present, in this paper, a dynamic load balancing aJ.gorit.hm developed for Clustered Time Warp, a hybrid approach which makes we of Time Warp bet.wwn clusters of LPs and a sequent.isl mechanism within the clusters. The load balancing algorithm focuses on distributing the load of the sirnnlat.ion evenly among the processors and then tries to reduce interprocesmr communicatiorw We make nse of a triggering techniqne based on the thronghpnt of the sinmlat.ion system. The algorithm was implemented and its performance W-M rneasnred usin two of the largest 8 benchmark digital circnits of the I CAS’89 series. In order t,o measnre the effects of the algorithm on worklm.d distribution, inter-proces..or communication and rollbacks, we defined three dktinct met rim. Results show that by dynamicaJ1y balancing the load, the throughput was improved by 40 to 100% when compared to Time Warp. Thrcmghpnt. is the nnmbw of non rolled-back message events per unit time. It’hen the algorithm tried to reduce inter-processor communication, rollbacks were substantially rwlnced. Nevertheless, no substantial improvement was observed on the overall simulation time, sng Ming that f load distribution is the most important actor to be taken into consideration in speeding up the simulation of d@jt.ai circuits.\",\"PeriodicalId\":326232,\"journal\":{\"name\":\"Proceedings of Symposium on Parallel and Distributed Tools\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"59\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Symposium on Parallel and Distributed Tools\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/238788.238804\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Symposium on Parallel and Distributed Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/238788.238804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 59
摘要
本文提出了一种针对集群时间扭曲的动态负载平衡方法j .gorit.hm,这是一种使时间扭曲得以实现的混合方法。wwn集群的lp和一个顺序。集群内的Isl机制。负载均衡算法关注的是网络负载的分配。在此基础上,我们提出了一种基于单个处理器群集的触发技术。离子系统。该算法在I CAS ' 89系列中最大的8个基准数字电路中的两个上实现并测试了其性能W-M。为了衡量算法对worklm的影响。D分布,进程间…对于通信和回滚,我们定义了三种不同的边界。结果表明,通过动态平衡负载,与Time Warp相比,吞吐量提高了40%到100%。Thrcmghpnt。单位时间内非回滚消息事件的NNMBW。当该算法试图减少处理器间通信时,回滚大大减少。尽管如此,在整体仿真时间上并没有明显的改善,sng Ming认为负载分布是加快d@jt.ai电路仿真最需要考虑的因素。
The Dynamic Load Balancing of Clustered Time Warp for Logic Simulation
We present, in this paper, a dynamic load balancing aJ.gorit.hm developed for Clustered Time Warp, a hybrid approach which makes we of Time Warp bet.wwn clusters of LPs and a sequent.isl mechanism within the clusters. The load balancing algorithm focuses on distributing the load of the sirnnlat.ion evenly among the processors and then tries to reduce interprocesmr communicatiorw We make nse of a triggering techniqne based on the thronghpnt of the sinmlat.ion system. The algorithm was implemented and its performance W-M rneasnred usin two of the largest 8 benchmark digital circnits of the I CAS’89 series. In order t,o measnre the effects of the algorithm on worklm.d distribution, inter-proces..or communication and rollbacks, we defined three dktinct met rim. Results show that by dynamicaJ1y balancing the load, the throughput was improved by 40 to 100% when compared to Time Warp. Thrcmghpnt. is the nnmbw of non rolled-back message events per unit time. It’hen the algorithm tried to reduce inter-processor communication, rollbacks were substantially rwlnced. Nevertheless, no substantial improvement was observed on the overall simulation time, sng Ming that f load distribution is the most important actor to be taken into consideration in speeding up the simulation of d@jt.ai circuits.