z-logo
open-access-imgOpen Access
Exploiting monotone convergence functions in parallel programs
Author(s) -
William Pugh,
Evan Rosser,
Tatiana Shpeisman
Publication year - 1997
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-63091-0
DOI - 10.1007/bfb0017246
Subject(s) - computer science , parallelism (grammar) , compiler , exploit , convergence (economics) , monotone polygon , parallel computing , reduction (mathematics) , theoretical computer science , optimizing compiler , mathematical optimization , algorithm , mathematics , programming language , geometry , computer security , economics , economic growth
Scientific codes which use iterative methods are often difficult to parallelize well. Such codesusually contain while loops which iterate until they converge upon the solution. Problems arisesince the number of iterations cannot be determined at compile time, and tests for terminationusually require a global reduction and an associated barrier. We present a method which allowsus avoid performing global barriers and exploit pipelined parallelism when processors can detect...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom