Affiliations: Research Laboratory of Technologies of Information and Communication & Electrical Engineering (LaTICE), ENSIT, University of Tunis, Tunis, Tunisia. [email protected], [email protected]
Correspondence:
[*]
Address for correspondence: Research Laboratory of Technologies of Information and Communication & Electrical Engineering (LaTICE), ENSIT, University of Tunis, Tunis, Tunisia.
Abstract: A new approach for solving triangular band linear systems is established in this study to balance the load and obtain a high degree of parallelism. Our investigation consists to attribute both adequate start time and processor to each task and eliminate the useless dependencies which are not used in the parallel solve stage. Thereby, processors execute in parallel their related tasks taking account of the considered precedence constraints. The theoretical lower bounds for parallel execution time and the number of processors required to carry out the task graph in the shortest time are determined. Experimentations are realized on a shared-memory multicore processor. The experimental results are fitted to the values derived from the determined mathematical formulas. The comparison of results obtained by our contribution with those from triangular systems resolution routine belonging to the library PLASMA, Parallel Linear Algebra Software for Multicore Architectures, confirms the efficiency of the proposed approach.
Keywords: Solving triangular band linear systems, Parallel execution time, Load balancing, Precedence graph, Shared-memory multicore processor
