Parallel program performance prediction using deterministic task graph analysis

Vikram S. Adve, Mary K. Vernon

Research output: Contribution to journalReview article

Abstract

The techniques for predicting detailed performance characteristics of a single shared memory parallel program were discussed. A deterministic task graph analysis was developed that provided detailed performance prediction for shared-memory programs with arbitary task graps. The model assumed the deterministic task execution times and was evaluated in three ways. The results show that the technique is accurate and efficient for a variety of shared-memory programs, and the deterministic assumption is crucial to permit accurate and efficient analysis of these programs.

Original languageEnglish (US)
Pages (from-to)94-136
Number of pages43
JournalACM Transactions on Computer Systems
Volume22
Issue number1
DOIs
StatePublished - Feb 1 2004

Keywords

  • Analytical model
  • Deterministic model
  • Parallel program performance prediction
  • Queueing network
  • Shared memory
  • Task graph
  • Task scheduling

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parallel program performance prediction using deterministic task graph analysis'. Together they form a unique fingerprint.

  • Cite this