Optimal parallel scheduling for resolution a triangular system with availability constraints

We present in this paper a parallel scheduling for resolution a triangular system. In order to have the possibilities of deleting or adding a processor, we study also its behaviour by taking into account the constraint of processors availability. For p identical processors, we show theoretical its optimality and we compare its experimental performances to those of parallel BLAS routine.