Algorithms for high-level synthesis

Synthesis algorithms that offer a technique for scheduling operations and allocating registers and buses in light of both timing constraints and available hardware resources are presented. They enhance current scheduling techniques by using a global priority function that minimizes storage, intercon...

Full description

Saved in:
Bibliographic Details
Published in:IEEE design & test of computers 1989-12, Vol.6 (6), p.18-31
Main Authors: Paulin, P.G., Knight, J.P.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Automatic control
Costs
Hardware
High level synthesis
Job shop scheduling
Scheduling algorithm
Space exploration
Time factors
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Synthesis algorithms that offer a technique for scheduling operations and allocating registers and buses in light of both timing constraints and available hardware resources are presented. They enhance current scheduling techniques by using a global priority function that minimizes storage, interconnections, and functional unit cost. Algorithms for allocating registers and buses minimize storage and interconnection costs and take into account the interdependence of both tasks. The algorithms are also applicable to more than one method of synthesis; although first implemented in the HAL system, they have since been integrated into more specialized high-level synthesis systems.< >
ISSN:0740-7475
1558-1918
DOI:10.1109/54.41671