Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute Engines

Details Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute Engines Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute Engines

2011-11-06

arxiv.org/abs/1111.1373v1

Computer Science

Distributed, Parallel, and Cluster Computing

14 pages, 4 figures, 5 algorithms

Scientific paper

We examine the problem of optimizing classification tree evaluation for on-line and real-time applications by using GPUs. Looking at trees with continuous attributes often used in image segmentation, we first put the existing algorithms for serial and data-parallel evaluation on solid footings. We then introduce a speculative parallel algorithm designed for single instruction, multiple data (SIMD) architectures commonly found in GPUs. A theoretical analysis shows how the run times of data and speculative decompositions compare assuming independent processors. To compare the algorithms in the SIMD environment, we implement both on a CUDA 2.0 architecture machine and compare timings to a serial CPU implementation. Various optimizations and their effects are discussed, and results are given for all algorithms. Our specific tests show a speculative algorithm improves run time by 25% compared to a data decomposition.

Affiliated with

Also associated with

No associations

Rating

Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute Engines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute Engines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speculative Parallel Evaluation Of Classification Trees On GPGPU Compute Engines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704389