Constraint sensitive scheduling in RASP

  • Authors:
  • Doug Baldwin;Hamilton Hitchings

  • Affiliations:
  • -;-

  • Venue:
  • ACM SIGDA Newsletter
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe the scheduling algorithm with which the RASP circuit synthesizer meets constraints. Because RASP makes an unusually large number of design choices, it uses a local cost-based scheduler. Nonetheless, experimental tests suggest that the scheduler produces a wide range of designs, handling both area and timing constraints very well.