Parallel algorithm design and implementation of regular/irregular problems: an in-depth performance study on graphics processing units

• Main Author: Solomon, Steven
• Other Authors: Thulasiraman, Parimala (Computer Science)
• Published: 2012
• Subjects: Parallel Computing; GPU; CUDA; Combinatorial Optimization; Regular/Irregular Problems; Option Pricing; Particle Swarm Optimization
• Online Access: http://hdl.handle.net/1993/5098

Recently, interest in the Graphics Processing Unit (GPU) for general purpose parallel applications development and research has grown. Much of the current research on the GPU focuses on the acceleration of regular problems, as irregular problems typically do not provide the same level of performance on the hardware. We explore the potential of the GPU by investigating four problems on the GPU with regular and/or irregular properties: lookback option pricing (regular), single-source shortest path (irregular), maximum flow (irregular), and the task matching problem using multi-swarm particle swarm optimization (regular with elements of irregularity). We investigate the design, implementation, optimization, and performance of these algorithms on the GPU, and compare the results. Our results show that the regular problem achieves greater performance and requires less development effort than the irregular problems. However, we find the GPU to still be capable of providing high levels of acceleration for irregular problems.