By Topic

Parallel and Distributed Simulation, 1995. (PADS'95), Proceedings., Ninth Workshop on (Cat. No.95TB8096)

Date 14-16 June 1995

Filter Results

Displaying Results 1 - 25 of 28
  • Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (20306 KB)
    Freely Available from IEEE
  • Effectiveness of global event queues in rollback reduction and load balancing

    Publication Year: 1995, Page(s):187 - 190
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    Compared to highly optimized optimistic simulators which use local event queues for individual processors on a shared-memory computer, we demonstrate that employing a single global event queue drastically reduces the number of rollbacks, brings down the storage requirements, and achieves superior load balance. On a bus-based Silicon Graphics multiprocessor, these virtues consistently translated in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel and distributed simulation of free choice Petri nets

    Publication Year: 1995, Page(s):3 - 10
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The ultimate bead counter: efficient massively parallel simulation of ballistic deposition

    Publication Year: 1995, Page(s):95 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XTracker, a graphical tool for parallel simulations

    Publication Year: 1995, Page(s):191 - 194
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    A Motif based graphical tool XTracker is described. XTracker can show Gannt-like charts of the activities on each node or it can show the event messages as traffic between simulation objects. XTracker can take its data from sequential simulation runs and simulate a parallel execution under a number of simulation methods. XTracker can act as a performance modeling tool View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for speculative parallel execution of rendezvous-synchronized simulation

    Publication Year: 1995, Page(s):11 - 20
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    This paper presents an approach for speculative parallel execution of rendezvous-synchronized simulations. Rendezvous-synchronized simulation is based on the notions of processes and gates and on the rendezvous mechanism, defined in the basic process algebra of LOTOS-a standard formal specification language for temporal ordering. Time is introduced via a mechanism similar to the delay behaviour an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic adaptive direct optimism control in time warp

    Publication Year: 1995, Page(s):120 - 129
    Cited by:  Papers (43)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel discrete-event simulation (PDES): a case study in design, development, and performance using SPEEDES

    Publication Year: 1995, Page(s):103 - 110
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Can parallel simulations efficiently exploit a network of workstations? Why haven't PDES models followed standard modeling methodologies? Will the field of PDES survive, and if so, in what form? Researchers in the PDES field have addressed these questions and others in a series of papers published in the last few years. The purpose of this paper is to shed light on these questions, by documenting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed simulation with locality

    Publication Year: 1995, Page(s):195 - 198
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast asynchronous GVT algorithm for shared memory multiprocessor architectures

    Publication Year: 1995, Page(s):203 - 208
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The computation of Global Virtual Time is of fundamental importance in Time Warp based Parallel Discrete Event Simulation Systems. Shared memory multiprocessor architectures can support interprocess communication with much smaller overheads than distributed memory systems. This paper presents a new, completely asynchronous, Gvt algorithm which provides very fast and accurate Gvt estimation with si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel gate-level circuit simulation on shared memory architectures

    Publication Year: 1995, Page(s):170 - 174
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance predictions for parallel diagonal-implicitly iterated Runge-Kutta methods

    Publication Year: 1995, Page(s):21 - 28
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative analysis of periodic state saving techniques in time warp simulators

    Publication Year: 1995, Page(s):50 - 58
    Cited by:  Papers (51)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Checkpointing in a time warp synchronized parallel simulator is a necessary and potentially expensive operation. In the simple case, a time warp simulator checkpoints every χ events, for some fired value χ. For larger values of χ, the simulator requires less overhead for saving the state, but incurs an increased latency during rollback. Thus, the problem is to balance the time to save ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Super-criticality revisited

    Publication Year: 1995, Page(s):130 - 136
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    Critical path analysis has been suggested as a technique for establishing a lower bound on the completion times of parallel discrete event simulations. A protocol is super-critical if there is at least one simulation that can complete in less than the critical path time using that protocol. Previous studies have shown that several practical protocols are super-critical while others are not. We pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioning for synchronous parallel simulation

    Publication Year: 1995, Page(s):181 - 184
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    A new partitioning method for synchronous PDES simulations is proposed. The method exploits characteristics of both the simulation method and of the application domain to arrive at efficient partitionings. A performance study shows that the method outperforms existing partitioning methods in terms of four different performance metrics View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A case study in simulating PCS networks using time warp

    Publication Year: 1995, Page(s):87 - 94
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    There has been rapid growth in the demand for mobile communications over the past few years. This has led to intensive research and development efforts for complex PCS (personal communication service) networks. Capacity planning and performance modeling is necessary to maintain a high quality of service to the mobile subscriber while minimizing cost to the PCS provider. The need for flexible analy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustered time warp and logic simulation

    Publication Year: 1995, Page(s):112 - 119
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction of memory consumption in conservative parallel simulation

    Publication Year: 1995, Page(s):199 - 202
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    This paper proposes a critical path-like analyzer to predict the amount of memory consumed in a specific Chandy-Misra simulation: Segments of code are inserted into the existing sequential simulation program, and this modified simulation program is called a memory analyzer. The amount of memory needed in the corresponding Chandy-Misra simulation is computed along with the execution of the memory a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Empirical study of parallel trace-driven LRU cache simulators

    Publication Year: 1995, Page(s):166 - 169
    Cited by:  Papers (4)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    This paper reports on the performance of four parallel algorithms for simulating an associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are implemented on the MasPar MP-2. Another algorithm is a parallelization of an efficient serial algorithm on the Intel Paragon. We assess the strengths and weaknesses of these algorithms as a function of pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The treatment of state in optimistic systems

    Publication Year: 1995, Page(s):40 - 49
    Cited by:  Papers (18)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    Optimistic computation methods typically save copies of objects' state information, so that they can recover from erroneous `over-optimistic' computations. Such state saving is generally time and space consuming, and can be rather complicated both to implement and to use. I show how the data structure community's theory of persistence can be used not only to analyse and explain the treatment of st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load balancing of a multi-cluster simulator on a network of workstations

    Publication Year: 1995, Page(s):175 - 180
    Cited by:  Papers (33)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Performance of Time Warp simulation systems are often measured on exclusively available parallel computing resources. In distributed systems exclusive use is normally not feasible. Instead, due to the multi-tasking operating systems, many users share the workstations and their availability for parallel simulation purposes varies extensively. Time Warp has been found to be very sensitive to variati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved cost function for static partitioning of parallel circuit simulations using a conservative synchronization protocol

    Publication Year: 1995, Page(s):78 - 85
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicting the future: resource requirements and predictive optimism

    Publication Year: 1995, Page(s):157 - 164
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The partitioning of systems for parallel simulation is a complex task, requiring consideration of both computational load requirements and communications activity. Typically, this information is not accurately known prior to execution. This paper investigates the use of historical information for the prediction of future requirements, both for computation and communications. In addition, for optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory management techniques for time warp on a distributed memory machine

    Publication Year: 1995, Page(s):30 - 39
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    This paper examines memory management issues associated with time warp synchronized parallel simulation on distributed memory machines. The paper begins with a summary of the techniques which have been previously proposed for memory management on various parallel processor memory structures. It then concentrates the discussion on parallel simulation executing on a distributed memory computer-a sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SGTNE: semi-global time of the next event algorithm

    Publication Year: 1995, Page(s):68 - 77
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlock inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps ... View full abstract»

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