Comparison of parallel scheduling for triangular system resolution on multi-core processors
Mounira Belmabrouk, Mounir Marrakchi · 2017
In this paper, we present two parallel scheduling resolving linear triangular system: on the one hand Column-Oriented-Scheduling (COS) and Critical Path Algorithm (CPA) on the other hand through which, theoretically, their execution time reaches the lower bound of makespan without communication costs. These algorithms are implemented on the GRID'5000 and some experimental results are presented for comparing experimentally makespans and efficiencies with that of the appropriate routine belonging to library called PLASMA (Parallel Linear Algebra Software for Multi-core Architectures).