article · 2008

Performance Comparison of a Set of Periodic and Non�Periodic Tridiagonal Solvers on SP2 and Paragon Parallel Computers

Stuti Moitra

Cited by 0Abstract and details only

Abstract

Various tridiagonal solvers have been proposed in recent years for di�erent par� allel platforms. In this paper � the performance of three tridiagonal solvers � namely� the parallel partition LU algorithm � the parallel diagonal dominant algorithm � and the reduced diagonal dominant algorithm � is studied. These algorithms are designed for distributed�memory machines and are tested on an Intel Paragon and an IBM SP2 machines. Measured results are reported in terms of execution time and speedup. An� alytical study are conducted for di�erent communication topologies and for di�erent tridiagonal systems. The measured results match the analytical results closely. In ad� dition to address implementation issues � performance considerations such as problem sizes and models of speedup are also discussed.

Cite this paper

APA 7

Moitra, S. (2008). Performance Comparison of a Set of Periodic and Non�Periodic Tridiagonal Solvers on SP2 and Paragon Parallel Computers.

MLA 9

Moitra, Stuti. “Performance Comparison of a Set of Periodic and Non�Periodic Tridiagonal Solvers on SP2 and Paragon Parallel Computers.” 2008.

Chicago

Moitra, Stuti. 2008. “Performance Comparison of a Set of Periodic and Non�Periodic Tridiagonal Solvers on SP2 and Paragon Parallel Computers.”

Harvard

Moitra, S. (2008) ‘Performance Comparison of a Set of Periodic and Non�Periodic Tridiagonal Solvers on SP2 and Paragon Parallel Computers’.

BibTeX

@article{moitra2008performance,
  title = {{Performance Comparison of a Set of Periodic and Non�Periodic Tridiagonal Solvers on SP2 and Paragon Parallel Computers}},
  author = {Moitra, Stuti},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.