Asynchronous control network optimization using fast minimum cycle time analysis

This paper proposes two methods for optimizing the control networks of asynchronous pipelines. The first uses a branch-and-bound algorithm to search for the optimum mix of the handshake components of different degrees of concurrence that provides the best...

全面介紹

Saved in:
書目詳細資料
Main Authors: Law, Chong Fatt, Gwee, Bah Hwee, Chang, Joseph Sylvester
其他作者: School of Electrical and Electronic Engineering
格式: Article
語言:English
出版: 2010
主題:
在線閱讀:https://hdl.handle.net/10356/92668
http://hdl.handle.net/10220/6277
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
實物特徵
總結:This paper proposes two methods for optimizing the control networks of asynchronous pipelines. The first uses a branch-and-bound algorithm to search for the optimum mix of the handshake components of different degrees of concurrence that provides the best throughput while minimizing asynchronous control overheads. The second method is a clustering technique that iteratively fuses two handshake components that share input channel sources or output channel destinations into a single component while preserving the behavior and satisfying the performance constraint of the asynchronous pipeline. We also propose a fast algorithm for iterative minimum-cycle-time analysis. The novelty of the proposed algorithm is that it takes advantage of the fact that only small modifications are made to the control network during each optimization iteration. When applied to nontrivial designs, the proposed optimization methods provided significant reductions in transistor count and energy dissipation in the designs’ asynchronous control networks while satisfying the throughput constraints.