{"title":"Parallel gate-level circuit simulation on shared memory architectures","authors":"R. Bagrodia, Yuan Chen, V. Jha, N. Sonpar","doi":"10.1145/214282.214336","DOIUrl":"https://doi.org/10.1145/214282.214336","url":null,"abstract":"This paper presents the results of an experimental study to evaluate the effectiveness of parallel simulation in reducing the execution time of gate-level models of VLSI circuits. Specific contributions of this paper include (i) the design of a gate-level parallel simulator that can be executed, without any changes on both distributed memory and shared memory parallel architectures, (ii) demonstrated speedups with both conservative and optimistic simulation protocols (almost all previous studies on circuit simulation have failed to extract speedups with conservative protocols); in particular we showed that a speedup of about 3 was obtained on 8 processors of a Sparc1000 for conservative algorithms and about 2 for optimistic algorithms for circuits in the ISCAS85 benchmark suite; and (iii) performance comparison between shared memory and distributed memory implementations of the simulator.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134424474","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}
{"title":"Buffer management in shared-memory time warp systems","authors":"R. Fujimoto, K. Panesar","doi":"10.1145/214282.214330","DOIUrl":"https://doi.org/10.1145/214282.214330","url":null,"abstract":"Mechanisms for managing message buffers in Time Warp parallel simulations executing on cache-coherent shared-memory multiprocessors are studied. Two simple buffer management strategies called the sender pool and receiver pool mechanisms are examined with respect to their efficiency, and in particular, their interaction with multiprocessor cache-coherence protocols. Measurements of implementations on a Kendall Square Research KSR-2 machine using both synthetic workloads and benchmark applications demonstrate that sender pools offer significant performance advantages over receiver pools. However, it is also observed that both schemes, especially the sender pool mechanism, are prone to severe performance degradations due to poor locality of reference in large simulations using substantial amounts of message buffer memory. A third strategy called the partitioned buffer pool approach is proposed that exploits the advantages of sender pools, but exhibits much better locality. Measurements of this approach indicate that the partitioned pool mechanism yields substantially better performance than both the sender and receiver pool schemes for large-scale, small-granularity parallel simulation applications. The central conclusions from this study are: (1) buffer management strategies play an important role in determining the overall efficiency of multiprocessor-based parallel simulators, and (2) the partitioned buffer pool organization offers significantly better performance than the sender and receiver pool schemes. These studies demonstrate that poor performance may result if proper attention is not paid to realizing an efficient buffer management mechanism.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"875 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123026383","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}
{"title":"Parallel and distributed simulation of free choice Petri nets","authors":"F. Baccelli, N. Furmento, B. Gaujal","doi":"10.1145/214282.214288","DOIUrl":"https://doi.org/10.1145/214282.214288","url":null,"abstract":"In this paper, we present two new methods to simulate Petri Nets: a data parallel simulation and a distributed simulation. Both simulations use an equational representation of the net in the so called (min,+) algebra. The data parallel simulation is based on the use of matrix representation of these equations, and the distributed simulation on the decomposition of a Petri net into marked graph components.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"82 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114403859","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}
{"title":"An improved cost function for static partitioning of parallel circuit simulations using a conservative synchronization protocol","authors":"K. Kapp, T. Hartrum, T. S. Wailes","doi":"10.1145/214282.214306","DOIUrl":"https://doi.org/10.1145/214282.214306","url":null,"abstract":"Distributing computation among multiple processors is one approach to reducing simulation time for large VLSI circuit designs. However, parallel simulation introduces the problem of how to partition the logic gates and system behaviors of the circuit among the available processors in order to obtain maximum speedup. A complicating factor that is often ignored is the effect of the time-synchronization protocol (conservative or optimistic). Inherent in the partitioning problem is the question of how to effectively measure the relative quality of a partition. This paper describes an objective cost function for measuring the relative quality of a task partition that includes a synchronization factor for a conservative NULL-message protocol. A graph-based partitioning tool based on this cost function is used to perform the static task allocation for parallel simulation of a structural VHDL circuit. Results for two 1000-4000 gate circuits demonstrate that the additional consideration of the synchronization protocol in the cost function generates partitions that exhibit improved speedup.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128017810","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}
{"title":"Probabilistic adaptive direct optimism control in time warp","authors":"A. Ferscha","doi":"10.1109/PADS.1995.404309","DOIUrl":"https://doi.org/10.1109/PADS.1995.404309","url":null,"abstract":"In a distributed memory environment the communication overhead of Time Warp as induced by the rollback procedure due to \"overoptimistic\" progression of the simulation is the dominating performance factor. To limit optimism to an extent that can be justified from the inherent model parallelism, an optimism control mechanism is proposed, which by maintaining a history record of virtual time differences from the time stamps carried by arriving messages, and forecasting the timestamps of forthcoming messages, probabilistically delays the execution of scheduled events to avoid potential rollback and associated communication overhead (antimessages). After investigating statistical forecast methods which express only the central tendency of the arrival process, we demonstrate that arrival processes in the context of Time Warp simulations of timed Petri nets have certain predictable and consistent ARIMA characteristics, which encourage the use of sophisticated and recursive forecast procedures based on those models. Adaptiveness is achieved in two respects: the synchronization behavior of logical processes automatically adjusts to that point in the continuum between optimistically progressing and conservatively blocking, that is the most adequate for (i) the specific simulation model and (ii) the communication/computation speed characteristics of the underlying execution platform.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114444537","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}
{"title":"Clustered time warp and logic simulation","authors":"Hervé Avril, C. Tropper","doi":"10.1109/PADS.1995.404310","DOIUrl":"https://doi.org/10.1109/PADS.1995.404310","url":null,"abstract":"We present, in this paper, a hybrid algorithm which makes use of Time Warp between clusters of LPs and a sequential algorithm within the cluster. Time Warp is, of course, traditionally implemented between individual LPs. The algorithm was implemented in a digital logic simulator, and its performance compared to that of Time Warp. Resting upon this platform we develop a family of three checkpointing algorithms, each of which occupies a different point in the spectrum of possible trade-offs between memory usage and execution time. The algorithms were implemented on several digital logic circuits and their speed, number of states saved and maximal memory consumption were compared to those of Time Warp. One of the algorithms saved between 35 and 50% of the maximal memory consumed by Time Warp (depending upon the number of processors used), while the other two decreased the maximal usage up to 30%. The latter two algorithms exhibited a speed comparable to Time Warp, while the first algorithm was 30-60% slower. These algorithms are also simpler to implement than optimal checkpointing algorithms.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121897604","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}
{"title":"Distributed simulation with locality","authors":"T. Blanchard, T. Lake","doi":"10.1109/PADS.1995.404298","DOIUrl":"https://doi.org/10.1109/PADS.1995.404298","url":null,"abstract":"We describe MOSS, a small language of mobile distributed objects and system-wide references, uncommitted to any distributed simulation protocol, but which can be executed as a distributed conservative simulation with automatic deduction of lookahead. We show how the MOSS programmer can control the dynamic distribution and locality of simulation objects by simple means which provide natural modelling functions. Preliminary results show how programmed locality can reduce communication costs in simulation.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129739836","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}
{"title":"Performance predictions for parallel diagonal-implicitly iterated Runge-Kutta methods","authors":"T. Rauber, G. Rünger","doi":"10.1145/214282.214292","DOIUrl":"https://doi.org/10.1145/214282.214292","url":null,"abstract":"Many simulations in the natural sciences and engineering require the numerical solution of nonlinear differential equations. For this class of numerical methods, we propose an appropriate parallel computation model on distributed memory machines that supports the prediction of execution times. As a case study, we investigate the parallel implementation of the diagonal-implicitly iterated Runge-Kutta method, a solution method for stiff systems of ordinary differential equations. An implementation on the Intel iPSC/860 confirms the accuracy of the prediction model.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132534555","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}
{"title":"The ultimate bead counter: efficient massively parallel simulation of ballistic deposition","authors":"B. Lubachevsky, V. Privman, S. Roy","doi":"10.1145/214282.214311","DOIUrl":"https://doi.org/10.1145/214282.214311","url":null,"abstract":"We simulate ballistic particle deposition wherein a large number of spherical particles are \"dropped\" vertically over a planar horizontal surface. Upon first contact (with the surface or with a previously deposited particle) each particle stops. This model helps material scientists to study the adsorption and sediment formation. The model is sequential, with particles deposited one by one. We have found an equivalent formulation using a continuous time random process and we simulate the latter in parallel using a method similar to the one previously employed for simulating Ising spins. We augment the parallel algorithm for simulating Ising spins with several techniques aimed at the increase of efficiency of producing the particle configuration and statistics collection. We implement the resulting algorithm on a 16K PE MasPar MP-1 and a 4K PE MasPar MP-2. The parallel code runs on MasPar computers two orders of magnitude faster than an optimized sequential code runs on a fast workstation.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114835945","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}
{"title":"Global virtual time and distributed synchronization","authors":"J. Steinman, Craig A. Lee, L. F. Wilson, D. Nicol","doi":"10.1145/214282.214324","DOIUrl":"https://doi.org/10.1145/214282.214324","url":null,"abstract":"Global Virtual Time (GVT) is the fundamental synchronization concept in optimistic simulations. It is defined as the earliest time tag within the set of unprocessed pending events in a distributed simulation. A number of techniques for determining GVT have been proposed in recent years, each having their own intrinsic properties. However, most of these techniques either focus on specific types of simulation problems or assume specific hardware support. This paper specifically addresses the GVT problem in the context of the following areas: Scalability, Efficiency, Portability, Flow control, Interactive support, Real time use. A new GVT algorithm, called SPEEDES GVT, has been developed in the Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES) framework. The new algorithm runs periodically but does not disrupt event processing. It provides flow control by processing events risk-free while flushing out messages during the GVT computation. SPEEDES GVT is built from a set of global reduction operations that are easily implementable on any hardware system.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115857011","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}