DocumentCode
255931
Title
Parallelizing doolittle algorithm using TBB
Author
Sah, S.K. ; Naik, D.
Author_Institution
Dept. of Inf. Technol., Nat. Inst. of Technol. Karnataka, Mangalore, India
fYear
2014
fDate
11-13 Dec. 2014
Firstpage
13
Lastpage
15
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.
Keywords
C++ language; multiprocessing programs; parallel processing; C++; CPU; Intel threading building blocks; PDA; SDA; TBB; multiple cores; parallel Doolittle algorithm; parallel processing; serial Doolittle algorithm; Central Processing Unit; Equations; Instruction sets; Matrix decomposition; Parallel processing; Personal digital assistants; Doolittle Decomposition; Matrix Decompostion; Threading Building Blocks (TBB);
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel, Distributed and Grid Computing (PDGC), 2014 International Conference on
Conference_Location
Solan
Print_ISBN
978-1-4799-7682-9
Type
conf
DOI
10.1109/PDGC.2014.7030707
Filename
7030707
Link To Document