Authors: Wei, Ting Han
Liang, Chao-Chin
Wu, I-Chen
Chen, Lung-Pin
Department of Computer Science
Issue Date: Sep-2015
Abstract: Recently, Wu et al. introduced a general distributed computing approach, named Job-Level (JL) Computing. In JL computing, a search tree is maintained by a client process, while search tree nodes are evaluated, expanded, or generated by leveraging game-playing programs. These node operations are encapsulated as coarse-grain jobs, each requiring tens of seconds or more of running the programs. This article presents an abstraction of the JL computing approach and develops a general JL search framework so that common modules may be reused for various JL applications, making JL development easier. We describe in detail the implementation of the JL Proof-number Search (JL-PNS) and JL Upper Confidence Bound Search (JL-UCT) as case studies in the application of the JL search framework. In our case studies, only hundreds of lines of code are required for new JL applications, while the code for the JL framework consists of more than ten thousand lines of code. It demonstrates that this framework can be used to greatly reduce new JL application development and software maintenance efforts.
URI: http://hdl.handle.net/11536/133826
ISSN: 1389-6911
Volume: 38
Issue: 3
Begin Page: 131
End Page: 148
Appears in Collections:Articles