A Directed Searching Pipeline Scheduling Algorithmfor Datapath Synthesis
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    In the high-level synthesis of application-specific DSP, pipeline scheduling is a difficult and urgent problem Concerning the global optimization of functional units, registers and interconnections, we present a novel algorithm called directed searching pipeline scheduling, which is an iterative algorithm utilizing heuristic information. The heuristic information speeds up the searching process, and the weakness of deterministic algorithms, which are vulnerable to trip in local optimal, poor at hill-climbing, is overcome in this algorithm. Typical design examples show that the performance of this transformation-based algorithm has reached or surpassed the best performance of pipeline scheduling algorithms reported so far.

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