Parallelizing doolittle algorithm using TBB
| dc.contributor.author | Sah, S.K. | |
| dc.contributor.author | Naik, D. | |
| dc.date.accessioned | 2026-02-06T06:39:54Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | This paper presents a different approach for parallelizing the Doolittle Algorithm with the help of Intel Threading Building Blocks (TBB) allowing the users to utilize the power of multiple cores present in the modern CPUs. Parallel Doolittle Algorithm (PDA) has been divided into 3 parts: Decomposing the data, Parallely processing the data, finally Composing the data. Using the PDA we can solve the linear system of equations in considerably lesser amount time as compare to Serial Doolittle Algorithm (SDA). The PDA has been implemented in C++ using TBB library which makes it highly efficient, cross-platform compatible, and scalable. The efficiency of PDA over SDA has been verified by comparing the running time on different order of matrices. Experiments proved that PDA outperformed SDA by utilizing all the cores present in the CPU. © 2014 IEEE. | |
| dc.identifier.citation | Proceedings of 2014 3rd International Conference on Parallel, Distributed and Grid Computing, PDGC 2014, 2014, Vol., , p. 13-15 | |
| dc.identifier.uri | https://doi.org/10.1109/PDGC.2014.7030707 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/32598 | |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
| dc.subject | Doolittle Decomposition | |
| dc.subject | Matrix Decompostion | |
| dc.subject | Threading Building Blocks (TBB) | |
| dc.title | Parallelizing doolittle algorithm using TBB |