Performance Bounds on Parallel Self-Initiating Discrete-Event

Abstract

This paper considers the use of massively parallel architectures to execute discrete-event simulations of what we term self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. Our interest is in the effects of that communication on synchronization. We consider the performance of various synchronization protocols by deriving upper and lower bounds on the performance of a new conservative protocol. Our analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation. (Author) (kr)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1990
Accession Number
ADA227191

Entities

People

  • David M. Nicol

Tags

Communities of Interest

  • Cyber
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Computations
  • Computer Science
  • Computers
  • Computing System Architectures
  • Convolution
  • Distribution Functions
  • Engineering
  • Network Simulation
  • Probability
  • Probability Distributions
  • Random Variables
  • Scheduling (Production)
  • Simulations
  • Stationary Processes
  • Statistics
  • Stochastic Processes
  • Test And Evaluation

Readers

  • Parallel and Distributed Computing.
  • Statistical inference.
  • Theoretical Analysis.