The Hierarchical Tool HIT is a software tool for hierarchical modeling and performance evaluation of discrete event systems. Besides analytical and numerical solution techniques HIT provides the evaluation of models b...
ISBN:
(纸本)9780818679650
The Hierarchical Tool HIT is a software tool for hierarchical modeling and performance evaluation of discrete event systems. Besides analytical and numerical solution techniques HIT provides the evaluation of models by sequential simulation. Here we present concepts for optimistic distributedsimulation of HIT-models by partitioning them with respect to subhierarchies. The main goals of the concept being presented are the preservation of model structure even in lower levels of the realization (e.g. use of the process view of simulation throughout all levels of abstraction) and distribution transparency on the modeling level (homogeneous model specification for all solution techniques).
In this paper we address the problem of efficiently performing parallel discrete-event simulation in the case that events elaboration is dependent of other processes' local states. We propose a parallelsimulation...
ISBN:
(纸本)9780818679650
In this paper we address the problem of efficiently performing parallel discrete-event simulation in the case that events elaboration is dependent of other processes' local states. We propose a parallelsimulation policy, called State Query Time Warp (SQTW), based on the Time Warp mechanism. We present experiments performed by means of a SQTW-based parallel simulator on a T-800 transputer machine for solving performance models based on state-dependent routing queueing network models. The experiments are used for assessing overheads and efficiency involved by SQTW; results show that high efficiency is achievable, and surprisingly reveal SQTW is able to globally reduce rollback overheads with respect to corresponding Time Warp simulations.
We propose two new asynchronous parallel algorithms for test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in whi...
详细信息
ISBN:
(纸本)9780818679650
We propose two new asynchronous parallel algorithms for test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among the available processors. These algorithms provide the same result as the previous synchronous two stage approach. However, due to the dynamic characteristics of these algorithms and due to the fact that there is very minimal redundant work, they run faster than the previous synchronous approach. A theoretical analysis comparing the various algorithms is also given to provide an insight into these algorithms. The implementations were done in MPI and are therefore portable to many parallel platforms. Results are shown for a shared memory multiprocessor.
The unthrottled optimism underlying the Time Warp (TW) parallelsimulation protocol can lead to excessive aggressiveness in memory consumption due to saving state histories, and waste of CPU cycles due to overoptimist...
详细信息
The unthrottled optimism underlying the Time Warp (TW) parallelsimulation protocol can lead to excessive aggressiveness in memory consumption due to saving state histories, and waste of CPU cycles due to overoptimistically progressing simulations that eventually have to be "rolled back". Furthermore, in TW simulations executing in distributed memory environments, the communication overhead induced by the rollback mechanism can cause pathological overall simulation performance. In this work direct optimism control mechanisms are used to overcome these shortcomings by probabilistically controlling simulation progression based on the forecasted time stamp of forthcoming messages. Several forecast methods are presented and their performance is compared for very large Petri net simulation models executed with the TW protocol on the Meiko CS-2.
With two examples we show the suitability of the bulk-synchronous parallel (BSP) model for discrete-event simulation of homogeneous large-scale systems. This model provides a unifying approach for general purpose para...
详细信息
ISBN:
(纸本)9780818679650
With two examples we show the suitability of the bulk-synchronous parallel (BSP) model for discrete-event simulation of homogeneous large-scale systems. This model provides a unifying approach for general purpose parallel computing which in addition to efficient and scalable computation, ensures portability across different parallel architectures. A valuable feature of this approach is a simple cost model that enables precise performance prediction of BSP algorithms. We show both theoretically and empirically that systems with uniform event occurrence among their components, such as colliding hard-spheres and ising-spin models, can be efficiently simulated in practice on current parallel computers supporting the BSP model.
The IDES project at Sandia National Laboratories is developing a large scale portable parallel simulator for use in stockpile stewardship. IDES will use the Breathing-Time-Buckets synchronization protocol; to support ...
详细信息
ISBN:
(纸本)9780818679650
The IDES project at Sandia National Laboratories is developing a large scale portable parallel simulator for use in stockpile stewardship. IDES will use the Breathing-Time-Buckets synchronization protocol; to support IDES development, this paper studies a performance model and describes performance experiments on expected work load and architectural parameters. A new parallel algorithm for terminating the window quickly is also described and analyzed.
We present a conservative strategy for spatially decomposed parallel discrete event battlefield simulation. The traditional null message algorithm provides a foundation from which a mapping to generic simulation attri...
详细信息
ISBN:
(纸本)9780818679650
We present a conservative strategy for spatially decomposed parallel discrete event battlefield simulation. The traditional null message algorithm provides a foundation from which a mapping to generic simulation attributes can be made. We informally discuss preservation of logical correctness and freedom from deadlock. Experimental results demonstrate the potential execution time savings when load imbalance is not dominant; more importantly, they highlight improvement opportunities in spite of potential load imbalance. The net result is that a very reasonable performance gain can be delivered for little effort in a way that supports good simulation system design principles. The approach is straightforward and can be easily implemented as part of a more general sequential or parallelsimulation support environment. While the approach is expressed in terms of battlefield simulation, its essence applies to many simulation applications.
The process interaction world view is widely used in the general simulation community for its expressive power, and is supported by most modern simulation languages. In parallel discrete event simulation, however, its...
ISBN:
(纸本)9780818679650
The process interaction world view is widely used in the general simulation community for its expressive power, and is supported by most modern simulation languages. In parallel discrete event simulation, however, its use remains comparatively rare due to the perceived inefficiency (and difficulty) of parallel *** present a new implementation strategy for parallel process-oriented simulation languages. This innovative, semantics-based approach directly addresses two common concerns of such languages. By concentrating on the intrinsic threads of control, we avoid the proliferation of simulation objects (and their associated costs) that might result from a naive translation. More fundamentally, the primary costs associated with process-oriented languages -- those of context switching between stacks and, in an optimistic setting, of saving the state of these stacks -- are entirely eliminated since our explicit use of continuations avoids the need for stacks in the first place. We similarly obtain cheap and natural thread preemption.
This paper studies the problem of load balancing for conservative parallelsimulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load ...
ISBN:
(纸本)9780818679650
This paper studies the problem of load balancing for conservative parallelsimulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra null-messages. We propose a dynamic load balancing algorithm which assumes no compile time knowledge about the workload parameters. It is based upon a process migration mechanism, and the notion of CPU-queue length, which indicates the workload at each *** examine two variations for the algorithm which we refer to as centralized and multi-level hierarchical methods, in the context of queueing network simulation of a torus. The torus was chosen because it of its many cycles aid in the formation of deadlock making it a stress test for any conservative synchronization protocols. Our experiments indicate that our dynamic load balancing schemes significantly reduce the run time of an optimized version of Chandy-Misra null message approach, and decreases by 30-40\% the synchronization overhead when compared to the use of a static partitioning algorithm. Significantly, the results obtained also indicate that the multi-level scheme always outperforms both the centralized load balancing approach and the static partitioning algorithm.
We present a novel approach to parallel discrete event simulation based on the Cilk model of multithreaded computation. Cilk's runtime system not only manages the low-level aspects of program execution, but also p...
ISBN:
(纸本)9780818679650
We present a novel approach to parallel discrete event simulation based on the Cilk model of multithreaded computation. Cilk's runtime system not only manages the low-level aspects of program execution, but also provides the user with an algorithmic model of performance which can be used to predict the execution time of a parallelsimulation. Moreover, a Cilk application can ``scale down'' to run on a single processor with nearly the same performance as that of serial code.A conservative parallel discrete event simulation algorithm has been developed in which communication between logical processes is achieved using Cilk's virtual memory model, dag consistent shared memory. The simulation executes in cycles, where each cycle involves a divide and conquer computation. Although local lookahead information can be exploited, the algorithm is robust in that it also calculates a global simulation time for each cycle. It can therefore be used for applications where zero lookahead may occur.
暂无评论