ILP-based scheduling with time and resource constraints in highlevel synthesis
Chaudhuri, S.
Walker, R.A.
Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY;
This paper appears in: VLSI Design, 1994., Proceedings of the Seventh International Conference on
Publication Date: 5-8 Jan 1994
On page(s): 17-20
Meeting Date: 01/05/1994 - 01/08/1994
Location: Calcutta, India
ISSN: 1063-9667
ISBN: 0-8186-4990-9
References Cited: 9
INSPEC Accession Number: 4658327
Digital Object Identifier: 10.1109/ICVD.1994.282637
Current Version Published: 2002-08-06
Abstract
Presents a formal analysis of the constraints of the scheduling
problem, and evaluates the structure of the scheduling polytope
described by those constraints. Polyhedral theory and duality theory are
used to demonstrate that efficient solutions of the scheduling problem
can be expected from a carefully formulated integer linear program
(ILP). Furthermore, the authors present an algorithm to lower bound the
resource requirement of the time-constrained scheduling problem that
enables them to solve the ILP more efficiently
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
