Bulk execution of the dynamic programming for the optimal polygon triangulation problem on the GPU. (14th September 2018)

• Record Type: Journal Article
• Authors: Yamashita, Kohei; Ito, Yasuaki; Nakano, Koji
• Other Names: Wyrzykowski Roman guestEditor.; Szymanski Boleslaw guestEditor.; Pan Lei guestEditor.; Zhang Jun guestEditor.; Oliver Jonathan guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 19(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-09-14
• Subjects: bulk execution -- CUDA -- dynamic programming -- GPGPU -- parallel algorithms -- triangulation; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4947
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The bulk execution is to execute some computation for many different inputs in turn or at the same time. The main contribution of this paper is to propose a parallel processing technique for the bulk execution of the dynamic programming using the GPU (Graphics Processing Unit). Especially, we focus on the optimal polygon triangulation problem for a lot of polygons. We consider programming issues of the GPU architecture such as coalesced memory access of the global memory, warp divergence avoidance, and reduction of CUDA kernel calls. In the GPU implementation, we propose two thread assignment methods that efficiently perform the parallel execution with a lot of threads on thousands of cores in the GPU. The experimental results show that our GPU implementation on NVIDIA TITAN V attains a speed‐up factor of up to 106.05 and 26.78 over the single‐thread and 8‐thread CPU implementations on Intel Core i7‐6700K CPU, respectively.