Abstract: In this paper two parallel algorithms for solving dense linear equations arediscussed. The algorithms are based on LU-decomposition followed by forward andbackward substitutions. The algorithms are numerically stable and have been testedon the Sequent Balance Machine with efficient utilization of all processors.

Key words: LU decomposition, forward and backward substitutions, MIMD machine, multi-tasking, theoretical cost