An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis

Seong Yong OHM; Fadi J. KURDAHI; Chu Shik JHON

An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis

Seong Yong OHM, Fadi J. KURDAHI, Chu Shik JHON

Full Text Views

0

Cite this

Summary :

This paper describes an optimal scheduling approach which finds the scheduling result of the minimum functional unit cost under the given timing constraint. In this method, a well-defined search space is constructed incrementally and traversed in a branch-and-bound manner. During the traversal, tighter lower bounds are estimated and utilized coupled with the upper bound on the optimal solution in pruning the search space effectively. This method is extended to support multi-cycling operations, operation chaining, pipelined functional units, and pipelined data paths. Experimental results on some benchmarks show the efficiency of the proposed approach.

Publication: IEICE TRANSACTIONS on Information Vol.E78-D No.3 pp.231-236

Publication Date: 1995/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Synthesis and Verification of Hardware Design)

Category: High-Level Synthesis

Cite this

Copy

Seong Yong OHM, Fadi J. KURDAHI, Chu Shik JHON, "An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis" in IEICE TRANSACTIONS on Information, vol. E78-D, no. 3, pp. 231-236, March 1995, doi: .
Abstract: This paper describes an optimal scheduling approach which finds the scheduling result of the minimum functional unit cost under the given timing constraint. In this method, a well-defined search space is constructed incrementally and traversed in a branch-and-bound manner. During the traversal, tighter lower bounds are estimated and utilized coupled with the upper bound on the optimal solution in pruning the search space effectively. This method is extended to support multi-cycling operations, operation chaining, pipelined functional units, and pipelined data paths. Experimental results on some benchmarks show the efficiency of the proposed approach.
URL: https://global.ieice.org/en_transactions/information/10.1587/e78-d_3_231/_p

Copy

@ARTICLE{e78-d_3_231,
author={Seong Yong OHM, Fadi J. KURDAHI, Chu Shik JHON, },
journal={IEICE TRANSACTIONS on Information},
title={An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis},
year={1995},
volume={E78-D},
number={3},
pages={231-236},
abstract={This paper describes an optimal scheduling approach which finds the scheduling result of the minimum functional unit cost under the given timing constraint. In this method, a well-defined search space is constructed incrementally and traversed in a branch-and-bound manner. During the traversal, tighter lower bounds are estimated and utilized coupled with the upper bound on the optimal solution in pruning the search space effectively. This method is extended to support multi-cycling operations, operation chaining, pipelined functional units, and pipelined data paths. Experimental results on some benchmarks show the efficiency of the proposed approach.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis
T2 - IEICE TRANSACTIONS on Information
SP - 231
EP - 236
AU - Seong Yong OHM
AU - Fadi J. KURDAHI
AU - Chu Shik JHON
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1995
AB - This paper describes an optimal scheduling approach which finds the scheduling result of the minimum functional unit cost under the given timing constraint. In this method, a well-defined search space is constructed incrementally and traversed in a branch-and-bound manner. During the traversal, tighter lower bounds are estimated and utilized coupled with the upper bound on the optimal solution in pruning the search space effectively. This method is extended to support multi-cycling operations, operation chaining, pipelined functional units, and pipelined data paths. Experimental results on some benchmarks show the efficiency of the proposed approach.
ER -