Database Caching for Job-Level Computing

檔案

本條目沒有附加檔案。

日期

2016-01-01

期刊名稱

2016 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI)

卷期與頁次

頁 194–199

ISSN

2376-6816

語言

英文

摘要

This paper improves upon Job-Level (JL) computing, a general distributed computing approach. In JL computing, a client maintains the overall search tree and parcels the overall search into coarse-grained jobs, which are then each calculated by pre-existing game-playing programs. In order to support large-scale problems such as solving 7x7 killall-Go, or building opening books for 9x9 Go or Connect6, JL computing is modified so that the entire search tree is stored in a database, as opposed to simply being stored in the client process' memory. However, the time cost of accessing this database becomes a bottleneck on performance when using a large number of computing resources. This paper proposes a cache mechanism for JL search trees. Instead of the previous approach, where the entire search tree is stored in the database, we maintain parts of the search tree in the memory of the client process to reduce the number of database accesses. Our method significantly improves the performance of job operations. Assuming that each job requires 30 seconds on average, the JL application with this cache mechanism can allow for the use of 5036 distributed computing resources in parallel without database accesses becoming the performance bottleneck.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Chiang, H., Wei, T.-H., & Wu, I.-C. (2016). Database Caching for Job-Level Computing. 2016 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 194–199. https://ir.lib.nycu.edu.tw/handle/11536/146719

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/146719