標題: GPU平台下的高度平行化繞線演算法與其應用Massively Parallel Routing Algorithms on GPU Platform and Their Applications 作者: 羅勻鍵Lo, Yun-Jian李毅郎Li, Yih-Lang資訊科學與工程研究所 關鍵字: 繞線演算法;電子設計自動化;平行化;全域繞線器;GPU;CUDA;maze routing algorithm;EDA;parallel programing;global router 公開日期: 2010 摘要: GPU原為設計用來處理圖形方面應用之處理器，因為其多核心與單指令流多執行緒架構，已有越來越多演算法被平行化並使用GPU來加速。本研究使用GPU來加速電子自動化設計中常需使用到的演算法 – 在以格線為基礎的圖形內的繞線演算法。我們提出了每一個節點由一個執行緒控制為基礎的演算法，並使用三個方法來加速，分別是判斷並只呼叫需要更新的區域、減少分歧路線、避免資料讀取衝突，之後我們將此演算法應用至以下三個問題中 – 全點對最短路徑問題、使用緩衝器ECO來解決時間優化問題、三維全域繞線器。實驗結果指出在全點對最短路徑問題中，GPU最多可加速至CPU的31.2倍，ECO問題亦可透過GPU加速至平均13.7倍，三維全域繞線器與GLADE [1] 比較之結果，可繞出合法解之平均總線長短1.6%，但時間花費為GLADE的9.84倍且解不出的overflow亦比GLADE還要高，但若與CPU相比，GPU的時間比CPU提升了11.52倍。GPU was originally a processor designed to handle the graphic applications, because of its multi-core and Single Instruction, Multiple Thread (SIMT) architecture, more and more algorithms are parallel and use GPU to accelerate. This study uses GPU to accelerate one of the electronic design automation algorithms – maze routing algorithm in grid-based graph. We proposed a algorithm that each node was controlled by a thread, and used the following three methods to speed up, respectively, check which sub-regions need to be updated, minimize divergent warps, and avoid bank conflicts, then we apply this algorithm to the following three problems – all pairs shortest path, maze routing part in buffer insertion for ECO timing optimization, 3D global router with layer directive. Experimental results indicated that GPU can speedup to 31.2 times with CPU in APSP problem, ECO problem can also be accelerated to an average of 13.7 times with CPU, 3D global router compared with the results of GLADE [1], the legal solutions can be around 1.6% shorter on total wire length than GLADE, but the time spent was 9.84 times than GLADE and the overflow solution is also higher than GLADE, but if compared with the CPU, GPU is 11.52 times faster than CPU. URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079855524http://hdl.handle.net/11536/48259 Appears in Collections: Thesis