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

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages392-396
Number of pages5
DOIs
StatePublished - 1 Jan 2013
Event2013 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2013 - Taipei, Taiwan
Duration: 6 Dec 20138 Dec 2013

Conference

Conference2013 Conference on Technologies and Applications of Artificial Intelligence, TAAI 2013
CountryTaiwan
CityTaipei
Period6/12/138/12/13

Keywords

  • Desktop grid
  • Game tree search
  • Volunteer computing

Fingerprint Dive into the research topics of 'On the efficiency of executing diverse game tree search applications in a volunteer computing federation'. Together they form a unique fingerprint.

Cite this