Performance of iterative methods for distributed memory machines

  • Marinescu D
  • Rice J
  • Vavalis E
  • 3

    Readers

    Mendeley users who have this article in their library.
  • 2

    Citations

    Citations of this article.

Abstract

We consider iterative methods for the large linear systems arising from partial differential equation problems on nonrectangular domains. These are somewhat banded but otherwise of no special structure beyond being sparse. We study the implementations and performance of several iterative methods on hypercube machines and we examine in detail the effects of communication and synchronization delays. Models are presented for these computations and projections made about performance for massively parallel machines. We conclude that it is currently difficult to achieve the potential of parallel machines for such methods. Some approaches for improving efficiency are suggested. © 1993.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Manolis VavalisElectrical and Computer Engineering, University of Thessaly

    Follow
  • D. C. Marinescu

  • J. R. Rice

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free