Proceedings Fourteenth Workshop on Parallel and Distributed Simulation

28-31 May 2000

Filter Results

Displaying Results 1 - 23 of 23
  • Proceedings Fourteenth Workshop on Parallel and Distributed Simulation

    Publication Year: 2000
    Request permission for reuse | PDF file iconPDF (549 KB)
    Freely Available from IEEE
  • Advanced distributed simulation: what we learned, where to go next

    Publication Year: 2000
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (7 KB)

    Summary form only given. It has been a little less than ten years since modeling and simulation (M&S) hit the knee on the curve. During these past few years a great deal of marketing of the potential of M&S has occurred, which resulted in a significant influx of funding for research and development (R&D) projects, especially in the area of distributed simulation. One of the significant... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel mixed-technology simulation

    Publication Year: 2000, Page(s):7 - 14
    Cited by:  Patents (1)
    Request permission for reuse | PDF file iconPDF (181 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying parallel discrete event simulation to network emulation

    Publication Year: 2000, Page(s):15 - 22
    Cited by:  Papers (33)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (211 KB)

    The simulation of wide area computer networks is one area where the benefits of parallel simulation have been clearly demonstrated. We present a description of a system that uses a parallel discrete event simulator to act as a high speed network emulator. With this, real Internet Protocol (IP) traffic generated by application programs running on user workstations can interact with modelled traffic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Repeatability in real-time distributed simulation executions

    Publication Year: 2000, Page(s):23 - 32
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (262 KB)

    Real-time distributed simulations, such as on-line gaming or military training simulations are normally considered to be non-deterministic. Analysis of these simulations is therefore difficult depending solely on logging and runtime observations. This paper explores an approach for removing one major source of non-determinism in these simulations, thereby allowing repeatable executions. Specifical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytic performance model for speculative, synchronous, discrete-event simulation

    Publication Year: 2000, Page(s):35 - 44
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Performance models exist that reliably describe the execution time and efficiency of parallel discrete-event simulations executed in a synchronous iterative fashion. These performance models incorporate the effects of processor heterogeneity, other processor load due to shared computational resources, application workload imbalance, and the use of speculative computation. This includes modeling th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slow memory: the rising cost of optimism

    Publication Year: 2000, Page(s):45 - 52
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (182 KB)

    Rapid progress in the design of fast CPU chips has outstripped progress in memory and cache performance. Optimistic algorithms would seem to be more vulnerable to poor memory performance because they require extra memory for state saving and anti-messages. We examine the performance of both optimistic and conservative protocols in controlled experiments to evaluate the effects of memory speed and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ROSS: a high-performance, low memory, modular time warp system

    Publication Year: 2000, Page(s):53 - 60
    Cited by:  Papers (59)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (215 KB)

    We introduce a new time warp system called ROSS: Rensselaer's Optimistic Simulation System. ROSS is an extremely modular kernel that is capable of achieving event rates as high as 1,250,000 events per second when simulating a wireless telephone network model (PCS) on a quad processor PC server. In a head-to-head comparison, we observe that ROSS out performs the Georgia Tech Time Warp (GTW) system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach for federating parallel simulators

    Publication Year: 2000, Page(s):63 - 70
    Cited by:  Papers (20)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (173 KB)

    This paper investigates issues concerning federations of sequential and/or parallel simulators. An approach is proposed for creating federated simulations by defining a global conceptual model of the entire simulation, and then mapping individual entities of the conceptual model to implementations within individual federates. Proxy entities are defined as a means for linking entities that are mapp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safe timestamps and large-scale modeling

    Publication Year: 2000, Page(s):71 - 78
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (183 KB)

    The paper examines issues that recur in consideration of simulation time-stamps, in the context of building very large simulation models from components developed by different groups at different times. A key problem here is "safety", loosely defined to mean that unintended model behavior does not occur due to unpredictable behavior of timestamp generation and comparisons. We revisit the problems ... View full abstract»

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

    Publication Year: 2000
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (35 KB)

    Summary form only given. While the PADS community has traditionally focused on, and done a great job with, the technical aspects of developing simulations that run fast and can be connected to other simulations, it has paid little or no attention to the overall strategies required to produce a marketable, useful, and successful parallel simulation. This lack of market focus has led to many fears o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient distributed simulation of a communication switch with bursty sources and losses

    Publication Year: 2000, Page(s):85 - 92
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (175 KB)

    Algorithms for simulating an ATM switch on a distributed memory multiprocessor are described. These include parallel generation of bursty arrival streams, along with the marking and deleting of lost cells due to buffer overflows. These algorithms increase the amount of computation carried out independently by each processor and reduce the communication between the processors. When the number of ce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing cell-size in grid-based DDM

    Publication Year: 2000, Page(s):93 - 100
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (127 KB)

    In a large scale distributed simulation with thousands of dynamic objects, efficient communication of data among these objects is an important issue. The broadcasting mechanism specified by the Distributed Interactive Simulation (DIS) standards is not suitable for large scale distributed simulations. In the high level architecture (HLA) paradigm, the Runtime Infrastructure (RTI) provides a set of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed, parallel simulation of multiple, deliberative agents

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

    Multi agent systems comprise multiple, deliberative agents embedded in and recreating patterns of interactions. Each agent's execution consumes considerable storage and calculation capacities. For testing multi agent systems, distributed parallel simulation techniques are required that take the dynamic pattern of composition and interaction of multi-agent systems into account. Analyzing the behavi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report

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

    We have parallelized the Iowa Logic Simulator a gate-level fine-grained discrete-event simulator by employing an optimistic algorithm framework based on a global event queue implemented as a parallel heap. The original code and the basic data structures of the serial simulator remained unchanged. Wrapper data structures for the logical processes (gates) and the events are created to allow roll-bac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network aware time management and event distribution

    Publication Year: 2000, Page(s):119 - 126
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (215 KB)

    We discuss new synchronization algorithms for parallel and distributed discrete event simulations (PDES) which exploit the capabilities and behavior of the underlying communications network. Previous work in this area has assumed the network to be a black box which provides a one-to-one, reliable and in-order message passing paradigm. In our work, we utilize the broadcast capability of the ubiquit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locality-preserving load-balancing mechanisms for synchronous simulations on shared-memory multiprocessors

    Publication Year: 2000, Page(s):131 - 138
    Cited by:  Papers (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Many synchronous algorithms have been proposed for parallel and discrete simulations. However the actual performance of these algorithms has been far from ideal, especially when event granularity is small. Barring the case of low parallelism in the given simulation models, one of the main reasons of low speedups is in the uneven load distribution among processors. We present several new locality-p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing for conservative simulation on shared memory multiprocessor systems

    Publication Year: 2000, Page(s):139 - 146
    Cited by:  Papers (14)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (186 KB)

    Load balancing is a crucial factor in achieving good performance for parallel discrete event simulations. We present a load balancing scheme that combines both static partitioning and dynamic load balancing. The static partitioning scheme maps simulation objects to logical processes before simulation starts while the dynamic load balancing scheme attempts to balance the load during runtime. The st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model structure and load balancing in optimistic parallel discrete event simulation

    Publication Year: 2000, Page(s):147 - 154
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (221 KB)

    The concept of strong groups is introduced to describe the structure of simulation models. It is shown that logical processes within strong groups process at approximately the same rate and that different strong groups can progress at different rates. An algorithm based on the rates of the strong groups is presented to balance the load among the physical processors and for flow control. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pre-sampling as an approach for exploiting temporal uncertainty

    Publication Year: 2000, Page(s):157 - 164
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (143 KB)

    We describe an approach to exploit temporal uncertainty in parallel and distributed simulation by utilizing time intervals rather than precise time stamps. Unlike previously published work that proposes new message ordering semantics, our approach is based on conservative, time stamp order execution and enhancing the lookahead of the simulation by pre-drawing random numbers from a distribution tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical study of conservative scheduling

    Publication Year: 2000, Page(s):165 - 172
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    It is well known that the critical path provides an absolute lower bound on the execution time of a conservative parallel discrete event simulation. It stands to reason that optimal execution time can only be achieved by immediately executing each event on the critical path. However, dynamically identifying the critical event is difficult, if not impossible. We examine several heuristics that migh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grain sensitive event scheduling in time warp parallel discrete event simulation

    Publication Year: 2000, Page(s):173 - 180
    Cited by:  Papers (12)  |  Patents (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (219 KB)

    Several scheduling algorithms have been proposed to determine the next event to be executed on a processor in a time warp parallel discrete event simulation. However none of them is specifically designed for simulations where the execution time (or granularity) for different types of events has large variance. We present a grain sensitive scheduling algorithm which addresses this problem. In our s... View full abstract»

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

    Publication Year: 2000, Page(s): 181
    Request permission for reuse | PDF file iconPDF (72 KB)
    Freely Available from IEEE