Memory Coalescing Implementation of Metropolis Resampling on Graphics Processing Unit

Date

2018-03-01

Author

Dülger, Özcan
Oğuztüzün, Mehmet Halit S.
DEMİREKLER, MÜBECCEL

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

13
views

0
downloads

Cite This

Owing to many cores in its architecture, graphics processing unit (GPU) offers promise for parallel execution of the particle filter. A stage of the particle filter that is particularly challenging to parallelize is resampling. There are parallel resampling algorithms in the literature such as Metropolis resampling, which does not require a collective operation such as cumulative sum over weights and does not suffer from numerical instability. However, with large number of particles, Metropolis resampling becomes slow. This is because of the non-coalesced access problem on the global memory of the GPU. In this article, we offer solutions for this problem of Metropolis resampling. We introduce two implementation techniques, named Metropolis-C1 and Metropolis-C2, and compare them with the original Metropolis resampling on NVIDIA Tesla K40 board. In the first scenario where these two techniques achieve their fastest execution times, Metropolis-C1 is faster than the others, but yields the worst results in quality. However, Metropolis-C2 is closer to Metropolis resampling in quality. In the second scenario where all three algorithms yield similar quality, although Metropolis-C1 and Metropolis-C2 get slower, they are still faster than the original Metropolis resampling.

Subject Keywords

Control and Systems Engineering, Signal Processing, Theoretical Computer Science, Modelling and Simulation, Hardware and Architecture, Information Systems

URI

https://hdl.handle.net/11511/35875

Collections

Department of Computer Engineering, Article