a common programming structure for Bryant-Chandy-Misra, time-warp, and sequential simulators

Abrams, Marc D.

doi:10.1145/76738.76823

Cited by 6 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, seminal work by Chandy and Misra [12], Bryant [1], and Jefferson [22] laid the groundwork for parallel discrete event simulation, which was shown to run efficiently on supercomputers [4,5]. Previous traffic simulators that utilize PDES include those by Perumalla [33] and Yoginath [47], who used optimistic PDES for modeling traffic grids, though they evaluated their system on smaller-scale synthetic grid networks and used a different mechanism to mediate congestion among vehicles.…”

Section: Related Workmentioning

confidence: 99%

Simulating the Impact of Dynamic Rerouting on Metropolitan-Scale Traffic Systems

Chan¹,

Kuncheria²,

Macfarlane³

2022

Preprint

View full text Add to dashboard Cite

The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this paper, we describe the Mobiliti traffic simulator, which includes mechanisms to capture congestion delays, timing constraints, and link storage capacity constraints. The simulator is designed to support distributed memory parallel execution and be scalable on high-performance computing platforms. We introduce a method to model dynamic rerouting behavior with the addition of vehicle controller actors and reroute request events. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day of the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present an analysis of system-level impacts when changing the dynamic rerouting penetration rate and examine the varying effects on different functional classes and geographical regions. Finally, we present a validation of the simulation results compared to real world data.

show abstract

Section: Related Workmentioning

confidence: 99%

Simulating the Impact of Dynamic Rerouting on Metropolitan-Scale Traffic Systems

Chan¹,

Kuncheria²,

Macfarlane³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…YAWNS is also related to Abram's common language interface [1], which takes a simulation model and parallelizes it using one of a specified set of synchronization protocols. The testbed developed by Wagner [8] is intended to support development of parallel simulation models on a sharedmemory architecture.…”

Section: Processormentioning

confidence: 99%

Efficient aggregation of multiple PLs in distributed memory parallel simulations

Nicol¹,

Michael²,

Inouye³

1989

Proceedings of the 21st Conference on Winter Simulation - WSC '89

View full text Add to dashboard Cite

The state of research in parallel simulation now demands that we experiment with a multitude of simulation models. It is evident that large-scale simulations involving many interacting logical processes should be a focal point of such experimentation, as large-scale simulations will benefit the most from parallelism. This realization raises a number of issues. Large-scale parallel simulations must aggregate many logical processes onto each machine in a distributed memory architecture. This fact creates internal management problems---how does one synchronize in such a setting? How does one efficiently find and manage the simulation workload? If we are to experiment with multiple models, what underlying functions can we extract to program once, and use many times? This paper describes YAWNS, Yet Another Windowing Network Simulator, for dealing with these problems.

show abstract

A functional approach to simulation programming

Bloss¹

1990 Winter Simulation Conference Proceedings

View full text Add to dashboard Cite

In this paper we explore simulation programming in Haskell, a purely functional language. We show how a simple simulation problem can be modeled in Haskell, and compare the result to four traditional approaches. Functional languages are lowerlevel than some simulation languages, but much higher-level than traditional, general-purpose languages such as C or Pascal. We claim that for modeling at least one class of simulation problems, functional languages are better than other general-purpose languages, and may be as good as many simulation languages.

show abstract

a common programming structure for Bryant-Chandy-Misra, time-warp, and sequential simulators

Cited by 6 publications

References 6 publications

Simulating the Impact of Dynamic Rerouting on Metropolitan-Scale Traffic Systems

Simulating the Impact of Dynamic Rerouting on Metropolitan-Scale Traffic Systems

Efficient aggregation of multiple PLs in distributed memory parallel simulations

A functional approach to simulation programming

Contact Info

Product

Resources

About