Designing PDE software for vector computers as a “data flow algorithm”

The best we can do on existing vector computers is to device algorithms which maintain a continuous data flow. For large 3-D problems the I/O is the decisive bottleneck. An optimal data structure for each separate task is the key for an efficient algorithm. How to devise such algorithms for the solu...

Full description

Saved in:
Bibliographic Details
Published inComputer physics communications Vol. 37; no. 1; pp. 233 - 237
Main Authors Schönauer, W., Schnepf, E., Müller, H.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.01.1985
Online AccessGet full text
ISSN0010-4655
1879-2944
DOI10.1016/0010-4655(85)90157-2

Cover

More Information
Summary:The best we can do on existing vector computers is to device algorithms which maintain a continuous data flow. For large 3-D problems the I/O is the decisive bottleneck. An optimal data structure for each separate task is the key for an efficient algorithm. How to devise such algorithms for the solution of large 3-D elliptic problems by the finite difference method is demonstrated in the paper.
ISSN:0010-4655
1879-2944
DOI:10.1016/0010-4655(85)90157-2