A parallel version of Polyflow

Debae, F.;Jiang, Y;Marchal, JM.;Henriksen, P.
(1995) International Conference and Exhibition on High-Performance Computing and Networking — Location: MILAN(Italy) (3.May.1995)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 288.96 KB
Request a copy

Details

Authors
  • Debae, F.
    Author
  • Jiang, Y
    Author
  • Marchal, JM.
    Author
  • Henriksen, P.
    Author
Abstract
A domain decomposition technique is used to introduce coarse grain parallelism in the Polyflow solver. Two methods are used: either on a full direct approach (implementing a nested dissection algorithm on the top of a frontal solver), or an hybrid direct/iterative approach. Results on non-elliptic flow problems are presented. Parallel efficiencies which can even be super-linear on a relatively small number of processors are reported. An original non-deterministic heuristic helps the user to find a suitable elimination tree.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Debae, F., Jiang, Y., Marchal, JM., & Henriksen, P. (1995). A parallel version of Polyflow. Lecture Notes in Computer Science, 919, 826-830. https://doi.org/10.1007/BFb0046721 (Original work published 1995)