An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis : PAPER Special Issue on Synthesis and Verification of Hardware Design

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 一般社団法人電子情報通信学会の論文
• 1995-03-25

著者

• Jhon Chu

  Department Of Computer Engineering Seoul National University

• Ohm Seong

  Department Of Electrical And Computer Engineering University Of California

• Kurdahi Fadi

  Department of Electrical and Computer Engineering, University of California

• Kurdahi F

  Department Of Electrical And Computer Engineering University Of California

関連論文

• The Impact of Branch Direction History Combined with Global Branch History in Branch Prediction(Computer Systems)
• An Optimal Scheduling Approach Using Lower Bound in High-Level Synthesis : PAPER Special Issue on Synthesis and Verification of Hardware Design
• Write Avoidance Cache Coherence Protocol for Non-volatile Memory as Last-Level Cache in Chip-Multiprocessor

スポンサーリンク