標題: 適用於電腦遊戲之志願型計算系統仲介者
The Study of the Broker in a Volunteer Computing System for Computer Games
作者: 陳昱維
Chen, Yu-Wei
吳毅成
資訊科學與工程研究所
關鍵字: 志願型運算;網格運算;排程;Volunteer Computing;Grid Computing;scheduling
公開日期: 2010
摘要: 為了解決電腦對局遊戲的應用問題,我們需要大量的計算資源,而志願型計算其可擴充性、產能高以及費用低的特性,使我們決定使用志願型計算的模式來解決電腦對局應用問題。不過電腦對局遊戲有其特性,目前著名的志願型計算平台,例如BOINC等等,無法直接套用到一些電腦對局的應用上,因此我們過去開發了一套適用於電腦對局遊戲的志願型計算系統,也成功解決一些問題。 為了支援國科會整合型計畫,提供其他組織共同使用電腦對局遊戲的計算平台,我們將針對現有的系統進行改良,使得不同組織的使用者能共同使用本志願型運算系統,共同分享運算資源。我們也希望設計一套方法,來解決運算資源的分配的問題。目前本系統已經有其他組織加入使用,例如東華大學、師範大學等組織。
Many computer game applications need huge amount of computation and memory, so we need a lot of computing resources to solve those problems. Volunteer computing model, providing the features of scalability, high throughput and cheapness, would be a good solution for computer game applications. Unfortunately, many volunteer computing platforms, like BOINC, are not suitable for some computer game applications, so we have developed our own system of volunteer computing for computer game applications. For an integrated NSC project, we need to provide a computing platform for computer game applications for supporting many organizations concurrently. We will upgrade our system to support different organizations and share the computing resource provided by each organization. The major issue is to solve the problem of resource allocation. Currently, the system has been used by several organizations, such as National Dong Hwa University, National Taiwan Normal University and so on.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079855609
http://hdl.handle.net/11536/48345
顯示於類別:畢業論文