Quantifying instruction criticality for shared memory multiprocessors

Published

Conference Paper

A model was created for determining criticality in MP systems. An algorithm was devised for computing criticality and criticality of real MP workloads was evaluated. A directed acyclic graph (DAG) model for executing: critical path and slack; mapping DAGs to multiprocessor systems and computing stack was discussed. Global slack offline was computed, but processing DAGs requires large amounts of storage and time.

Duke Authors

Cited Authors

  • Li, T; Lebeck, AR; Sorin, DJ

Published Date

  • December 1, 2003

Published In

  • Annual Acm Symposium on Parallel Algorithms and Architectures

Start / End Page

  • 47 - 72

Citation Source

  • Scopus