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

Fingerprint

Data storage equipment

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Parallel program performance prediction using deterministic task graph analysis. / Adve, Vikram S.; Vernon, Mary K.

In: ACM Transactions on Computer Systems, Vol. 22, No. 1, 01.02.2004, p. 94-136.

Research output: Contribution to journalReview article

@article{acf6cfbfc1324a189c30d084c8b4b456,
title = "Parallel program performance prediction using deterministic task graph analysis",
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.",
keywords = "Analytical model, Deterministic model, Parallel program performance prediction, Queueing network, Shared memory, Task graph, Task scheduling",
author = "Adve, {Vikram S.} and Vernon, {Mary K.}",
year = "2004",
month = "2",
day = "1",
doi = "10.1145/966785.966788",
language = "English (US)",
volume = "22",
pages = "94--136",
journal = "ACM Transactions on Computer Systems",
issn = "0734-2071",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - Parallel program performance prediction using deterministic task graph analysis

AU - Adve, Vikram S.

AU - Vernon, Mary K.

PY - 2004/2/1

Y1 - 2004/2/1

N2 - 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.

AB - 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.

KW - Analytical model

KW - Deterministic model

KW - Parallel program performance prediction

KW - Queueing network

KW - Shared memory

KW - Task graph

KW - Task scheduling

UR - http://www.scopus.com/inward/record.url?scp=2442517698&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2442517698&partnerID=8YFLogxK

U2 - 10.1145/966785.966788

DO - 10.1145/966785.966788

M3 - Review article

AN - SCOPUS:2442517698

VL - 22

SP - 94

EP - 136

JO - ACM Transactions on Computer Systems

JF - ACM Transactions on Computer Systems

SN - 0734-2071

IS - 1

ER -