Volume 55, Number 2, March-April 2021
|Page(s)||545 - 559|
|Published online||31 March 2021|
Design, analysis and performance evaluation of parallel algorithms for solving triangular linear systems on multicore platforms*
Faculty of Letters and Humanities, University of Sousse, Sousse, Tunisia
2 Department of Computer Sciences and Communication, Faculty of Sciences, University of Sfax, Sfax, Tunisia
Accepted: 18 January 2021
In this paper, we focus on the schedulings of 2-steps graph with constant task cost obtained when parallelizing algorithm solving a triangular linear system. We present three scheduling approaches having the same least theoretical execution time. The first is designed through solving a 0-1 integer problem by Mixed Integer Programming (MIP), the second is based on the Critical Path Algorithm (CPA) and the third is a particular Column-Oriented Scheduling (COS). The MIP approach experiments were carried out and confirmed that the makespan values of the MIP scheduling coincide with those of the corresponding lower bound already reached. Experimental results of the last two approaches detailing both makespans and efficiencies are presented and show that their practical performances differ though they are theoretically identical. We compare also these results to those of the appropriate procedure into so-called PLASMA library (Parallel Linear Algebra for Scalable Multi-core Architectures).
Mathematics Subject Classification: 90C10 / 68M20 / 65F05
Key words: 0-1 integer problem / task scheduling / parallel algorithm / PLASMA library / triangular linear system
© EDP Sciences, ROADEF, SMAI 2021
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.