Full metadata record
DC FieldValueLanguage
dc.contributor.author張家銓zh_TW
dc.contributor.author吳毅成zh_TW
dc.contributor.authorChang, Chia-Chuanen_US
dc.contributor.authorWu, I-Chenen_US
dc.date.accessioned2018-01-24T07:38:07Z-
dc.date.available2018-01-24T07:38:07Z-
dc.date.issued2016en_US
dc.identifier.urihttp://etd.lib.nctu.edu.tw/cdrfb3/record/nctu/#GT070356604en_US
dc.identifier.urihttp://hdl.handle.net/11536/139544-
dc.description.abstract近年來, 吳教授等人提出了工作層級演算法, 目前已被成功用來建構開局庫以及解出部分六子棋的開局. 為了能支援較大計算規模的應用, 例如解出七路殺光圍棋、建立9路圍棋及六子期開局庫等, Record資料庫被用來當作資料的存放空間, 工作層級演算法計算後的結果會被存於此. 在本論文中, 我們設計了一套機制, 能將BOINC (Berkeley Open Infrastructure for Network Computing) 這套志願型計算系統與工作層級演算法做結合,配合Record資料庫的運作,我們能藉此獲得更多的計算資源來進行更大規模的運算. 對於此, 我們做了初步的實驗來驗證此系統的可行性.zh_TW
dc.description.abstractRecently, 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.en_US
dc.language.isoen_USen_US
dc.subject工作層級運算zh_TW
dc.subject志願型計算zh_TW
dc.subject殺光圍棋zh_TW
dc.subjectBOINCzh_TW
dc.subjectJob-Level computingen_US
dc.subjectVolunteer computingen_US
dc.subjectBOINCen_US
dc.subjectKillall-Goen_US
dc.title支援 BOINC 之工作層級運算zh_TW
dc.titleJob-Level Computing with BOINC Supporten_US
dc.typeThesisen_US
dc.contributor.department多媒體工程研究所zh_TW
Appears in Collections:Thesis