Performance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithm
| dc.contributor.author | Gamble, Jim | en |
| dc.contributor.author | Ribbens, Calvin J. | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2013-06-19T14:35:44Z | en |
| dc.date.available | 2013-06-19T14:35:44Z | en |
| dc.date.issued | 1989 | en |
| dc.description.abstract | 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. | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier | http://eprints.cs.vt.edu/archive/00000174/ | en |
| dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000174/01/TR-89-37.pdf | en |
| dc.identifier.trnumber | TR-89-37 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/19558 | en |
| dc.language.iso | en | en |
| dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
| dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.title | Performance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithm | en |
| dc.type | Technical report | en |
| dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1