Relative scheduling under timing constraints: algorithms for high-level synthesis of digital circuits

For the synthesis of ASIC design that interface with external signals and events, timing constraints and operations with unbounded delays, i.e. delays unknown at compile time, must be considered. The authors present a relative scheduling formulation that supports operations with fixed and unbounded...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computer-aided design of integrated circuits and systems Vol. 11; no. 6; pp. 696 - 718
Main Authors Ku, D.C., De Mitcheli, G.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.06.1992
Institute of Electrical and Electronics Engineers
Subjects
Application specific integrated circuits
Applied sciences
Delay effects
Design. Technologies. Operation analysis. Testing
Digital circuits
DSL
Electronics
Exact sciences and technology
Hardware
High level synthesis
Integrated circuit synthesis
Integrated circuits
Processor scheduling
Scheduling algorithm
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Timing
Custom circuit
Online AccessGet full text
ISSN0278-0070
DOI10.1109/43.137516

Cover

More Information
Summary:For the synthesis of ASIC design that interface with external signals and events, timing constraints and operations with unbounded delays, i.e. delays unknown at compile time, must be considered. The authors present a relative scheduling formulation that supports operations with fixed and unbounded delays. The start time of an operation is specified in terms of offsets from the set of unbounded delay operations called anchors. The authors analyze a property, called well-posedness, of timing constraints. It is used to identify consistency of constraints in the presence of unbounded delay operations. The authors present an algorithm that will transform an ill-posed constraint graph into a minimally serialized well-posed constraint graph, if one exists. The anchors are then checked for redundancy, and they identify the minimum set of anchors that are required in computing the start time. They present an algorithm that schedules the operations relative to the anchors and yields a minimum schedule that satisfies the timing constraints, or detects whether no schedule exists, in polynomial time. They describe the generation of control logic from the resulting relative schedule.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0278-0070
DOI:10.1109/43.137516