## Analysis and Design of Scalable Parallel Algorithms for Scientific Computing (1995)

Citations: | 8 - 5 self |

### BibTeX

@MISC{Gupta95analysisand,

author = {Anshul Gupta},

title = {Analysis and Design of Scalable Parallel Algorithms for Scientific Computing},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

This dissertation presents a methodology for understanding the performance and scalability of algorithms on parallel computers and the scalability analysis of a variety of numerical algorithms. We demonstrate the analytical power of this technique and show how it can guide the development of better parallel algorithms. We present some new highly scalable parallel algorithms for sparse matrix computations that were widely considered to be poorly suitable for large scale parallel computers. We present some laws governing the performance and scalability properties that apply to all parallel systems. We show that our results generalize or extend a range of earlier research results concerning the performance of parallel systems. Our scalability analysis of algorithms such as fast Fourier transform (FFT), dense matrix multiplication, sparse matrix-vector multiplication, and the preconditioned conjugate gradient (PCG) provides many interesting insights into their behavior on parallel computer...