Performance enhancement of high degree Charlier polynomials using multithreaded algorithm
Discrete orthogonal polynomials (DOPs) have gained significant research attention owing to their crucial role in digital signal processing applications such as computer vision, pattern recognition, and compression. However, the computation of DOP coefficients often incurs a substantial computational...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-05-01
|
| Series: | Ain Shams Engineering Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2090447924000327 |
| _version_ | 1797243028094582784 |
|---|---|
| author | Basheera M. Mahmmod Wameedh N. Flayyih Sadiq H. Abdulhussain Firas A. Sabir Bilal Khan Muntadher Alsabah Abir Hussain |
| author_facet | Basheera M. Mahmmod Wameedh N. Flayyih Sadiq H. Abdulhussain Firas A. Sabir Bilal Khan Muntadher Alsabah Abir Hussain |
| author_sort | Basheera M. Mahmmod |
| collection | DOAJ |
| description | Discrete orthogonal polynomials (DOPs) have gained significant research attention owing to their crucial role in digital signal processing applications such as computer vision, pattern recognition, and compression. However, the computation of DOP coefficients often incurs a substantial computational burden, exacerbating for higher-degree moments along with the resulting numerical errors. To address this challenge, this paper exploits the inherent parallelism in Charlier polynomial coefficient calculations to achieve enhanced polynomial performance. Independent calculations are distributed among threads, making efficient use of the available processing resources. Two algorithms are presented, the first algorithm evenly distributes the rows in a sequential manner (straightforward). Additionally, to achieve a more equitable distribution of coefficient calculations, this paper proposes alternative distribution approaches, aimed at balancing processing load among threads. Through extensive comparative experiments, we have confirmed that the proposed approaches achieved high performance across different degrees (1540 to 7370) and at different numbers of threads (2 to 256). The results show processing time in the multithreaded case is improved by up to 9.1 times with respect to the unthreaded case. Furthermore, by increasing the number of threads from 2 to 256, the trend indicates that the most significant improvement occurs in the range of 32 to 128 threads, confirming the robustness of the proposed algorithm. These findings signify the importance of this paper. |
| first_indexed | 2024-04-24T18:48:36Z |
| format | Article |
| id | doaj.art-8366b9cb48a249238155654d14e74f48 |
| institution | Directory Open Access Journal |
| issn | 2090-4479 |
| language | English |
| last_indexed | 2024-04-24T18:48:36Z |
| publishDate | 2024-05-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Ain Shams Engineering Journal |
| spelling | doaj.art-8366b9cb48a249238155654d14e74f482024-03-27T04:51:51ZengElsevierAin Shams Engineering Journal2090-44792024-05-01155102657Performance enhancement of high degree Charlier polynomials using multithreaded algorithmBasheera M. Mahmmod0Wameedh N. Flayyih1Sadiq H. Abdulhussain2Firas A. Sabir3Bilal Khan4Muntadher Alsabah5Abir Hussain6Department of Computer Engineering, University of Baghdad, IraqDepartment of Computer Engineering, University of Baghdad, IraqDepartment of Computer Engineering, University of Baghdad, IraqDepartment of Computer Engineering, University of Baghdad, IraqSchool of Computer Science and Engineering, California State University San Bernardino, San Bernardino, United States; Corresponding author.Medical Technical College, Al-Farahidi University, Baghdad 10071, IraqSchool of Computer Science and Mathematics, Liverpool John Moores University, UK; Department of Electrical Engineering, University of Sharjah, Sharjah, United Arab EmiratesDiscrete orthogonal polynomials (DOPs) have gained significant research attention owing to their crucial role in digital signal processing applications such as computer vision, pattern recognition, and compression. However, the computation of DOP coefficients often incurs a substantial computational burden, exacerbating for higher-degree moments along with the resulting numerical errors. To address this challenge, this paper exploits the inherent parallelism in Charlier polynomial coefficient calculations to achieve enhanced polynomial performance. Independent calculations are distributed among threads, making efficient use of the available processing resources. Two algorithms are presented, the first algorithm evenly distributes the rows in a sequential manner (straightforward). Additionally, to achieve a more equitable distribution of coefficient calculations, this paper proposes alternative distribution approaches, aimed at balancing processing load among threads. Through extensive comparative experiments, we have confirmed that the proposed approaches achieved high performance across different degrees (1540 to 7370) and at different numbers of threads (2 to 256). The results show processing time in the multithreaded case is improved by up to 9.1 times with respect to the unthreaded case. Furthermore, by increasing the number of threads from 2 to 256, the trend indicates that the most significant improvement occurs in the range of 32 to 128 threads, confirming the robustness of the proposed algorithm. These findings signify the importance of this paper.http://www.sciencedirect.com/science/article/pii/S2090447924000327High-degree polynomialBalanced processingCharlier polynomialsCharlier momentsMultithread processingOrthogonal polynomials |
| spellingShingle | Basheera M. Mahmmod Wameedh N. Flayyih Sadiq H. Abdulhussain Firas A. Sabir Bilal Khan Muntadher Alsabah Abir Hussain Performance enhancement of high degree Charlier polynomials using multithreaded algorithm Ain Shams Engineering Journal High-degree polynomial Balanced processing Charlier polynomials Charlier moments Multithread processing Orthogonal polynomials |
| title | Performance enhancement of high degree Charlier polynomials using multithreaded algorithm |
| title_full | Performance enhancement of high degree Charlier polynomials using multithreaded algorithm |
| title_fullStr | Performance enhancement of high degree Charlier polynomials using multithreaded algorithm |
| title_full_unstemmed | Performance enhancement of high degree Charlier polynomials using multithreaded algorithm |
| title_short | Performance enhancement of high degree Charlier polynomials using multithreaded algorithm |
| title_sort | performance enhancement of high degree charlier polynomials using multithreaded algorithm |
| topic | High-degree polynomial Balanced processing Charlier polynomials Charlier moments Multithread processing Orthogonal polynomials |
| url | http://www.sciencedirect.com/science/article/pii/S2090447924000327 |
| work_keys_str_mv | AT basheerammahmmod performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm AT wameedhnflayyih performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm AT sadiqhabdulhussain performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm AT firasasabir performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm AT bilalkhan performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm AT muntadheralsabah performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm AT abirhussain performanceenhancementofhighdegreecharlierpolynomialsusingmultithreadedalgorithm |