|
|||||
|
|
An optimal schedule for Gaussian elimination on an MIMD architecture |
|
| Affiliation: | 40#114 Charles Albanel Street, Gatineau (Québec), Canada J8Z 1R2 |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |