Results 1  10
of
34
Maisie: A Language for the Design of Efficient Discreteevent Simulations
 IEEE Transactions on Software Engineering
, 1994
"... Maisie is a Cbased discreteevent simulation language that was designed to cleanly separate a simulation model from the underlying algorithm (sequential or parallel) used for the execution of the model. With few modifications, a Maisie program may be executed using a sequential simulation algorithm ..."
Abstract

Cited by 107 (23 self)
 Add to MetaCart
Maisie is a Cbased discreteevent simulation language that was designed to cleanly separate a simulation model from the underlying algorithm (sequential or parallel) used for the execution of the model. With few modifications, a Maisie program may be executed using a sequential simulation algorithm, a parallel conservative algorithm or a parallel optimistic algorithm. The language constructs allow the runtime system to implement optimizations that reduce recomputation and state saving overheads for optimistic simulations and synchronization overheads for conservative implementations. This paper presents the Maisie simulation language, describes a set of optimizations and illustrates the use of the language in the design of efficient parallel simulations. 1 Introduction Distributed (or parallel) simulation refers to the execution of a simulation program on parallel computers. A number of algorithms[25, 10, 11, 21, 20] have been suggested for distributed simulation and many experimental...
Parallel simulation today
 Annals of Operations Research
, 1994
"... ej 4r.,,D I " h",' _ k,) r,m '3'. IC,.4 Z _ O ..."
Abstract

Cited by 77 (16 self)
 Add to MetaCart
ej 4r.,,D I " h",' _ k,) r,m '3'. IC,.4 Z _ O
Selecting the Checkpoint Interval in Time Warp Parallel Simulation
 In Proceedings of the 7th Workshop on Parallel and Distributed Simulation
, 2001
"... In Time Warp parallel simulation, a process executes every message as soon as it arrives. If a message with a smaller timestamp subsequently arrives, the process rolls back its state to the time of the earlier message and reexecutes from that point. ..."
Abstract

Cited by 57 (0 self)
 Add to MetaCart
In Time Warp parallel simulation, a process executes every message as soon as it arrives. If a message with a smaller timestamp subsequently arrives, the process rolls back its state to the time of the earlier message and reexecutes from that point.
Parallel Execution for Serial Simulators
 ACM Transactions on Modeling and Computer Simulation
, 1996
"... This paper describes an approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops submodels with an existing sequentia ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
This paper describes an approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops submodels with an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between submodels; however, the automation requires that any such communication must take a nonzero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of submodels on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian Parallel Simulator), is described, along with performance results on the Intel Paragon and on the IBM SP2. Portions of this paper are reproduced with permission fr...
Computing Global Virtual Time in SharedMemory Multiprocessors
 ACM TRANS. MODEL. COMPUT. SIMUL
, 1997
"... ..."
Transparent Implementation Of Conservative Algorithms In Parallel Simulation Languages
 In Proceedings of the 1993 Winter Simulation Conference
, 1993
"... Parallel discrete event simulation offers significant speedup over the traditional sequential event list algorithm. A number of conservative and optimistic algorithms have been proposed and studied for parallel simulation. We examine the problem of transparent execution of a simulation model using c ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
Parallel discrete event simulation offers significant speedup over the traditional sequential event list algorithm. A number of conservative and optimistic algorithms have been proposed and studied for parallel simulation. We examine the problem of transparent execution of a simulation model using conservative algorithms, and present experimental results on the performance of these transparent implementations. The conservative algorithms implemented and compared include the null message algorithm, the conditionalevent algorithm, and a new algorithm which is a combination of these. We describe how dynamic topology can be supported by conservative algorithms. Language constructs to express lookahead are discussed. Finally, performance measurements on a variety of benchmarks are presented, along with a study of the relationship between model characteristics like lookahead, communication topology and the performance of conservative algorithms. 1 INTRODUCTION Distributed(or parallel) simu...
On the Tradeoff between Time and Space in Optimistic Parallel DiscreteEvent Simulation
, 1992
"... Optimistically synchronized parallel discreteevent simulation is based on the use of communicating sequential processes. Optimistic synchronization means that the processes execute under the assumption that synchronization is fortuitous. Periodic checkpointing of the state of a process allows the p ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
Optimistically synchronized parallel discreteevent simulation is based on the use of communicating sequential processes. Optimistic synchronization means that the processes execute under the assumption that synchronization is fortuitous. Periodic checkpointing of the state of a process allows the process to roll back to an earlier state when synchronization errors occur. This paper examines the effects of varying the frequency of checkpointing on the time and space needed to execute a simulation.
On Extending Parallelism to Serial Simulators
 Institute for Computer
, 1995
"... This paper describes an approach to discrete event simulation modeling that appears to be e�ective for developing portable and e�cient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops submodels using an existing sequential ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
This paper describes an approach to discrete event simulation modeling that appears to be e�ective for developing portable and e�cient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops submodels using an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between submodels; however, the automation requires that any such communication must take a nonzero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of submodels on potentially di�erent processors. A speci�c implementation of this approach, U.P.S. �Utilitarian Parallel Simulator�, is described, along with performance results on the
Devs Formalism And Methodology: Unity Of Conception/Diversity Of Application
 In Proceedings of the 25th Winter Simulation Conference
, 1993
"... DEVS (Discrete Event System Specification) is a general modelling formalism with sound semantics founded on a system theoretic basis. This gives it a claim to be universal for formalisms describing Discrete Event Dynamic Systems (DEDS). This means that any other formalism such as Petri nets, which h ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
DEVS (Discrete Event System Specification) is a general modelling formalism with sound semantics founded on a system theoretic basis. This gives it a claim to be universal for formalisms describing Discrete Event Dynamic Systems (DEDS). This means that any other formalism such as Petri nets, which have become very popular for DEDS control can be embedded in it. Moreover, DEVS extends to the continuous case thus facilitating combined discrete/continuous modelling. The universality of DEVS is significant because it has been implemented in a variety of simulation environments, as extensions of diverse underlying ObjectOriented languages such as CLOS and C++. This gives it not only the power of formal rigor but also the practical capability of application to real world complex systems. The DEVS formalism has associated with it a characteristic abstract simulation engine architecture that can be realized in diverse sequential and parallel/distributed platforms. It is especially suitable fo...
Global Virtual Time Approximation with Distributed Termination Detection Algorithms
, 1991
"... It is shown that distributed termination detection algorithms can be transformed into efficient algorithms to approximate the socalled Global Virtual Time (GVT) of a distributed monotonic computation. Typical instances of such computations are optimistic distributed simulations based on the timewar ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
It is shown that distributed termination detection algorithms can be transformed into efficient algorithms to approximate the socalled Global Virtual Time (GVT) of a distributed monotonic computation. Typical instances of such computations are optimistic distributed simulations based on the timewarp principle. The transformation is exemplified for two termination detection algorithms, namely an algorithm by Dijkstra et al. and a new scheme based on the principle of "sticky flags". The general idea of the transformation is that many termination detection algorithms (viz., one for each possible GVT value) run in parallel. Each algorithm determines a specific lower bound The work of H. Mehl is supported by the German National Science Foundation (Deutsche Forschungsgemeinschaft) under grant SPP322671. y The work of A.A. Schoone and G. Tel is supported by the ESPRIT II Basic Research Actions Program of the EC under contract no. 3075 (project ALCOM). on the current GVT value. In a ...