Timed Event-Graph and Performance Evaluation of Systems,

Abstract

Performance analysis of Timed Event-Graphs, including both deterministic and random models, is considered. First, a bound to the average firing rate in steady-state is given. This bound is computed using the critical circuits of the net, for which the average cycle time is maximal. The second results deals with an extended deterministic model, in which the transition processing times are a function of the number of firing repetitions. A fast and simple algorithm is described that determines the earliest firing schedule.

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA176930

Entities

People

  • Alexander H. Levis
  • Herve P. Hillion

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Firing Rate
  • Steady State
  • Test And Evaluation

Readers

  • Electrical Engineering
  • Mathematical Modeling and Probability Theory.
  • Operations Research