Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
ACM SIGSIM Simulation Digest
ACM Press
  1-10 of 13 reviews Date Reviewed 
  Parallel independent replicated simulation on a network of workstations
Lin Y. (ed)  ACM SIGSIM Simulation Digest 24(1): 73-80, 1994. Type: Article

Parallel simulation refers to the execution of a single simulation on multiple cooperating processors. In this setting, speedup is measured relative to the execution time of the same simulation on a single processor. Lin adopts a more holistic, an...

Dec 1 1995
  Parallel discrete event simulation: a modeling methodological perspective
Page E., Nance R.  ACM SIGSIM Simulation Digest 24(1): 88-93, 1994. Type: Article

The future suitability of simulation as a viable tool to analyze large, complex, and elaborate systems relies on the concurrent execution of the simulation program in parallel or distributed multiprocessing environments. In the last 15 years, rese...

Sep 1 1995
  A unified framework for conservative and optimistic distributed simulation
Jha V., Bagrodia R.  ACM SIGSIM Simulation Digest 24(1): 12-19, 1994. Type: Article

Parallel and distributed discrete-event simulation has been a fruitful field of research over the last 15 years, mainly focusing on developing protocols to synchronize simulation processes so that the results are logically correct--that is, e...

Aug 1 1995
  Cooperative acceleration
Blanchard T., Lake T., Turner S.  ACM SIGSIM Simulation Digest 24(1): 58-64, 1994. Type: Article

Conservative protocols for distributed discrete event simulation are strongly dependent on the ability to identify good lookaheads, that is, intervals in simulation time during which it can be guaranteed that no event-carrying message can be gener...

Jul 1 1995
  Understanding supercritical speedup
Gunter M.  ACM SIGSIM Simulation Digest 24(1): 81-87, 1994. Type: Article

The author characterizes the speedup of parallel discrete event simulation (PDES) programs relative to their concomitant critical path estimations. The ability of a parallel implementation to outperform the critical path is related to the level of...

Jun 1 1995
  Stability of event synchronisation in distributed discrete event simulation
Kumar A., Shorey R.  ACM SIGSIM Simulation Digest 24(1): 65-72, 1994. Type: Article

Distributed synchronization protocols ensure the temporal consistency of logical processes in a simulation. Conservative protocols insist that messages be processed in strict message arrival order. Kumar and Shorey prove that the message queues of...

Jun 1 1995
  Discrete-event simulation and the event horizon
Steinman J.  ACM SIGSIM Simulation Digest 24(1): 39-49, 1994. Type: Article

The concept of an event horizon originated in cosmology. It describes the boundary of the region in space-time from which neither matter nor energy can escape. This concept has been adapted to discrete-event simulation in order to accelerate the p...

May 1 1995
  pGVT: an algorithm for accurate GVT estimation
D’Souza L., Fan X., Wilsey P.  ACM SIGSIM Simulation Digest 24(1): 102-109, 1994. Type: Article

A global virtual time (GVT) estimation algorithm, called pGVT, is designed for time warp systems that operate in an environment where reliable and first in, first out message delivery is not guaranteed. As a result, pGVT relies on message acknowle...

May 1 1995
  Efficient distributed simulation
Madisetti V. (ed), Walrand J. (ed), Messerschmitt D.  ACM SIGSIM Simulation Digest 20(1): 5-21, 1989. Type: Article

The authors inform us that a simulation distributed over several processors will perform differently depending on the way in which its parts are mapped onto the processors. They state further that efficiency can be gained if the loads on each proc...

Oct 1 1990
  An algorithm for parallel discrete event simulation using common memory
Cota B., Sargent R.  ACM SIGSIM Simulation Digest 20(1): 23-31, 1989. Type: Article

Many distributed and parallel discrete-event simulation algorithms assume that processes only communicate through message passing. Cota and Sargent, in contrast, assume the existence of shared memory, permitting one process to cheaply access the s...

Aug 1 1990
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy