Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/11701
Title: | Practical Examples of GPU Computing Optimization Principles | Authors: | GOORTS, Patrik ROGMANS, Sammy Vanden Eynde, Steven BEKAERT, Philippe |
Issue Date: | 2010 | Source: | Proceedings of the International Conference on Signal Processing and Multimedia Applications. p. 46-49. | Abstract: | In this paper, we provide examples to optimize signal processing or visual computing algorithms written for SIMT-based GPU architectures. These implementations demonstrate the optimizations for CUDA or its successors OpenCL and DirectCompute. We discuss the effect and optimization principles of memory coalescing, bandwidth reduction, processor occupancy, bank conflict reduction, local memory elimination and instruction optimization. The effect of the optimization steps are illustrated by state-of-the-art examples. A comparison with optimized and unoptimized algorithms is provided. A first example discusses the construction of joint histograms using shared memory, where optimizations lead to a significant speedup compared to the original implementation. A second example presents convolution and the acquired results. | Document URI: | http://hdl.handle.net/1942/11701 | ISBN: | 9789898425195 | ISI #: | 000392903400006 | Category: | C1 | Type: | Proceedings Paper | Validations: | ecoom 2019 |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
goorts2010practical.pdf | Published version | 670.67 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
2
checked on Oct 15, 2024
Page view(s)
66
checked on Aug 2, 2022
Download(s)
172
checked on Aug 2, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.