Performance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithm
1989) Performance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithm. Technical Report TR-89-37, Computer Science, Virginia Polytechnic Institute and State University. (
Full text available as:
We describe three implementations of a Schwarz splitting algorithm for the numerical solution of two dimensional, second-order, linear elliptical partial differential equations. One implementation makes use of the SCHEDULE package. A second uses the language extensions available in SEQUENT Fortran for creating and controlling parallel processes. The third implementation is a hybrid of the first two -- using explicit (non-portable) calls to create a control parallel processes, but using data structures and overhead similar to the implementation that uses SCHEDULE. We report from several experiments with typical test problems on a Sequent Symmetry S81 shared-memory multiprocessor. We measure the overhead involved in using SCHEDULE, and discuss advantages and disadvantages of this approach.
|Item Type:||Departmental Technical Report|
|Subjects:||Computer Science > Historical Collection(Till Dec 2001)|
|Deposited By:||User autouser|
|Deposited On:||05 December 2001|