Facial reconstruction

Search LJMU Research Online

Browse Repository | Browse E-Theses

Performance enhancement of high degree Charlier polynomials using multithreaded algorithm

Mahmmod, BM, Flayyih, WN, Abdulhussain, SH, Sabir, FA, Khan, B, Alsabah, M and Hussain, A (2024) Performance enhancement of high degree Charlier polynomials using multithreaded algorithm. Ain Shams Engineering Journal, 15 (5). ISSN 2090-4479

[img]
Preview
Text
Performance enhancement of high degree Charlier polynomials using multithreaded algorithm.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2MB) | Preview

Abstract

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.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Computer Science & Mathematics
Publisher: Elsevier
SWORD Depositor: A Symplectic
Date Deposited: 08 Aug 2024 13:20
Last Modified: 08 Aug 2024 13:30
DOI or ID number: 10.1016/j.asej.2024.102657
URI: https://researchonline.ljmu.ac.uk/id/eprint/23902
View Item View Item