Selective Clock Suppression of Protocol Modules for a Low Power Protocol Converter
スポンサーリンク
概要
- 論文の詳細を見る
This letter presents a method for reducing power dissipation in a protocol converter. The communication protocol of a VLSI chip hierarchically consists of several subprotocols and only one of them can be actively working at any given time. In general, protocol converters are implemented by dual protocols of the initially given protocols which are to be interfaced. If the duals of those sub-protocols are implemented in separate modules, we can separate active modules and inactive modules on the fly since only one of the modules can be active at a time. The active/inactive state of a module can be monitored by the control signals that represent the execution of the protocol corresponding to the module. Power reduction can be achieved by dynamically suppressing the clock supply to inactive modules. To trade-off the power reduction rate against the area overhead, the module granularity must be properly chosen. For this purpose, we implement the duals of the atomic protocols in the same module if their state graphs share states except the initial state. Our experimental results show that this method provides significant savings in power consumption of between 18.4% and 92.1% with a 5.3% area overhead.
- 社団法人電子情報通信学会の論文
- 2001-07-01
著者
-
Park K
Korea Advanced Inst. Sci. And Technol. Taejon Kor
-
Lee Young
The Authors Are With The Department Of Electrical Engineering And Computer Science
-
Park Kyu
The Authors Are With The Department Of Electrical Engineering And Computer Science
関連論文
- Negative Pattern Generation Technique by Laser Beam Writing for Integrated Optics
- Comparison of Propagation Losses of Single-Mode GaAs/AlGaAs Waveguides in a Three- and a Five-Layer Structure
- The Reduction of the Bandwidth of Texture Memory in Texture Filtering
- A PC-Based Scalable Parallel Resterizer Using Interleaved Scanline Rasterization
- Selective Clock Suppression of Protocol Modules for a Low Power Protocol Converter
- Definition of Attributed Random Graph and Proposal of Its Applications
- An Ordered-Deme Genetic Algorithm for Multiprocessor Scheduling