Two Processor Conservative Simulation Analysis

Abstract

We present some new models and their exact analysis for the problem of two processors running a conservative distributed simulation protocol. The models show that lookahead is very useful in gaining performance, but only if the processors are well balanced in processing capacity. The models allow quantitative evaluation of the improvement in speedup attributed to null messages, as well as the degradation due to a cost for breaking deadlocks. Finally, a conservative system with 'free' null messages and a small amount of lookahead is shown to outperform a Time Warp system with no cost for state saving or rollback.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1992
Accession Number
ADA257814

Entities

People

  • Leonard Kleinrock
  • Robert E. Felderman

Organizations

  • University of Southern California

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Case Studies
  • Computer Science
  • Computer Simulations
  • Computers
  • Contracts
  • Engineering
  • Equations
  • Information Science
  • Markov Chains
  • Markov Processes
  • Probability
  • Security
  • Simulations
  • Software Development
  • Test And Evaluation

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Parallel and Distributed Computing.
  • Phased Array Antenna Design.