By Topic

Parallel and Distributed Simulation, 2001. Proceedings. 15th Workship on

Date 15-18 May 2001

Filter Results

Displaying Results 1 - 24 of 24
  • Proceedings 15th Workshop on Parallel and Distributed Simulation [front matter]

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (173 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 208
    Request permission for commercial reuse | PDF file iconPDF (49 KB)
    Freely Available from IEEE
  • A causality based time management mechanism for federated simulation

    Publication Year: 2001, Page(s):83 - 90
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB) | HTML iconHTML

    One of the six categories of management services provided in the Run Time Infrastructure (RTI) to federated simulations is time management. Currently, it provides only two message ordering policies, that is, time stamp ordering and receipt ordering. Temporal anomalies occurring during the execution of federation due to the heterogeneous latencies in the communication network are not handled in rec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The dependence list in time warp

    Publication Year: 2001, Page(s):35 - 45
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB) | HTML iconHTML

    Time Warp is known for its ability to maximize the exploitation of the parallelism inherent in a simulation. However, this potential has been undermined by the cost of processing causality violations. Minimizing this cost has been one of the most challenging issues facing Time Warp. In this paper, we present dependence list cancellation, a direct cancellation technique for Time Warp which is inten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual time synchronization over unreliable network transport

    Publication Year: 2001, Page(s):129 - 136
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB) | HTML iconHTML

    In parallel and distributed simulations, it is sometimes desirable that the application's time-stamped events and/or the simulator's time-management control messages be exchanged over a combination of reliable and unreliable network channels. A challenge in developing infrastructure for such simulations is to correctly compute simulation time advances despite the loss of some simulation events and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatio-temporal correlations and rollback distributions in optimistic simulations

    Publication Year: 2001, Page(s):145 - 152
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    In this paper we study the influence of spatio-temporal correlations on the dynamic runtime behavior of the optimistic parallel Time Warp simulation method. By using the Ising spin model, we show experimentally that the distribution of the number of rolled back events behaves as a power-law distribution over a large range of sub-critical Ising temperatures and decays exponentially or super-critica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical federations: an architecture for information hiding

    Publication Year: 2001, Page(s):67 - 74
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB) | HTML iconHTML

    In a distributed simulation, simulation components of various types are executed at geographically different locations, forming a simulation federation to create a common virtual environment. Under the High Level Architecture (HLA), information that will be produced and consumed by a simulation component is defined in its object model, and how that information is produced and consumed is well enca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic simulation of parallel message-passing applications

    Publication Year: 2001, Page(s):173 - 181
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    Optimistic techniques can improve the performance of discrete-event simulations, but one area where optimistic simulators have been unable to show performance improvement is in the simulation of parallel programs. Unfortunately, parallel program simulation using direct execution is difficult: the use of direct execution implies that the memory and computation requirements of the simulator are at l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistent modeling of distributed mutual exclusion protocol using optimistic simulation

    Publication Year: 2001, Page(s):137 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB) | HTML iconHTML

    This paper discusses the problem of risk in optimistic simulation protocols, using as an example, simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augmented to detect model inconsistency errors resulting from risky optimistic simulation. While the model runs sequentially without consistency errors, errors occur when the model is exec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning not to share [large-scale discrete event simulation]

    Publication Year: 2001, Page(s):46 - 55
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB) | HTML iconHTML

    Strong reasons exist for executing a large-scale discrete-event simulation on a cluster of processor nodes (each of which may be a shared-memory multiprocessor or a uniprocessor). This is the architecture of the largest scale parallel machines, and so the largest simulation problems can only be solved this way. It is a common architecture even in less esoteric settings, and is suitable for memory-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scaled version of the elastic time algorithm

    Publication Year: 2001, Page(s):157 - 164
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB) | HTML iconHTML

    Recently a new class of synchronization algorithms for parallel discrete event simulation has been proposed, namely the near perfect state information algorithms, which are based on a motion of error potential to control the optimism of event execution. An algorithm of this class, called elastic time algorithms (ETA), has been instantiated. In this algorithm, the error potential is computed using ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical parallel simulation applied to aviation modeling

    Publication Year: 2001, Page(s):109 - 116
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB) | HTML iconHTML

    The paper analyzes the Detailed Policy Assessment Tool (DPAT) as an example of a practical real-world aviation simulation that uses optimistic simulation technology. We present a review of analyses that have used DPAT results to support their conclusions, and discuss the design and performance of the system in the context of parallel simulations. The thrust of the paper is to explain how DPAT avoi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using quad trees for parallelizing conflict detection in a sequential simulation

    Publication Year: 2001, Page(s):117 - 123
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    The paper describes a parallel proximity detection algorithm and illustrates its application to the problem of conflict detection in an aviation simulation. The algorithm invokes a previously designed sequential function in parallel, using spatial information acquired during the traversal of a quad tree, to keep the separate invocations of the function as independent as possible. The method is gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis

    Publication Year: 2001, Page(s):5 - 13
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB) | HTML iconHTML

    This paper addresses the issue of efficient and accurate performance prediction of large-scale message-passing applications on high performance architectures using simulation. Such simulators are often based on parallel discrete event simulation, typically using the conservative protocol to synchronize the simulation threads. The paper considers how a compiler can be used to automatically extract ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based DDM for High Level Architecture

    Publication Year: 2001, Page(s):75 - 82
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    The Data Distribution Management (DDM) service is one of the six services provided in the Runtime Infrastructure (RTI) of High Level Architecture (HLA). Its purpose is to perform data filtering and reduce irrelevant data communicated between federates. The two DDM schemes proposed for RTI, region based and grid based DDM, are oriented to send as little irrelevant data to subscribers as possible, b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronous relaxation for parallel Ising spin simulations

    Publication Year: 2001, Page(s):185 - 192
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB) | HTML iconHTML

    A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike other optimistic algorithms, e.g., Time Warp, our algorithm is synchronous. It also belongs to the class of simulations known as “relaxation”;... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic performance model for conservative simulation protocol

    Publication Year: 2001, Page(s):200 - 207
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB) | HTML iconHTML

    Extensive research has been conducted on the performance of simulation systems. In this paper, a performance analysis of the conservative parallel simulation protocol is presented. We analyzed several performance factors for the conservative simulation of a model with an arbitrary number of logical processes. The analysis probabilistically identifies the critical path in a conservative model, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-asynchronous checkpointing for optimistic simulation on a Myrinet based NOW

    Publication Year: 2001, Page(s):56 - 63
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    Great effort has been devoted to the design of optimized checkpointing strategies for optimistic parallel discrete event simulators. On the other hand, there is less work being done in the direction of improving the execution mode of any single checkpoint operation. Specifically, checkpoint operations are typically charged to the CPU, thus leading to freezing of the simulation application while ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The resource sharing system: dynamic federate mapping for HLA-based distributed simulation

    Publication Year: 2001, Page(s):91 - 98
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    Networks of workstations have become a popular architecture for distributed simulation due to their high availability as opposed to specialized multiprocessor computers. Networks of workstations are also a well-suited framework for distributed simulation systems based on the High Level Architecture (HLA). However using workstations in a distributed simulation system may eventually affect the avail... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lock-free scheduling of logical processes in parallel simulation

    Publication Year: 2001, Page(s):22 - 31
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB) | HTML iconHTML

    With fixed lookahead information in a simulation model, the overhead of asynchronous conservative parallel simulation lies in the mechanism used for propagating time updates in order for logical processes to safely advance their local simulation clocks. Studies have shown that a good scheduling algorithm should preferentially schedule processes containing events on the critical path. This paper in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speedup of a sparse system simulation

    Publication Year: 2001, Page(s):193 - 199
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB) | HTML iconHTML

    Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterised by the ratio of output... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel object-oriented manufacturing simulation language

    Publication Year: 2001, Page(s):101 - 108
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB) | HTML iconHTML

    When used to simulate manufacturing systems, most existing parallel simulation languages cannot easily implement some features of those systems, such as the scheduling rules of a machine or the sharing of operators by multiple machines. The paper presents the design and implementation of a parallel object oriented manufacturing simulation language, called POMSim. A POMSim simulation is developed b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Looking ahead of real time in hybrid component networks

    Publication Year: 2001, Page(s):14 - 21
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB) | HTML iconHTML

    While network simulation is a wider used technique for developing, testing and evaluating network protocols and applications, it is difficult and time-consuming to develop detailed models of the entire protocol stack and the application that is being evaluated. Hybrid component networks combine simulation models of protocols and applications with physical implementations of other protocols and/or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causality representation and cancellation mechanism in time warp simulations

    Publication Year: 2001, Page(s):165 - 172
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    The Time Warp synchronization protocol allows causality errors and then recovers from them with the assistance of a cancellation mechanism. Cancellation can cause the rollback of several other simulation objects that may trigger a cascading rollback situation where the rollback cycles back to the original simulation object. These cycles of rollback can cause the simulation to enter an unstable (or... View full abstract»

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