An optimal schedule for Gaussian elimination on an MIMD architecture

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:185

Article

关键词: MIMD;    scheduling;    gaussian elimination;   

DOI  :  10.1016/j.cam.2005.01.028

来源: Elsevier

【 摘 要 】

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. (c) 2005 Elsevier B.V. All rights reserved.

【 授权许可】

Free