On the efficiency of executing diverse game tree search applications in a volunteer computing federation

Lung Pin Chen, I-Chen Wu, Yuan Yao Chang, Wen Jie Tseng

研究成果: Paper同行評審

摘要

A game tree search application can be implemented as the malleable parallel jobs that are adapted to various processor allocations. We establish an efficient desktop grid federation to enable the small to mid-sized organizations to perform large-scale game tree search tasks via resource sharing. Due to the uneven task scales of the organizations as well as the dynamic generation/pruning of game tree search tasks, the user credits of the desktop grids may fluctuate dramatically, leading an unstable resource allocation to the hosted applications. This paper shows that stable processor allocation leads to higher efficiency for the parallel tasks. A new brokering algorithm is developed that ensures both fairness and stable resource allocation.

原文English
頁面392-396
頁數5
DOIs
出版狀態Published - 1 一月 2013
事件2013 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2013 - Taipei, Taiwan
持續時間: 6 十二月 20138 十二月 2013

Conference

Conference2013 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2013
國家/地區Taiwan
城市Taipei
期間6/12/138/12/13

指紋

深入研究「On the efficiency of executing diverse game tree search applications in a volunteer computing federation」主題。共同形成了獨特的指紋。

引用此