No abstract available.
Committees
Reviewers
PADS Past Chairs
Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis
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, ...
Looking ahead of real time in Hybrid component networks
While network simulation is a widely 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 ...
Lock-free scheduling of logical processes in parallel simulation
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. ...
The dependence list in time warp
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 ...
Learning not to share
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 ...
Semi-asynchronous checkpointing for optimistic simulation on a Myrinet based NOW
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 in the direction to improve the execution mode of any single checkpoint operation. ...
Hierarchical federations: an architecture for information hiding
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 ...
An agent-based DDM for high level architecture
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. ...
A causality based time management mechanism for federated simulation
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 receive ordering. ...
The resource sharing system: dynamic federate mapping for HLA-based distributed simulation
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 ...
A parallel object-oriented manufacturing simulation language
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. This paper ...
Practical parallel simulation applied to aviation modeling
This 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 ...
Using quad trees for parallelizing conflict detection in a sequential simulation
This 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 ...
Virtual time synchronization over unreliable network transport
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 ...
Consistent modeling of distributed mutual exclusion protocol using optimistic simulation
This paper discusses the problem of risk in optimistic simulation protocols, using as example simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augmented to detect model inconsistency ...
Spatio-temporal correlations and rollback distributions in optimistic simulations
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 ...
A scaled version of the elastic time algorithm
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 notion of error potential to control the optimism of event execution. ...
Causality representation and cancellation mechanism in time warp simulations
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 ...
Optimistic simulation of parallel message-passing applications
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 ...
Synchronous relaxation for parallel Ising spin simulations
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm [2], which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is optimistic. Unlike ...
Speedup of a sparse system simulation
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 ...
A probabilistic performance model for conservative simulation protocol
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 ...
Author Index
Index Terms
Proceedings of the fifteenth workshop on Parallel and distributed simulation
Recommendations
Acceptance Rates
| Year | Submitted | Accepted | Rate |
|---|---|---|---|
| SIGSIM-PADS '19 | 25 | 13 | 52% |
| SIGSIM-PADS '18 | 46 | 15 | 33% |
| SIGSIM PADS '15 | 60 | 35 | 58% |
| SIGSIM PADS '14 | 33 | 19 | 58% |
| SIGSIM PADS '13 | 75 | 29 | 39% |
| PADS '08 | 52 | 21 | 40% |
| PADS '07 | 37 | 24 | 65% |
| PADS '06 | 43 | 21 | 49% |
| PADS '05 | 46 | 30 | 65% |
| PADS '03 | 33 | 20 | 61% |
| PADS '02 | 29 | 19 | 66% |
| PADS '01 | 31 | 21 | 68% |
| PADS '00 | 36 | 19 | 53% |
| PADS '99 | 38 | 19 | 50% |
| PADS '98 | 39 | 21 | 54% |
| PADS '97 | 47 | 27 | 57% |
| PADS '96 | 43 | 18 | 42% |
| PADS '94 | 66 | 27 | 41% |
| Overall | 779 | 398 | 51% |


