An Algorithm for Performance-driven Timing-planning
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In the architecture design stage of super computer, it is indispensable to perform timing planning to judge the physical realizibility of architecture alternative and performance metrics as early as possible. This paper presents a performance-driven timing-planning method. A timing performance model which is suitable to describe component performance is adopted, and the path delay slack is distributed according to net weight. The algorithm has advantages of high efficiency and rational delay distribution.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 27,2000
  • Revised:
  • Adopted:
  • Online: August 21,2013
  • Published:
Article QR Code