Symbolic Scheduling Techniques : PAPER Special Issue on Synthesis and Verification of Hardware Design

スポンサーリンク

概要

• 論文の詳細を見る

• This paper describes an exact symbolic formulation of resource-constrained scheduling which allows speculative operation execution in arbitrary forward-branching control/data paths. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. An iterative construction method is presented along with benchmark results. The experiments demonstrate the ability of the proposed technique to efficiently extract parallelism not explicitly specified in the input description.

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

著者

• Brewer Forrest

  University of California

• Brewer Forrest

  Department Of Electrical And Computer Engineering University Of California

• Radivojevic Ivan

  Department of Electrical and Computer Engineering, University of California

• Radivojevic Ivan

  Department Of Electrical And Computer Engineering University Of California

関連論文

• A 40-Gb/s CMOS Distributed Amplifier for Fiber-Optic Communication Systems (VLSI一般(ISSCC2004特集))
• C-10-1 40Gbit/s光通信用CMOS分布型増幅器(C-10.電子デバイス)
• Symbolic Scheduling Techniques : PAPER Special Issue on Synthesis and Verification of Hardware Design

スポンサーリンク