Clock Schedule Design for Minimum Realization Cost (Special Section on VLSI Design and CAD Algorithms)
スポンサーリンク
概要
- 論文の詳細を見る
A semi-synchronous circuit is a circuit in which the clock is assumed to be distributed periodically to each individual register, though not necessarily to all registers simultaneously. In this paper, we propose an algorithm to achieve the target clock period by modifying a given target clock schedule as small as possible, where the realization cost of the target clock schedule is assumed to be minimum. The proposed algorithm iteratively improves a feasible clock schedule. The algorithm finds a set of registers that can reduce the cost by changing their clock timings with same amount, and changes the clock timing with optimal amount. Experiments show that the algorithm achieves the target clock period with fewer modifications.
- 一般社団法人電子情報通信学会の論文
- 2000-12-25
著者
-
Takahashi Atsushi
The Department Of Gastoroenterology Kushiro Medical Association Hospital
-
Takahashi Atsushi
Graduate School Of Engineering Osaka University
-
Yoda Tomoyuki
The Department Of Communications And Integrated Systems Tokyo Institute Of Technology:(present Addre
-
Takahashi Atsushi
The Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- A-3-10 Top Layer Plating Lead Maximization for BGA Packages
- A Clustering Based Fast Clock Schedule Algorithm for Light Clock-Trees(Special Section on VLSI Design and CAD Algorithms)
- Routability Driven Via Assignment Method for 2-Layer Ball Grid Array Packages
- MILP-Based Efficient Routing Method with Restricted Route Structure for 2-Layer Ball Grid Array Packages
- Gate-Level Register Relocation in Generalized Synchronous Framework for Clock Period Minimization(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
- A Fast Longer Path Algorithm for Routing Grid with Obstacles Using Biconnectivity Based Length Upper Bound
- Schedule-Clock-Tree Routing for Semi-Synchronous Circuits (Special Section on VLSI Design and CAD Algorithms)
- Optimal Time-Multiplexing in Inter-FPGA Connections for Accelerating Multi-FPGA Prototyping Systems
- Computational Complexity Analysis of Set-Bin-Packing Problem(Special Section on Discrete Mathematics and Its Applications)
- Transcatheter Arterial Embolization for Impending Rupture of an Isolated Internal Iliac Artery Aneurysm Complicated with Disseminated Intravascular Coagulation
- Routability of FPGAs with Extremal Switch-Block Structures(Special Section on Discrete Mathematics and Its Applications)
- Malignant Intestinal Schwannoma: A Case Report and a Review of the Literature in Japan
- Undifferentiated Carcinoma in the Cardioesophageal Junction which Produces Parathyroid Hormone Related Protein
- CAFE Router : A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles
- A Fast Clock Scheduling for Peak Power Reduction in LSI
- Minimization of Delay Insertion in Clock Period Improvement in General-Synchronous Framework
- A-3-4 Optimal Register Merging Method after Register Relocation in Semi-Synchronous Framework
- Air-Pressure Model and Fast Algorithms for Zero-Wasted-Area Layout of General Floorplan(Special Section on Discrete Mathematics and Its Applications)
- A Practical Clock Tree Synthesis for Semi-Synchronous Circuits(Special Section on VLSI Design and CAD Algorithms)
- A Via Assignment and Global Routing Method for 2-Layer Ball Grid Array Packages(Discrete Mathematics and Its Applications)
- Routability Driven Via Assignment and Routing for 2-Layer Ball Grid Array Packages
- Routing of Monotonic Parallel and Orthogonal Netlists for Single-Layer Ball Grid Array Packages(Physical Design,VLSI Design and CAD Algorithms)
- Clock Period Minimization Method of Semi-Synchronous Circuits by Delay Insertion(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- A Semi-Synchronous Circuit Design Method by Clock Tree Modification(Special Section on VLSI Design and CAD Algorithms)
- Clock Schedule Design for Minimum Realization Cost (Special Section on VLSI Design and CAD Algorithms)
- Clock Period Minimization of Semi-Synchronous Circuits by Gate-Level Delay Insertion (Special Section on VLSI Design and CAD Algorithms)
- Cost-Radius Balanced Spanning/Steiner Trees (Special Section on Discrete Mathematics and Its Applications)
- Practical Fast Clock-Schedule Design Algorithms(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
- Low Area Pipelined Circuits by the Replacement of Registers with Delay Elements(Circuit Synthesis,VLSI Design and CAD Algorithms)
- Multi-Clock Cycle Paths and Clock Scheduling for Reducing the Area of Pipelined Circuits(System Level Design,VLSI Design and CAD Algorithms)
- Routability Driven Via Assignment and Routing for 2-Layer Ball Grid Array Packages (デザインガイア2006--VLSI設計の新しい大地を考える研究会)
- Routability Driven Via Assignment and Routing for 2-Layer Ball Grid Array Packages (デザインガイア2006--VLSI設計の新しい大地を考える研究会)
- A-3-3 単層プリント基板配線のための各ネットの配線長達成性を考慮した等長配線手法(A-3.VLSI設計技術,一般セッション)
- 一般同期方式における最適2クラスタ分割手法
- 遅延ばらつき適応回路 : 遅延ばらつき状況下の高性能回路
- FPGA上に実現した可変レイテンシ回路の性能評価(再構成回路,システムオンシリコンを支える設計技術)
- FOREWORD
- A New Variation of Adaptive Simulated Annealing for 2D/3D Packing Optimization
- 動的遅延分布の高速な見積もり手法(システムLSIの応用と要素技術,プロセッサ,DSP,画像処理技術及び一般)
- 動的遅延分布の高速な見積もり手法(システムLSIの応用と要素技術,プロセッサ,DSP,画像処理技術及び一般)
- 動的遅延分布の高速な見積もり手法(システムLSIの応用と要素技術,プロセッサ,DSP,画像処理技術及び一般)
- 動的遅延分布の高速な見積もり手法(システムLSIの応用と要素技術,プロセッサ,DSP,画像処理技術及び一般)
- A New Variation of Adaptive Simulated Annealing for 2D/3D Packing Optimization
- エラー検出回復方式を用いた可変レイテンシ回路のための高速な性能見積もり手法(低電力化・高信頼化,組込み技術とネットワークに関するワークショップETNET2013)
- 単層プリント基板のための各ネットの目標配線長達成性を考慮した配線手法(配線設計,システムオンシリコンを支える設計技術)
- A-3-6 指定長幹配線間題において配線長を調整する領域に関する一考察(A-3.VLSI設計技術)
- 半正定値緩和法を用いた LELECUT トリプルパターニングのためのレイアウト分割手法
- 側壁ダブルパターニングのための修正2色グリッド配線法 (VLSI設計技術)
- ダブルパターニングにおけるリソグラフィECOのためのパターン局所修正法 (VLSI設計技術)
- エラー検出回復方式を用いた可変レイテンシ回路のための高速な性能見積もり手法(低電力化・高信頼化,組込み技術とネットワークに関するワークショップETNET2013)
- 集合対間配線に対する配線長差削減アルゴリズムの改良 (VLSI設計技術)
- FPGA上に実現した可変レイテンシ回路の性能評価