東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms for VLSI circuit optimiza...

Liu, Yifang.

FindBook

Google Book

Amazon

博客來

Algorithms for VLSI circuit optimization and GPU-based parallelization.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Algorithms for VLSI circuit optimization and GPU-based parallelization./
作者:	Liu, Yifang.
面頁冊數:	136 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 5000.
Contained By:	Dissertation Abstracts International71-08B.
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3416241
ISBN:	9781124126951

Algorithms for VLSI circuit optimization and GPU-based parallelization.
Liu, Yifang.

Algorithms for VLSI circuit optimization and GPU-based parallelization. - 136 p.

Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 5000.

Thesis (Ph.D.)--Texas A&M University, 2010.

This research addresses some critical challenges in various problems of VLSI design automation, including sophisticated solution search on DAG topology, simultaneous multi-stage design optimization, optimization on multi-scenario and multi-core designs, and GPU-based parallel computing for runtime acceleration.

ISBN: 9781124126951Subjects--Topical Terms:

1669061
Engineering, Computer.

Algorithms for VLSI circuit optimization and GPU-based parallelization.
LDR:04374nam 2200325 4500 001 1403145
005 20111111141811.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124126951
035 $a (UMI)AAI3416241
035 $a AAI3416241
040 $a UMI $c UMI
100 1 $a Liu, Yifang. $3 1682392
245 1 0 $a Algorithms for VLSI circuit optimization and GPU-based parallelization.
300 $a 136 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-08, Section: B, page: 5000.
500 $a Adviser: Jiang Hu.
502 $a Thesis (Ph.D.)--Texas A&M University, 2010.
520 $a This research addresses some critical challenges in various problems of VLSI design automation, including sophisticated solution search on DAG topology, simultaneous multi-stage design optimization, optimization on multi-scenario and multi-core designs, and GPU-based parallel computing for runtime acceleration.
520 $a Discrete optimization for VLSI design automation problems is often quite complex, due to the inconsistency and interference between solutions on reconvergent paths in directed acyclic graph (DAG). This research proposes a systematic solution search guided by a global view of the solution space. The key idea of the proposal is joint relaxation and restriction (JRR), which is similar in spirit to mathematical relaxation techniques, such as Lagrangian relaxation. Here, the relaxation and restriction together provides a global view, and iteratively improves the solution.
520 $a Traditionally, circuit optimization is carried out in a sequence of separate optimization stages. The problem with sequential optimization is that the best solution in one stage may be worse for another. To overcome this difficulty, we take the approach of performing multiple optimization techniques simultaneously. By searching in the combined solution space of multiple optimization techniques, a broader view of the problem leads to the overall better optimization result. This research takes this approach on two problems, namely, simultaneous technology mapping and cell placement, and simultaneous gate sizing and threshold voltage assignment.
520 $a Modern processors have multiple working modes, which trade off between power consumption and performance, or to maintain certain performance level in a power-efficient way. As a result, the design of a circuit needs to accommodate different scenarios, such as different supply voltage settings. This research deals with this multi-scenario optimization problem with Lagrangian relaxation technique. Multiple scenarios are taken care of simultaneously through the balance by Lagrangian multipliers. Similarly, multiple objective and constraints are simultaneously dealt with by Lagrangian relaxation. This research proposed a new method to calculate the subgradients of the Lagrangian function, and solve the Lagrangian dual problem more effectively.
520 $a Multi-core architecture also poses new problems and challenges to design automation. For example, multiple cores on the same chip may have identical design in some part, while differ from each other in the rest. In the case of buffer insertion, the identical part have to be carefully optimized for all the cores with different environmental parameters. This problem has much higher complexity compared to buffer insertion on single cores. This research proposes an algorithm that optimizes the buffering solution for multiple cores simultaneously, based on critical component analysis.
520 $a Under the intensifying time-to-market pressure, circuit optimization not only needs to find high quality solutions, but also has to come up with the result fast. Recent advance in general purpose graphics processing unit (GPGPU) technology provides massive parallel computing power. This research turns the complex computation task of circuit optimization into many subtasks processed by parallel threads. The proposed task partitioning and scheduling methods take advantage of the GPU computing power, achieve significant speedup without sacrifice on the solution quality.
590 $a School code: 0803.
650 4 $a Engineering, Computer. $3 1669061
690 $a 0464
710 2 $a Texas A&M University. $3 718977
773 0 $t Dissertation Abstracts International $g 71-08B.
790 1 0 $a Hu, Jiang, $e advisor
790 $a 0803
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3416241