TITLE

Parallel Alpha-Beta Algorithm on the GPU

AUTHOR(S)
Strnad, Damjan; Guid, Nikola
PUB. DATE
December 2011
SOURCE
Journal of Computing & Information Technology;Dec2011, Vol. 19 Issue 4, p269
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In the paper we present the parallel implementation of the alpha-beta algorithm running on the graphics processing unit (GPU). We compare the speed of the parallel player with the standard serial one using the game of reversi with boards of different sizes. We show that for small boards the level of available parallelismis insufficient for efficient GPU utilization, but for larger boards substantial speed-ups can be achieved on the GPU. The results indicate that the GPU-based alpha-beta implementation would be advantageous for similar games of higher computational complexity (e.g. hex and go) in their standard form.
ACCESSION #
74017339

 

Related Articles

  • SOLUTIONS FOR OPTIMIZING THE RADIX SORT ALGORITHMIC FUNCTION USING THE COMPUTE UNIFIED DEVICE ARCHITECTURE. Pîrjan, Alexandru; Petroşanu, Dana-Mihaela // Journal of Information Systems & Operations Management;Dec2012, Vol. 6 Issue 2, p115 

    In this paper, we have researched and developed solutions for optimizing the radix sort algorithmic function using the Compute Unified Device Architecture (CUDA). The radix sort is a common parallel primitive, an essential building block for many data processing algorithms, whose optimization...

  • Outer First Decomposition-based Parallel Join Algorithm for Block Nested Loop Join. Seo-Young Noh; Heejun Yoon; Il-Yeon Yeo; Hyungwoo Park // Journal of Next Generation Information Technology;Oct2013, Vol. 4 Issue 8, p234 

    Join operations play important roles in database management systems, but are considered as one of most expensive operations. Since two relations are involved in join operations, their computational times are generally high. In order to reduce time complexity or disk I/Os in practice, many join...

  • Research on the Properties of DST Combination Rule and its Parallel Algorithm. Jinguang Chen; Fen Zhang; Huiran Wang // Journal of Computers;Aug2013, Vol. 8 Issue 8, p1934 

    The DST combination rule is studied and corresponding rigorous proofs of its properties are given, including two properties, i.e., sequential DST combination rule meets the commutative law and associative law; the sequential DST combination rule and the centralized DST combination rule are...

  • Models and Algorithms for the Reconfiguration of Virtual Enterprise Information System Structure. Romānovs, Andrejs; Trufanovs, Aleksandrs; Sokolov, Boris; Burakov, Vadim; Potryasaev, Semyon // Information Technology & Management Science;Dec2012, Vol. 16 Issue 1, p18 

    In this article we will consider existing approaches to solving problems of complex object reconfiguration, as well as combined dynamic model and method of reconfiguring, which is viewed as a virtual enterprise information system. Reconfiguration is a process of the complex technical system...

  • A Comprehensive Review for Disk Scheduling Algorithms. Celis, John Ryan; Gonzales, Dennis; Lagda, Erwinaldgeriko; Rutaquio Jr., Larry // International Journal of Computer Science Issues (IJCSI);Jan2014, Vol. 11 Issue 1, p74 

    This paper aims to discuss the structure of a disk and the hardware activities involved in the retrieval of data on a direct access storage device. Tackles and compute the different Disk Scheduling algorithms such as First Come First Serve (FCFS), Shortest Seek Time First (SSTF), Scan, Look,...

  • Restoring security of evolving software models using graph transformation. Bürger, Jens; Jürjens, Jan; Wenzel, Sven // International Journal on Software Tools for Technology Transfer;Jun2015, Vol. 17 Issue 3, p267 

    Security certification of complex systems requires a high amount of effort. As a particular challenge, today's systems are increasingly long-living and subject to continuous change. After each change of some part of the system, the whole system needs to be re-certified from scratch (since...

  • Dynamic Resource Access Using Graphical Game in Asymmetric Wireless Networks. Fangwei Li; Yongchuan Tang; Jiang Zhu // Journal of Networks;Aug2013, Vol. 8 Issue 8, p1845 

    In order to improve the resource utilization in asymmetric wireless networks, a novel dynamic resource access algorithm was presented. As the asymmetry of information and the locality of users' actions in distributed wireless networks, the resource access problem was expressed as a simple...

  • A game theory approach for efficient power control and interference management in two-tier femtocell networks based on local gain. Al-Gumaei, Y. A.; Noordin, K. A.; Reza, A. W.; Dimyati, K. // KSII Transactions on Internet & Information Systems;Jul2015, Vol. 9 Issue 7, p2530 

    In the recent years, femtocell technology has received a considerable attention due to the ability to provide an efficient indoor wireless coverage as well as enhanced capacity. However, under the spectrum sharing between femtocell user equipment (FUEs) and the owner of spectrum macrocell user...

  • Mining Frequent Patterns with Optimized Candidate Representation on Graphics Processor. Bhalodia, Dharmesh; Patel, Chhaya // International Journal of Computer Applications;Nov2014, Vol. 105 Issue 1-18, p1 

    Frequent itemset mining algorithms mine subsets of items that appear frequently in a collection of sets.FIM is a key investigation in numerous data mining applications, and the FIM tools are among the most computationally demanding in data mining. In this research paper we present a new approach...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics