Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Constraint sensitive scheduling in RASP

Constraint sensitive scheduling in RASP 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGDA Newsletter Association for Computing Machinery

Constraint sensitive scheduling in RASP

Baldwin, Doug; Hitchings, Hamilton
ACM SIGDA Newsletter , Volume 21 (2) – Sep 1, 1991
Download PDF
10 pages

Loading next page...
 
/lp/association-for-computing-machinery/constraint-sensitive-scheduling-in-rasp-jtCQ70yGgW
Publisher
Association for Computing Machinery
Copyright
Copyright © 1991 by ACM Inc.
ISSN
0163-5743
DOI
10.1145/122410.122411
Publisher site
See Article on Publisher Site

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.

Journal

ACM SIGDA Newsletter – Association for Computing Machinery

Published: Sep 1, 1991

There are no references for this article.