Abstract
This paper describes the implementation and performance results for a few standard linear algebra routines on the Denelcor HEP computer. The algorithms used here are based on high-level modules that facilitate portability and perform efficiently in a wide range of environments. The modules are chosen to be of a large enough computational granularity so that reasonably optimum performance may be insured. The design of algorithms with such fundamental modules in mind will also facilitate their replacement by others more suited to gain the desired performance on a particular computer architecture.
| Original language | English |
|---|---|
| Pages (from-to) | 133-142 |
| Number of pages | 10 |
| Journal | Parallel Computing |
| Volume | 1 |
| Issue number | 2 |
| DOIs | |
| State | Published - Dec 1984 |
| Externally published | Yes |
Funding
The basic algorithms used here are the same as those reported in a paper by Dongarra and Eisenstat \[1\]( with the exception of QR factorization). These algorithms are based on standard procedures in linear algebra. They have been written to retain much of the original .mathematical formulation and are based on matrix-vector operations. Designing the algorithms in terms of such operations is the hard part of an implementation. By understanding the algorithm in terms * This work was supported in part by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under contracts W-31-109-Eng-38 and W-7405-ENG-36.
| Funders | Funder number |
|---|---|
| Office of Energy Research | |
| U.S. Department of Energy | W-7405-ENG-36, W-31-109-Eng-38 |
Keywords
- HEP computer
- assembly language programming
- linear algebra routines
- parallel computer
- performance analysis parallel algorithms