Scheduling algorithms for parallel Gaussian elimination with communication costs

Efficient algorithms for the parallel implementation of the Gaussian elimination method on message-passing architectures are presented. All the proposed algorithms consider the architecture parameters to perform the appropriate mapping of the tasks onto the processors. Their performances are compared with those of the general-purpose scheduling heuristic, DSC. Results indicate that both the generalized column-oriented scheduling and block scheduling perform better than DSC.