Proceedings of Symposium on Parallel and Distributed Tools最新文献_第2页

A Performance Evaluation Methodology for Parallel Simulation Protocols 并行仿真协议的性能评估方法

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1109/PADS.1996.761576

V. Jha, R. Bagrodia

引用次数: 23

Estimating the Cost of Throttled Execution in Time Warp 估算时间扭曲中节流执行的成本

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1109/PADS.1996.761577

Samir R Das

引用次数: 13

The Dynamic Load Balancing of Clustered Time Warp for Logic Simulation 逻辑仿真中集群时间扭曲的动态负载平衡

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238804

Hervé Avril, C. Tropper

{"title":"The Dynamic Load Balancing of Clustered Time Warp for Logic Simulation","authors":"Hervé Avril, C. Tropper","doi":"10.1145/238788.238804","DOIUrl":"https://doi.org/10.1145/238788.238804","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.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128030281","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}

引用次数: 59

Parallel Simulation of Billiard Balls using Shared Variables 基于共享变量的台球并行仿真

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238845

P.A. MacKenzie, C. Tropper

{"title":"Parallel Simulation of Billiard Balls using Shared Variables","authors":"P.A. MacKenzie, C. Tropper","doi":"10.1145/238788.238845","DOIUrl":"https://doi.org/10.1145/238788.238845","url":null,"abstract":"WC: ~rv:w:nt, iTL t}LioV IMqM:r, (L (:()?knc?wih(: ld~(dh?ll j(w tk(: padkl sirnulaiion oj hdliani halls. It G+ cortwwn to employ a qwtial appwaclh to tk cm: .9irrbui4Ltiow, in uJLick tkc billiard tahlc ti partiiioncd inta 8cgrIL(:rbts wkick an: nimulat cd by diflc77:rkt prw:w.ww. It diffcrx jrwrrl prvviOw all~T7MdL (:8 i?b t~LILt it rnakcs lb.q c Oj 8k(Ld U(Lri(LkiC/T to cnakl(: prw:cmww to a.wnfain th: stat c of A: wrrqmtat ion al nci@oring y wn:cwow. Tkc skarwl uariahlc ctH7Y:qMmd.9 t{) a 7w@4)?b at .& !Mwb&y Oj i?k(: tdd(: WJ?lLC7bt# (tiL(: 8(~callcd critical rwgio7b ). By rnaki?q uw of JAarcd vtLrialdcN a nigrbi~carbt qmctl-wp 07Jcr tkc mccutifm tirac Oj a prbrcly C07L8CTWLti 11(: (L~)lWOdL i.q 0ht(Li7L[:d. TIM ulgoritkm wan iruI)[crrb [:ntcd on IL BBN Butterfly, W+ WILY a Purdy corb.vcrrlatiuc ahpitkrrb. In t}w co?wcr’uai?iw: aigolitk, a pwn:cwwr uLAi7tg to prww~ a hall in tk:critical n:gion waitn urbtil kk[! 7b[:i@07i7b(J 117W[:,WIW8 .’4i?ILlLktiOlb ti71LC h CJTr!lLt(:r i}LC7b tlk(: tiwc of tkc cf)c7bt it 7AA:8 to pwcc.w. 17b fnLr czp(:rivll(:?bh+, wc (:X(L71LiTk(:d tklW pI)])lbhLtif)?b h:ul:~Y of iMLii.Y-~~ ~(), 48V0 and ~~~~. TILWJCpop,dations wcw CLONCV, to rwfh:t (L low, rrdiwrrb a71d kiyh population of Mix TILC ,dLan:dua7ialdc approaciL 7wdtcd in a 30 to50pwc(:rbt dccn:aw in tltcz(:cdiorb ti7rb(: oj tibc pun:ly co7hw:vwdiw a]lp17ML(:}L.","PeriodicalId":326232,"journal":{"name":"Proceedings of Symposium on Parallel and Distributed Tools","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130221173","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}

引用次数: 4

Discrete-Event Simulation and the Event Horizon Part 2: Event List Management 离散事件仿真和事件视界，第2部分:事件列表管理

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238841

J. Steinman

{"title":"Discrete-Event Simulation and the Event Horizon Part 2: Event List Management","authors":"J. Steinman","doi":"10.1145/238788.238841","DOIUrl":"https://doi.org/10.1145/238788.238841","url":null,"abstract":"The event horizon is a very important concept that applies to both parallel and sequential discrete-event simulations. By exploiting the event horizon, parallel simulations can processes events optimistically in a risk-free manner (i.e., without requiring antimessages) using adaptable \"breathing\" time cycles with variable time widths. Additionally, exploiting the event horizon can significantly reduce the overhead of event list management that is common to virtually all discrete-event simulations. This paper is a continuation of work previously reported at PADS94. In that report, a complete mathematical formulation of the event horizon was derived under equilibrium conditions using the hold model. Various forms of the beta density function were consequently used to verify the predicted results of the analytic model. This second report describes how the concept of the event horizon can also be applied to event list management. By exploiting the event horizon, the performance of several priority queue data structures are improved including: linked lists, various binary trees, and heaps. A somewhat detailed description of these modified data structures along with other relevant background information is provided for completeness. Performance results for each of these priority queue data structure is provided.","PeriodicalId":326232,"journal":{"name":"Proceedings of Symposium on Parallel and Distributed Tools","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117020177","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}

引用次数: 28

Reducing Synchronization Overhead in Parallel Simulation 减少并行仿真中的同步开销

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238822

Ulana Legedza, W. Weihl

{"title":"Reducing Synchronization Overhead in Parallel Simulation","authors":"Ulana Legedza, W. Weihl","doi":"10.1145/238788.238822","DOIUrl":"https://doi.org/10.1145/238788.238822","url":null,"abstract":"Synchronization is often the dominant cost in conservative parallel simulation, particularly in simulations of parallel computers, in which low-latency simulated communication requires frequent synchronization. We present and evaluate LOCAL BARRIERS and PREDICTIVE BARRIER SCHEDULING, two techniques for reducing synchronization overhead in the simulation of message-passing multicomputers. Local barriers use nearest-neighbor synchronization to reduce waiting time at synchronization points. Predictive barrier scheduling, a novel technique that schedules synchronizations using both compile-time and runtime analysis, reduces the frequency of synchronization operations. In contrast to other work in this area, both techniques reduce synchronization overhead without decreasing the accuracy of network simulation. These techniques were evaluated by comparing their performance to that of periodic global synchronization. Experiments show that local barriers improve performance by up to 24% for communication-bound applications, while predictive barrier scheduling improves performance by up to 65% for applications with long local computation phases. Because the two techniques are complementary, we advocate a combined approach. This work was done in the context of PARALLEL PROTEUS, a new parallel simulator of message-passing multicomputers.","PeriodicalId":326232,"journal":{"name":"Proceedings of Symposium on Parallel and Distributed Tools","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126341361","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}

引用次数: 48

Parallel Simulation of a High-Speed Wormhole Routing Network 高速虫洞路由网络的并行仿真

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238813

R. Bagrodia, Yuan Chen, M. Gerla, B. Kwan, Jay Martin, P. Palnati, S. Walton

引用次数: 15

Hierarchical Strategy of Model Partitioning for VLSI-Design Using an Improved Mixture of Experts Approach 分层的模型划分策略VLSI-Design专家使用一种改进的混合方法

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238825

K. Hering, R. Haupt, T. Villmann

引用次数: 14

Transparent Incremental State Saving in Time Warp Parallel Discrete Event Simulation 时间扭曲并行离散事件仿真中的透明增量状态保存

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238818

R. Rönngren, M. Liljenstam, R. Ayani, J. Montagnat

引用次数: 73

Design of High Level Modelling / High Performance Simulation Environments 高级建模/高性能仿真环境设计

Proceedings of Symposium on Parallel and Distributed Tools Pub Date : 1996-07-01 DOI: 10.1145/238788.238839

B. Zeigler, Doohwan Kim

引用次数: 15