Exploiting Monotone Convergence Functions in Parallel Programs
| dc.contributor.author | Pugh, William | en_US |
| dc.contributor.author | Rosser, Evan | en_US |
| dc.contributor.author | Shpeisman, Tatiana | en_US |
| dc.date.accessioned | 2004-05-31T22:39:05Z | |
| dc.date.available | 2004-05-31T22:39:05Z | |
| dc.date.created | 1996-10 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.abstract | Scientific codes which use iterative methods are often difficult to parallelize well. Such codes usually contain \code{while} loops which iterate until they converge upon the solution. Problems arise since the number of iterations cannot be determined at compile time, and tests for termination usually require a global reduction and an associated barrier. We present a method which allows us avoid performing global barriers and exploit pipelined parallelism when processors can detect non-convergence from local information. (Also cross-referenced as UMIACS-TR-96-31.1) | en_US |
| dc.format.extent | 462043 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/816 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3636.1 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-96-31.1 | en_US |
| dc.title | Exploiting Monotone Convergence Functions in Parallel Programs | en_US |
| dc.type | Technical Report | en_US |