Performance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithm

Simple item page
dc.contributor.authorGamble, Jimen
dc.contributor.authorRibbens, Calvin J.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:35:44Zen
dc.date.available2013-06-19T14:35:44Zen
dc.date.issued1989en
dc.description.abstractWe 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.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000174/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000174/01/TR-89-37.pdfen
dc.identifier.trnumberTR-89-37en
dc.identifier.urihttp://hdl.handle.net/10919/19558en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titlePerformance Comparison of Three Parallel Implementations of a SchwarzSplitting Algorithmen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-89-37.pdf
Size:
888.82 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports