Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/32232
Title: | CUDA Calculation of Shannon Entropy for a Sliding Window System | Authors: | Velichkovski, Gordon Gusev, Marjan Mileski, Dimitar |
Keywords: | Uncertainty , Graphics processing units , Entropy , Complexity theory , Telecommunications , Parallel architectures , Optimization | Issue Date: | 26-Nov-2024 | Publisher: | IEEE | Conference: | 2024 32nd Telecommunications Forum (TELFOR) | Abstract: | Entropy algorithms are crucial in fields where assessing randomness, uncertainty, or complexity is vital. As datasets grow, efficient entropy calculations become important. This work explores the parallelization of Shannon entropy calculations, using GPU acceleration through CUDA for sliding window systems. By leveraging GPUs’ parallel architecture, the approach achieves up to 15x speedup for large datasets. However, smaller datasets show limited improvements due to overhead, underscoring the need for optimization to harness GPU acceleration’s potential. | URI: | http://hdl.handle.net/20.500.12188/32232 | DOI: | 10.1109/telfor63250.2024.10819103 |
Appears in Collections: | Faculty of Computer Science and Engineering: Conference papers |
Files in This Item:
File | Size | Format | |
---|---|---|---|
CUDA Calculation of Shannon Entropy for a Sliding Window System - accepted version.pdf | 248.6 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.