Acceleration of sequential Monte Carlo for computationally intensive target distribution by parallel lookup table and GPU computing Online publication date: Fri, 27-Jul-2018
by Di Zhao
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 12, No. 1, 2018
Abstract: Sequential Monte Carlo (SMC) is the key solver for applications such as object tracking, signal processing and statistical distribution approximation. However, if the target distribution is complicated, the solution speed of the conventional SMC is too slow to satisfy the real-time requirement of applications. In this paper, by the novel idea of GPU-based lookup table (GPULTU), the acceleration method for the conventional SMC (LTU-GPU accelerated SMC) is developed, and the efficiency of LTU-GPU accelerated SMC by a statistical approximation problem is illustrated. Computational results show that LTU-GPU accelerated SMC is significantly faster than the conventional SMC from hours to seconds.
Online publication date: Fri, 27-Jul-2018
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com