東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

System-level optimizations for high ...

Wang, Jia.

FindBook

Google Book

Amazon

博客來

System-level optimizations for high performance DSM circuits.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	System-level optimizations for high performance DSM circuits./
作者:	Wang, Jia.
面頁冊數:	231 p.
附註:	Adviser: Hai Zhou.
Contained By:	Dissertation Abstracts International69-03B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3303668
ISBN:	9780549502708

System-level optimizations for high performance DSM circuits.
Wang, Jia.

System-level optimizations for high performance DSM circuits. - 231 p.

Adviser: Hai Zhou.

Thesis (Ph.D.)--Northwestern University, 2008.

Process scaling has enabled the production of integrated circuits with millions of transistors. System-on-a-Chip becomes feasible as more functionalities can be packed into a single chip. As the human brain power is limited, the design process of such sophisticated systems should be automated in order to meet the stringent design specifications and short time-to-market. On one hand, ever-increasing system sizes require scalable algorithms for efficient system design space exploration. On the other hand, shrinking VLSI feature sizes require previous ignored physical effects to be considered for the reliability and manufacturability of the system. In this dissertation, we will present a few essential advances in design automation of high performance DSM circuits for the above challenges.

ISBN: 9780549502708Subjects--Topical Terms:

626642
Computer Science.

System-level optimizations for high performance DSM circuits.
LDR:03498nam 2200313 a 45 001 963047
005 20110830
008 110831s2008 ||||||||||||||||| ||eng d
020 $a 9780549502708
035 $a (UMI)AAI3303668
035 $a AAI3303668
040 $a UMI $c UMI
100 1 $a Wang, Jia. $3 1286108
245 1 0 $a System-level optimizations for high performance DSM circuits.
300 $a 231 p.
500 $a Adviser: Hai Zhou.
500 $a Source: Dissertation Abstracts International, Volume: 69-03, Section: B, page: 1854.
502 $a Thesis (Ph.D.)--Northwestern University, 2008.
520 $a Process scaling has enabled the production of integrated circuits with millions of transistors. System-on-a-Chip becomes feasible as more functionalities can be packed into a single chip. As the human brain power is limited, the design process of such sophisticated systems should be automated in order to meet the stringent design specifications and short time-to-market. On one hand, ever-increasing system sizes require scalable algorithms for efficient system design space exploration. On the other hand, shrinking VLSI feature sizes require previous ignored physical effects to be considered for the reliability and manufacturability of the system. In this dissertation, we will present a few essential advances in design automation of high performance DSM circuits for the above challenges.
520 $a We investigate floorplanning techniques in order to address the methodology shift from logic centric to interconnect centric. We propose the processing rate as an unified performance measure and develop a floorplanning approach to optimize it directly through efficient minimum cycle ratio algorithms. Then, we present two graph-based floorplan approaches---one of them models the adjacency relations between the non-overlapping rectangular blocks, and the other models the non-overlapping constraints between the blocks, while the sizes of both graphs are linear in terms of the number of the blocks.
520 $a Moreover, we investigate sequential system optimization techniques for system optimizations under performance bounds. We propose to combine sizing and clock skew optimization in a convex-programming-based framework and design an algorithm to solve the problem based on the method of feasible directions and min-cost network flow. We then present an optimal minimum area retiming algorithm that incrementally relocates flip-flops in a sequential circuit without changing its functionality subject to a clock period bound. Compared to the conventional algorithms that solve the same problem, our algorithm only requires linear storage and is practically much more efficient.
520 $a Further more, we investigate design for manufacturability techniques to consider issues in chip fabrication at the design time. We propose to perform risk-aversion min-period retiming in order to overcome process variations through retiming and present a heuristic incremental retiming algorithm. We study the antenna effect during fabrication process that damages gates and design an optimal algorithm in routing stage to insert jumpers under a bound of antenna ratio such that the damages of antenna effects will be limited.
590 $a School code: 0163.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
690 $a 0984
710 2 $a Northwestern University. $b Electrical and Computer Engineering. $3 1022291
773 0 $t Dissertation Abstracts International $g 69-03B.
790 $a 0163
790 1 0 $a Zhou, Hai, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3303668