Proceedings Thirteenth Workshop on Parallel and Distributed Simulation. PADS 99. (Cat. No.PR00155)

1-4 May 1999

Filter Results

Displaying Results 1 - 23 of 23
  • Proceedings Thirteenth Workshop on Parallel and Distributed Simulation. PADS 99. (Cat. No.PR00155)

    Publication Year: 1999
    Request permission for reuse | PDF file iconPDF (413 KB)
    Freely Available from IEEE
  • Beyond speedup: PADS, the IILA and web-based simulation

    Publication Year: 1999, Page(s):2 - 9
    Cited by:  Papers (2)
    Request permission for reuse | PDF file iconPDF (81 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path lookahead: a data flow view of PDES models

    Publication Year: 1999, Page(s):12 - 19
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (130 KB)

    The performance of parallel discrete event simulation protocols is heavily dependent on the lookahead of the simulation model. Identifying and expressing correct lookahead for a model is not easy, nor is it a well-defined process. A global view of a PDES model as a set of data flows is presented. Using this view, we show how the lookahead of the model can be optimized, and we present various simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling critical channels in conservative parallel discrete event simulation

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

    This paper introduces the Critical Channel Traversing (CCT) algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general conservative algorithm that is aimed at the simulation of low-granularity network models on shared-memory multiprocessor computers. An implementation of the CCT algorithm within a kernel called TasKit has demonstrated excelle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Case study: parallelizing a sequential simulation model

    Publication Year: 1999, Page(s):29 - 36
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (83 KB)

    Most successful examples of parallel simulation models were developed for parallel execution, from the beginning. A number of simulation models are designed only for sequential simulation, even in languages like PARSEC, that support both sequential and parallel simulation algorithms. Converting such simulation models to a form that yields good performance with a parallel implementation can be non-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On event ordering in parallel discrete event simulation

    Publication Year: 1999, Page(s):38 - 45
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (70 KB)

    Ordering of simultaneous events in DES is an important issue as it has an impact on modelling expressiveness, model correctness as well as causal dependencies. In sequential DES this is a problem which has attracted much attention over the years and most systems provide the user with tools to deal with such issues. This has also attracted some attention within the PDES community and we present an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting temporal uncertainty in parallel and distributed simulations

    Publication Year: 1999, Page(s):46 - 53
    Cited by:  Papers (45)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (81 KB)

    Parallel discrete event simulation algorithms are usually based on time stamp ordering of events. Distributed virtual environment (DVE) applications such as DIS typically use unordered event delivery. A partial order called approximate time (AT) is proposed to order events in both domains, facilitating reuse of simulations across DVE and analysis applications. A variation on AT-order called approx... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GVT and scheduling in space time memory based techniques

    Publication Year: 1999, Page(s):54 - 61
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (118 KB)

    We present two GVT computation algorithms for PDES techniques with event based activities, relying on a space-time memory abstraction. Algorithm 2 involves a modification in the activity control, and is based on an epoch coloring scheme. The effect of the modification is assessed through an experimental study on a simulator implemented in the Linda coordination language. Experiments are performed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The High Level Architecture and beyond: technology challenges

    Publication Year: 1999, Page(s):64 - 70
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (57 KB)

    The High Level Architecture (HLA) provides the specification of a software architecture for distributed simulation. The baseline definition of the HLA includes the HLA Rules, The HLA Interface Specification, and the HLA Object Model Template. The HLA Rules are a set of 10 basic rules that define the responsibilities and relationships among the components of an HLA federation. The HLA Interface Spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience in retrofitting a large sequential Ada simulator to two versions of time warp

    Publication Year: 1999, Page(s):74 - 81
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (78 KB)

    The Extended Air Defense Testbed (EADTB), is a comprehensive, high- and mixed-level-of-detail, environment for modeling weapon system entities and interactions. Due to the complexity of the models and large scenario sizes, in its current single-threaded form, EADTB is limited in run-time speed. Our goal is to speed up the simulation without re-architecture or re-implementation of the models which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An auto-adaptive dead reckoning algorithm for distributed interactive simulation

    Publication Year: 1999, Page(s):82 - 89
    Cited by:  Papers (20)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (253 KB)

    This paper describes a new, auto-adaptive algorithm for dead reckoning in DIS. In general dead-reckoning algorithms use a fixed threshold to control the extrapolation errors. Since a fixed threshold cannot adequately handle the dynamic relationships between moving entities, a multi-level threshold scheme is proposed. The definition of threshold levels is based on the concepts of area of interest (... View full abstract»

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

    Publication Year: 1999, Page(s):92 - 100
    Cited by:  Papers (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    In an attempt to cope with time-varying workload, traditional adaptive time warp protocols are designed to react in response to performance changes by altering control parameter configurations, like the amount of available memory, the size of the checkpointing interval, the frequency of GVT computation, fossil collection invocations, etc. We call those schemes "reactive" because all control decisi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On learning algorithms and balancing loads in Time Warp

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

    We present an algorithm which integrates flow control and dynamic load balancing in order to improve the performance and stability of Time Warp. The algorithm is intended for use in a distributed memory environment such as a cluster of workstations connected by a high speed switch. Our flow control algorithm makes use of stochastic learning automata and operates in the fashion of the leaky-bucket ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining periodic and probabilistic checkpointing in optimistic simulation

    Publication Year: 1999, Page(s):109 - 116
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (142 KB)

    This paper presents a checkpointing scheme for optimistic simulation which is a mixed approach between periodic and probabilistic checkpointing. The latter based on statistical data collected during the simulation, aims at recording as checkpoints states of a logical process that have high probability to be restored due to rollback (this is done in order to make those states immediately available)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast-software-checkpointing in optimistic simulation: embedding state saving into the event routine instructions

    Publication Year: 1999, Page(s):118 - 125
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (145 KB)

    We present a software approach, namely fast-software-checkpointing (FSC), to reduce the running time of the state saving protocol in optimistic parallel discrete event simulation. The idea behind FSC is to use the instructions performed during the execution of an event as part of the state saving protocol, hence the total number of instructions due to state saving is reduced. Under FSC the time fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient optimistic parallel simulations using reverse computation

    Publication Year: 1999, Page(s):126 - 135
    Cited by:  Papers (18)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    In optimistic parallel simulations, state-saving techniques have been traditionally used to realize rollback. We propose reverse computation as an alternative approach, and compare its execution performance against that of state-saving. Using compiler techniques, we describe an approach to automatically generate reversible computations, and to optimize them to transparently reap the performance be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimism: not just for event execution any more

    Publication Year: 1999, Page(s):136 - 143
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (251 KB)

    Optimism is a technique used by the Time Warp paradigm to make decisions about event execution under uncertainty. While the benefits of throttling the optimism of Time Warp have been studied, the benefits of extending optimism to operations besides event execution are presented. Specifically, we discuss how optimism can be mapped to fossil collection which has traditionally been assumed to be a no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction tools for parallel discrete-event simulation

    Publication Year: 1999, Page(s):148 - 155
    Cited by:  Papers (6)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (111 KB)

    We have developed a set of performance prediction tools which help to estimate the achievable speedups from parallelizing a sequential simulation. The tools focus on two important factors in the actual speedup of a parallel simulation program: the simulation protocol used; and the inherent parallelism in the simulation model. The first two tools are a performance/parallelism analyzer for a conserv... View full abstract»

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

    Publication Year: 1999, Page(s):156 - 164
    Cited by:  Papers (17)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (115 KB)

    There are at least three major obstacles thwarting widespread adoption of parallel discrete-event simulation: lack of need; lack of tools; and lack of predictability in behavior and performance. The plain truth is that most simulation studies can be adequately done on ordinary serial computers. Parallel simulation tools are products of research efforts, and simply do not stand up to the demands of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting model independence for parallel PCS network simulation

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

    We present a parallel simulator (SWiMNet) for PCS networks using a combination of optimistic and conservative paradigms. The proposed methodology exploits event precomputation permitted by model independence within the PCS components. The low percentage of blocked calls is exploited in the channel allocation simulation of precomputed events by means of an optimistic approach. Experiments were cond... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time Warp simulation on clumps

    Publication Year: 1999, Page(s):174 - 181
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (233 KB)

    Traditionally, parallel discrete-event simulators based on the Time Warp synchronization protocol have been implemented using either the shared memory programming model or the distributed memory, message passing programming model. This was because the preferred hardware platform was either a shared memory multiprocessor workstation or a network of uniprocessor workstations. However, with the adven... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Active Virtual Network Management Protocol

    Publication Year: 1999, Page(s):182 - 192
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    This paper introduces a novel algorithm, the Active Virtual Network Management Protocol (AVNMP), for predictive network management. It explains how the Active Virtual Network Management Protocol facilitates the management of an active network by allowing future predicted state information within an active network to be available to network management algorithms. This is accomplished by coupling id... View full abstract»

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

    Publication Year: 1999, Page(s): 193
    Request permission for reuse | PDF file iconPDF (69 KB)
    Freely Available from IEEE