Workshop on Parallel and Distributed Simulation最新文献

筛选
英文 中文
A static partitioning and mapping algorithm for conservative parallel simulations 保守并行仿真的静态划分和映射算法
Workshop on Parallel and Distributed Simulation Pub Date : 1994-08-01 DOI: 10.1145/182478.182586
A. Boukerche, C. Tropper
{"title":"A static partitioning and mapping algorithm for conservative parallel simulations","authors":"A. Boukerche, C. Tropper","doi":"10.1145/182478.182586","DOIUrl":"https://doi.org/10.1145/182478.182586","url":null,"abstract":"In this paper, we consider the problem of partitioning a conservative parallel simulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulated annealing algorithm with an adaptive search schedule to find good (sub-optimal) partitions. The paper discusses the algorithm, its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on iPSC/860 hypercube. The results obtained are compared with a random partitioning. They show that a partitioning which makes use of our simulated annealing algorithm results in a reduction of 25-35% of the running time of the simulations when compared to the running time of a random partition of the model.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134357491","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}
引用次数: 86
The effect of synchronization requirements on the performance of distributed simulations 同步需求对分布式仿真性能的影响
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158478
Murali S. Shanker, B. E. Patuwo
{"title":"The effect of synchronization requirements on the performance of distributed simulations","authors":"Murali S. Shanker, B. E. Patuwo","doi":"10.1145/158459.158478","DOIUrl":"https://doi.org/10.1145/158459.158478","url":null,"abstract":"Recent experiments have shown that conservative methods can achieve good performance by exploiting the characteristics of the system being simulated. In this paper we focus on the interrelationship between run time and synchronization requirements of a distributed simulation. A metric that considers the effect of lookahead and the physical rate of transmission of messages, and an arrival approximation that models the effect of synchronization requirements on the run time are developed. It is shown that even when good lookahead is exploited in the system, poor run-time performance is achieved if an inefficient mapping of LPs to processors is used.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131223041","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}
引用次数: 5
The local Time Warp approach to parallel simulation 局部时间扭曲方法的并行仿真
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158474
H. Rajaei, R. Ayani, L. Thorelli
{"title":"The local Time Warp approach to parallel simulation","authors":"H. Rajaei, R. Ayani, L. Thorelli","doi":"10.1145/158459.158474","DOIUrl":"https://doi.org/10.1145/158459.158474","url":null,"abstract":"The two main approaches to parallel discrete event simulation – conservative and optimistic – are likely to encounter some limitations when the size and complexity of the simulation system increases. For such large scale simulations, the conservative approach appears to be limited by blocking overhead and sensitivity to lookahead, whereas the optimistic approach may become prone to cascading rollbacks, state saving overhead, and demands for larger memory space. These drawbacks restrict the synchronization schemes based on each of the two approaches from scaling up. A combined approach may resolve these limitations, while preserving and utilizing potential advantages of each method. However, the schemes proposed so far integrate the two views at the same level, i.e. local to a logical process, and hence may not be able to fully solve the problems. In this paper we propose the Local Time Warp method for parallel discrete-event simulation and present a novel synchronization scheme for it called HCTW. The new scheme hierarchically combines a Conservative Time Window algorithm with Time Warp and aims at reducing cascade rollbacks, sensitivity to lookahead, and the scalability problems. Local Time Warp is believed to be suitable for parallel machines equipped with thousands of processors and thus an appropriate candidate for simulation of large and complex systems.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"566 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116990","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}
引用次数: 88
Breathing Time Warp 呼吸时间扭曲
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158473
J. Steinman
{"title":"Breathing Time Warp","authors":"J. Steinman","doi":"10.1145/158459.158473","DOIUrl":"https://doi.org/10.1145/158459.158473","url":null,"abstract":"Time Warp and Breathing Time Buckets are two general-purpose optimistic synchronization strategies for supporting parallel discrete-event simulations. However, each one of these approaches has potential fatal shortcomings. Time Warp may exhibit rollback explosions that can cause an avalance of antimessages. Breathing Time Buckets, on the other hand, may not be able to process enough events per synchronization cycle to remain efficient.\u0000A new strategy, called Breathing Time Warp, has been developed in the Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES) operating sytem. This new strategy solves both of these problems by mixing the two algorithms together, resulting in the best of both methods.\u0000This paper describes the implementation of the Breathing Time Warp algorithm in SPEEDES, and then shows how this new approach sometimes improves the performance of parallel discrete-event simulations.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130317091","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}
引用次数: 216
Performance of a riskfree Time Warp operating system 无风险时间扭曲操作系统的性能
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158479
Steven F. Bellenot
{"title":"Performance of a riskfree Time Warp operating system","authors":"Steven F. Bellenot","doi":"10.1145/158459.158479","DOIUrl":"https://doi.org/10.1145/158459.158479","url":null,"abstract":"Optimistic methods of synchronizing parallel discrete event simulations can be risky by sending (positive) messages (events) before they have been committed. Risky methods often use anti-messages (negative messages) to cancel incorrectly sent positive messages. Riskfree methods are more conservative, they do not send messages until they are known to be correct. The Time Warp Operating System (TWOS) uses anti-messages. Riskfree TWOS is implemented and tested on the standard TWOS benchmarks. Performance of the riskfree TWOS is dependent on the amount of lookahead in the simulation. Good lookahead was required for even reasonable performance. Tracker, a simulation of the riskfree simulation, is used to give idealized best case riskfree performance. BeRisky is an example simulation which has a speedup of n for Time Warp, but only a speedup of 2 for riskfree methods.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126211186","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}
引用次数: 17
Determining initial states for time-parallel simulations 确定时间并行模拟的初始状态
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158462
Jain-Chung J. Wang, M. Abrams
{"title":"Determining initial states for time-parallel simulations","authors":"Jain-Chung J. Wang, M. Abrams","doi":"10.1145/158459.158462","DOIUrl":"https://doi.org/10.1145/158459.158462","url":null,"abstract":"Time-parallel simulations exploit parallelism by partitioning the time domain of a simulation model. Exploiting temporal parallelism requires predicting future states of a simulation model. A poor prediction of future states may cause extensive recomputation so that a time-parallel simulation requires more real time to execute than a corresponding sequential simulation. Recurrent states of a simulation model provide a way to predict future states. In this paper, we propose a time-parallel simulation method which uses a pre-simulation to identify recurrent states. For simulation models in which recurrent states do not exist or can not support sufficient time parallelism, an approximation technique is suggested to extend the class of simulation models to which time-parallel simulation can be applied. Several queueing network models are investigated with the proposed time-parallel simulation. Experimental result suggest that the proposed approach can exploit massive parallelism while yielding accurate results.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"77 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113958519","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}
引用次数: 16
Efficient implementation of event sets in Time Warp 在时间扭曲中有效实现事件集
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158472
R. Rönngren, R. Ayani, R. Fujimoto, Samir R Das
{"title":"Efficient implementation of event sets in Time Warp","authors":"R. Rönngren, R. Ayani, R. Fujimoto, Samir R Das","doi":"10.1145/158459.158472","DOIUrl":"https://doi.org/10.1145/158459.158472","url":null,"abstract":"The implementation of the pending event set (PES) is crucial to the execution speed of discrete event simulation programs. This paper studies the implementation of the PES in the context of simulations executing on parallel computers using the Time Warp mechanism. We present a scheme for implementing Time Warsp's PES based on well-known data structures for priority queues. This scheme supports efficient management of future and past events, especially for rollback and fossil collection operations. A comparative study of several queue implementations is presented. Experiments with a Time Warp system executing on a Kendall Square Research multiprocessor (KSR1) demonstrate that the implementation of the input queue can have a dramatic impact on performance, as large as an order of magnitude, that is much greater than what can be accounted for by simply the reduced execution time to access the data structure. In particular, it is demonstrated that an efficient input queue implementation can also significantly reduce the number of rollbacks, and the efficiency of memory management policies such as Jefferson's cancelback protocol. In the context of this work we also present an improved version of the skew heap that allows dequeueing of arbitrary elements at low cost. In particular, the possibility of dequeueing arbitrary elements will improve memory utilization. This ability is also important in applications where frequent rescheduling may occur, as in ready queues used to select the next logical process to execute.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129358560","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}
引用次数: 30
Disseminating critical target-specific synchronization information in parallel discrete event simulations 在并行离散事件模拟中传播关键目标特定的同步信息
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158466
C. Pancerella, P. Reynolds
{"title":"Disseminating critical target-specific synchronization information in parallel discrete event simulations","authors":"C. Pancerella, P. Reynolds","doi":"10.1145/158459.158466","DOIUrl":"https://doi.org/10.1145/158459.158466","url":null,"abstract":"A hardware-based framework which supports a wide range of parallel discrete event synchronization protocols has been proposed in [Reyn92]. This framework offloads all synchronization activity from the host processors and host communication network in the system. The underlying hardware computes results of global, binary associative operations, or global reductions. In this paper we present results of simulations that strongly suggest the need for a next-generation reduction network which computes and disseminates results of target-specific reductions to support both aggressive and non-aggressive parallel discrete event simulations. Target-specific reductions allow a logical process to receive synchronization information only from those logical processes which may have a direct or indirect impact on its performance.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115500364","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}
引用次数: 15
Corolla partitioning for distributed logic simulation of VLSI-circuits 用于vlsi电路分布式逻辑仿真的花冠划分
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158470
C. Sporrer, H. Bauer
{"title":"Corolla partitioning for distributed logic simulation of VLSI-circuits","authors":"C. Sporrer, H. Bauer","doi":"10.1145/158459.158470","DOIUrl":"https://doi.org/10.1145/158459.158470","url":null,"abstract":"Time Warp has evolved to a common technique for distributed simulation. Speedup in Time Warp simulation systems mainly depends on two overhead factors: first, the load on the simulators has to be well balanced and second, communication and rollbacks have to be kept to a minimum. Both of these factors are influenced by the partitioning of the simulated system. In this paper, we focus on various static partitioning schemes used to partition digital circuits for distributed simulation.\u0000A new hierarchical partitioning approach is presented, compared and rated with other partitioning schemes by evaluating benchmark circuits. Partitioning is done in two steps: a fine grained clustering step based on corollas and a coarse grained step forming partitions using the connectivity matrix. The corolla approach yields very good partitioning results even for a large number of partitions. The achieved speedups are almost linear (up to 12 partitions for larger circuits), as long as the partition sizes are large enough so that communication between the simulators is not a bottleneck. The results reveal the great impact of partitioning on the acceleration of distributed logic simulation and show the effectiveness of the presented corolla partitioning scheme.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045167","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}
引用次数: 46
Shared variables in distributed simulation 分布式仿真中的共享变量
Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158468
Horst Mehl, Stefan Hammes
{"title":"Shared variables in distributed simulation","authors":"Horst Mehl, Stefan Hammes","doi":"10.1145/158459.158468","DOIUrl":"https://doi.org/10.1145/158459.158468","url":null,"abstract":"Although users may want to employ shared variables when they program distributed simulation applications, almost none of the currently existing distributed simulation systems do offer this facility. In this paper, we present new algorithms which provide the illusion of consistent shared variables in distributed simulation systems without physically shared memmory.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"527 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116198003","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}
引用次数: 44
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信