Proceedings 11th Workshop on Parallel and Distributed Simulation

10-13 June 1997

Filter Results

Displaying Results 1 - 25 of 28
  • Proceedings 11th Workshop on Parallel and Distributed Simulation

    Publication Year: 1997
    Request permission for reuse | PDF file iconPDF (409 KB)
    Freely Available from IEEE
  • A distributed numerical/simulative algorithm for the analysis of large continuous time Markov chains

    Publication Year: 1997, Page(s):4 - 11
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    A distributed algorithm is introduced for the analysis of large continuous time Markov chains (CTMCs) by combining in some sense numerical solution techniques and simulation. CTMCs are described as a set of processes communicating via message passing. The state of a process is described by a probability distribution over a set of reachable states rather than by a single state. Simulation is used t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conservative synchronization in object-oriented parallel battlefield discrete event simulations

    Publication Year: 1997, Page(s):12 - 19
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (973 KB)

    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... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load balancing strategies for conservative parallel simulations

    Publication Year: 1997, Page(s):20 - 28
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1070 KB)

    This paper studies the problem of load balancing for conservative parallel simulations for execution on a multicomputer. The synchronization protocol makes use of Chandy-Misra (1979) 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, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous parallel algorithms for test set partitioned fault simulation

    Publication Year: 1997, Page(s):30 - 37
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (833 KB)

    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 cha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance modeling of the IDES framework

    Publication Year: 1997, Page(s):38 - 45
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (851 KB)

    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 termina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multidimensional study on the feasibility of parallel switch-level circuit simulation

    Publication Year: 1997, Page(s):46 - 54
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (995 KB)

    This paper presents the results of an experimental study to evaluate the effectiveness of multiple synchronization protocols and partitioning algorithms in reducing the execution time of switch-level models of VLSI circuits. Specific contributions of this paper include: parallelizing an existing switch-level simulator such that the model can be executed using conservative and optimistic simulation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The threshold of event simultaneity

    Publication Year: 1997, Page(s):56 - 59
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    We revisit the notion of event simultaneity in the context of parallel and distributed simulation. Although the simulation community has recognized this problem for years, it has focused mainly on the mechanics of breaking event-time ties and has neither measured its extent nor considered its implications. Exant simulators (both serial and parallel) prohibit simultaneity either by user-specified e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed simulation of spatially explicit ecological models

    Publication Year: 1997, Page(s):60 - 63
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    Large-scale ecological simulations are natural candidates for distributed discrete event simulation. In optimistic simulation of spatially explicit models, a difficult problem arises when individuals migrate between physical regions simulated by different logical processes. We present a solution to this problem that uses shared object states. Shared states allow for efficient communication between... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach for partitioning VLSI circuits on transistor level

    Publication Year: 1997, Page(s):64 - 67
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (455 KB)

    For parallel simulation of VLSI circuits on the transistor level a sophisticated partitioning of the circuits into subcircuits is crucial. Each net connecting the subcircuits causes additional communication and computation effort. As the slave processors simulating the subcircuits advance synchronously in time, the computation effort for each subcircuit should be approximately the same. In this pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State saving for interactive optimistic simulation

    Publication Year: 1997, Page(s):72 - 79
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Time Warp's optimistic scheduling requires the maintenance of simulation state history to support rollback in the event of causality violations. State history, and the ability to rollback the simulation, can provide unique functionality for human-in-the-loop simulation environments. This paper investigates the use of Time Warp to output valid simulation state in a near real-time manner, re-execute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SQTW: a mechanism for state-dependent parallel simulation. Description and experimental study

    Publication Year: 1997, Page(s):82 - 89
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (802 KB)

    We address the problem of efficiently performing parallel discrete-event simulation in the case where event elaboration is independent of other processes' local states. We propose a parallel simulation 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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic distributed simulation based on transitive dependency tracking

    Publication Year: 1997, Page(s):90 - 97
    Cited by:  Papers (2)  |  Patents (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (811 KB)

    In traditional optimistic distributed simulation protocols, a logical process (LP) receiving a straggler rolls back and sends out anti-messages. The receiver of an anti-message may also roll back and send out more anti-messages. So a single straggler may result in a large number of anti-messages and multiple rollbacks of some LPs. In the authors' protocol, an LP receiving a straggler broadcasts it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timestamp representations for virtual sequences

    Publication Year: 1997, Page(s):98 - 105
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (839 KB)

    The problem of executing sequential programs in parallel using the optimistic algorithm time warp is considered. This is done by first mapping the sequential execution to a control tree and then assigning timestamps to each node in the tree. For such timestamps to be effective in either hardware or software they must be finite, this implies that they must be periodically rescaled to allow old time... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive flow control in Time Warp

    Publication Year: 1997, Page(s):108 - 115
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (879 KB)

    It is well known that Time Warp may suffer from poor performance due to excessive rollbacks caused by overly optimistic execution. The authors present a simple flow control mechanism using only local information and GVT that limits the number of uncommitted messages generated by a processor, thus throttling overly optimistic TW execution. The flow control scheme is analogous to traditional network... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speculative parallel simulation with an adaptive throttle scheme

    Publication Year: 1997, Page(s):116 - 123
    Cited by:  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Excessive rollback recoveries due to overoptimistic event execution in time warp simulators often degrade their runtime performance. The paper presents a two-sided throttling scheme to dynamically adjust the event execution speed of time warp simulators. The proposed throttle is based on a new concept called global progress window, which allows the individual simulation process to be positioned on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breadth-first rollback in spatially explicit simulations

    Publication Year: 1997, Page(s):124 - 131
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (733 KB)

    The efficiency of parallel discrete event simulations that use the optimistic protocol is strongly dependent on the overhead incurred by rollbacks. The paper introduces a novel approach to rollback processing which limits the number of events rolled back as a result of a straggler or antimessage. The method, called breadth-first rollback (BFR), is suitable for spatially explicit problems where the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using agents for simulating and implementing Petri nets

    Publication Year: 1997, Page(s):134 - 137
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (453 KB)

    The paper presents a software architecture for simulating and implementing Petri nets. It is based on object-oriented techniques and autonomous agents. Object-orientation enables the adaptation and extension of the software architecture with new or alternatively defined features. Agents allow one to model a net as a set of autonomous, cooperating entities. The result is a flexible and extendible f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tolerant synchronization for distributed simulations of interconnected computer networks

    Publication Year: 1997, Page(s):138 - 141
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (429 KB)

    The paper presents the tolerant, hybrid synchronization schema and its benefits for the parallel and distributed simulation of interconnected computer networks. The hybrid schema combines conservative and optimistic synchronization approaches by using lookahead for scheduling special events and using the flexibility of time warp in certain cases. In addition to these classical approaches the intro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a conservative simulator of ATM networks

    Publication Year: 1997, Page(s):142 - 145
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (393 KB)

    The paper describes an implementation of a conservative parallel distributed simulator that has been used to simulate a high fidelity model of ATM networks. Important optimisations of the simulator for this application are described. The performance of the simulator is reported on up to 12 processors and compared with a sequential implementation. It is seen that the simulator gives good speedup an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical modeling and distributed simulation with HIT

    Publication Year: 1997, Page(s):148 - 155
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    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. The authors present concepts for optimistic distributed simulation of HIT models by partitioning them with respect to subhierarchies. The main goals of the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MRE: a flexible approach to multi-resolution modeling

    Publication Year: 1997, Page(s):156 - 163
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (719 KB)

    Multi-resolution representation of simulated entities is considered essential for a growing portion of distributed simulations. Heretofore, modelers have represented entities at just one level of resolution, or have represented concurrent representations in an inconsistent manner. The authors address the question of the cost of maintaining multiple, concurrent representations. They present a brief... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Billiards and related systems on the bulk-synchronous parallel model

    Publication Year: 1997, Page(s):164 - 171
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (893 KB)

    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 co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A workstation-based parallel direct-execution simulator

    Publication Year: 1997, Page(s):174 - 177
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (383 KB)

    It is important to understand and efficiently predict the performance of large codes executing on massively parallel machines. However, these very large machines are scarce, expensive, and generally unavailable to large segments of the research community. It is therefore important to implement performance analysis tools for such machines on platforms that are readily available to the research comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dag consistent parallel simulation: a predictable and robust conservative algorithm

    Publication Year: 1997, Page(s):178 - 181
    Cited by:  Papers (12)  |  Patents (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (427 KB)

    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 parallel simulation. Moreover, a Cilk application can "scale down" to run on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.