Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis

Deelman, Ewa; Bargodia, R.; Sakellariou, Rizos; Adve, Vikram

doi:10.1109/pads.2001.924616

Cited by 22 publications

(13 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One promising possibility is to use the compiler estimates of computation times to increase the ''lookahead'' in conservative synchronization algorithms for parallel simulation [15]. By predicting how far ahead one simulation thread will run without performing communication events, other simulation threads can be notified to also simulate further ahead, thus increasing the effective parallelism and therefore the speedup of parallel simulation.…”

Section: Discussionmentioning

confidence: 99%

Compiler-Optimized Simulation of Large-Scale Applications on High Performance Architectures

Adve

Bagrodia

Deelman

et al. 2002

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

Compiler-Optimized Simulation of Large-Scale Applications on High Performance Architectures

Adve

Bagrodia

Deelman

et al. 2002

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…For example, in [35] the authors presented a method where the compiler automatically extracted information about the lookahead present in the application. The lockfree algorithm [36] is another conservative scheduling technique implemented for shared-memory multiprocessor machines, which uses fetch&add operations to avoid the inefficiencies associated with using locks.…”

Section: Variations Of Cmbmentioning

confidence: 99%

Synchronization methods in parallel and distributed discrete-event simulation

Jafer

Liu

Wainer

2013

Simulation Modelling Practice and Theory

View full text Add to dashboard Cite

a b s t r a c tThis work attempts to provide insight into the problem of executing discrete event simulation in a distributed fashion. The article serves as the state of the art in Parallel DiscreteEvent Simulation (PDES) by surveying existing algorithms and analyzing the merits and drawbacks of various techniques. We discuss the main characteristics of existing synchronization methods for parallel and distributed discrete event simulation. The two major categories of synchronization protocols, namely conservative and optimistic, are introduced and various approaches within each category are presented. We also present the latest efforts towards PDES on emerging platforms such as heterogeneous multicore processors, Web services, as well as Grid and Cloud environment.Ó 2012 Elsevier B.V. All rights reserved. Parallel discrete-event simulationWith the computing power and advanced software available today, modeling and simulation has become a cost-effective tool for detailed analysis of a broad array of natural and artificial systems. Parallel and distributed simulation is widely accepted as the technology of choice to speed up large-scale discrete-event simulation and to promote reusability and interoperability of simulation components. Parallel Discrete-Event Simulation (PDES) has received increasing interest as simulations become more time consuming and geographically distributed. A rich literature has already been developed in the last three decades, taking advantage of the increasing availability of highly parallel and distributed computing platforms. It has been several years since the last survey by Perumalla [5] and a refreshed review of the latest developments would be needed for us to ponder new research initiatives, especially on emerging platforms such as many-core processors, Internetscale simulation environments, and cloud-based virtualized infrastructures.In parallel and distributed simulations, the entire simulation task is divided into a set of smaller subtasks with each executed on a different processor or node. Hence, the simulation system is viewed as a collection of concurrent processes, each modeling a different part of the physical system and executing on a dedicated processor in a sequential fashion. These processes communicate with each other by exchanging time-stamped event messages. An event refers to an update to simulation system state at a specific simulation time instant. Throughout the simulation, events arrive at destination processes, and depending on the delivery ordering system of the simulation, they are processed differently. The two commonly used orderings are (1) receive-order and (2) timestamp-order. With the first type, events are delivered to the destination processes when they arrive at the destination. On the other hand, with the timestamp-order, events are delivered in non-decreasing order of their timestamp, requiring runtime checks and buffering to ensure such ordering.1569-190X/$ -see front matter Ó

show abstract

“…MPI-Sim is another parallel simulator developed at UCLA that also focuses on direct execution of MPI-based parallel programs [11]. MPISim uses a conservative execution paradigm, and compiler analysis to enhance lookahead [5]. SimOS is a system simulator that includes both application and system level code [12].…”

Section: Related Workmentioning

confidence: 99%

“…There have been several optimizations using a static analysis of application code proposed for conservative simulators [5]. In this paper we consider optimizations specific to optimistic simulators using reverse execution for instruction-level multi-processor simulations.…”

Section: Introductionmentioning

confidence: 99%

Using Reversible Computation Techniques in a Parallel Optimistic Simulation of a Multi-Processor Computing System

Naborskyy

Fujimoto

2007

21st International Workshop on Principles of Advanced and Distributed Simulation (PADS'07)

View full text Add to dashboard Cite

A study is presented in applying optimistic parallel discrete event simulation techniques using reverse execution to perform instruction-level simulations of distributed memory multi-processor systems. A static program analysis approach is described to optimize pre-processed simulated applications in order to remove certain overheads associated with forward event execution and to enable reversible execution. Reverse execution of floating point operations are also considered. Preliminary performance measurements are presented indicating this approach offers promise in speeding up parallel multi-processor simulations.

show abstract

Improving lookahead in parallel discrete event simulations of large-scale applications using compiler analysis

Abstract: Abstract

Cited by 22 publications

References 16 publications

Compiler-Optimized Simulation of Large-Scale Applications on High Performance Architectures

Compiler-Optimized Simulation of Large-Scale Applications on High Performance Architectures

Synchronization methods in parallel and distributed discrete-event simulation

Using Reversible Computation Techniques in a Parallel Optimistic Simulation of a Multi-Processor Computing System

Contact Info

Product

Resources

About