1 we propose and analyze two low complexity algorithms for scheduling the tasks of the parallel gaussian elimination on an unbounded number of completely connected processors