An optimal schedule for Gaussian elimination on an MIMD architecture

作者：

Highlights：

•

摘要

In this paper, we propose an algorithm for allocating the tasks of the well known Gaussian Elimination Algorithm on an MIMD architecture and prove that the schedule is optimal in order of magnitude, up to a polylog factor.

论文关键词：MIMD,Scheduling,Gaussian elimination

论文评审过程：Received 15 September 2003, Revised 26 January 2005, Available online 11 March 2005.

论文官网地址：https://doi.org/10.1016/j.cam.2005.01.028