Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/10835
Title: | Optimal Data Distribution for Versatile Finite Impulse Response Filtering on Next-Generation Graphics Hardware Using CUDA | Authors: | GOORTS, Patrik ROGMANS, Sammy BEKAERT, Philippe |
Issue Date: | 2009 | Publisher: | IEEE Computer Society | Source: | 15th International Conference on Parallel and Distributed Systems. p. 300-307. | Series/Report: | Parallel and Distributed Systems, International Conference on | Abstract: | In this paper, we investigate discrete finite impulse response (FIR) filtering of images, while harnessing the powerful computational resources of next-generation GPUs. These novel platforms exhibit a massive data parallel architecture with an advanced SIMT execution model and thread management, to enable designers to better cope with the infamous memory wall, i.e. the growing gap between the cost of data communication and computational processing. However, the concerning platforms still have hard constraints that prevent trivial optimization of convolution filtering. Although automatic (compiler) optimization is available, we investigate and explain the speedup potential considering manual intervention, given the context of FIR kernels. Furthermore, we present multiple convolution implementation techniques that are able to cope with the hard platform constraints in different situations, while still being able to optimize the implementation to the underlying architecture. Utilizing the acquired insights, a view is given on the impact for possible optimization when loosening these hard constraints in the near future. | Keywords: | data distribution, FIR, convolution, CUDA | Document URI: | http://hdl.handle.net/1942/10835 | Link to publication/dataset: | http://doi.ieeecomputersociety.org/10.1109/ICPADS.2009.79 | ISBN: | 978-0-7695-3900-3 | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.