Advertisement

Performance Analysis

  • Ti-Yen Yen
  • Wayne Wolf
Chapter

Abstract

This chapter describes a new, efficient analysis algorithm [111, 112] to derive tight bounds on the worst-case response time required for an application task executing on a heterogeneous distributed system. Tight performance bounds are essential to many co-synthesis algorithms [106, 26, 30]. Co-synthesis requires performance estimation techniques to select suitable hardware components and determine how different allocation and scheduling of processes can affect the system performance. The performance estimation algorithm needs to be efficient in order for the co-synthesis algorithm to quickly explore various architectures in a large design space. Given the computation time of the uninterrupted execution of processes, the allocation of processes, and the priority assignment for process scheduling, the goal of our analysis algorithm is to statically estimate the worst-case delay of a task.

Keywords

Task Graph Delay Estimation Maximum Separation Priority Assignment Phase Adjustment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  • Ti-Yen Yen
    • 1
  • Wayne Wolf
    • 2
  1. 1.Quickturn Design SystemsMountain ViewUSA
  2. 2.Princeton UniversityPrincetonUSA

Personalised recommendations