標題: 支援 BOINC 之工作層級運算
Job-Level Computing with BOINC Support
作者: 張家銓
吳毅成
Chang, Chia-Chuan
Wu, I-Chen
多媒體工程研究所
關鍵字: 工作層級運算;志願型計算;殺光圍棋;BOINC;Job-Level computing;Volunteer computing;BOINC;Killall-Go
公開日期: 2016
摘要: 近年來, 吳教授等人提出了工作層級演算法, 目前已被成功用來建構開局庫以及解出部分六子棋的開局. 為了能支援較大計算規模的應用, 例如解出七路殺光圍棋、建立9路圍棋及六子期開局庫等, Record資料庫被用來當作資料的存放空間, 工作層級演算法計算後的結果會被存於此. 在本論文中, 我們設計了一套機制, 能將BOINC (Berkeley Open Infrastructure for Network Computing) 這套志願型計算系統與工作層級演算法做結合,配合Record資料庫的運作,我們能藉此獲得更多的計算資源來進行更大規模的運算. 對於此, 我們做了初步的實驗來驗證此系統的可行性.
Recently, Wu et al. introduced a general approach, named Job-Level (JL) Computing. JL Computing is one of the techniques which is based on distributed computing, and was successfully used to construct the opening books of game-playing programs. In order to support large-scale computing problems, such as solving 7x7 killall-Go, or building opening books for 9x9 Go or Connect6, database are used as storage of JL computing. In this paper, we further design a mechanism to combine the JL computing system with BOINC (Berkeley Open Infrastructure for Network Computing), so that we can leverage more computing power from volunteers to solve even larger problems. A preliminary experiment has been done to demonstrate the feasibility of the design.
URI: http://etd.lib.nctu.edu.tw/cdrfb3/record/nctu/#GT070356604
http://hdl.handle.net/11536/139544
顯示於類別:畢業論文