PARADIGMS ADMITTING SUPERUNITARY BEHAVIOUR IN PARALLEL COMPUTATION

With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold universally. In particular, the speedup theorem and Brent's theorem do not apply to dynamic computers that interact with their environment. The p...

Full description

Saved in:
Bibliographic Details
Published in:Parallel algorithms and applications Vol. 11; no. 1-2; pp. 129 - 153
Main Authors: AKL, S. G., LINDON, L. FAVA
Format: Journal Article
Language:English
Published: Taylor & Francis Group 01.01.1997
Subjects:
1.2.9 (Robotics)
Brent's theorem
F.1.1 (Models of Computation)
F.1.2 (Modes of Computation)
F.2.2 (Nonnumerical Algorithms and Problems)
G.3 (Probability and Statistics)
parallel computation
speedup theorem
superlinear speedup
superunitary speedup
ISSN:1063-7192
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the expanding role of computers in society, some assumptions underlying well known theorems in the theory of parallel computation no longer hold universally. In particular, the speedup theorem and Brent's theorem do not apply to dynamic computers that interact with their environment. The phenomenon of a disproportionate decrease in execution time of P 2 over p 1 processors for p 2 > p 1 is referred to as superunitary speedup. An analogous phenomenon that we call superunilary 'success ratio' occurs in dealing with tasks that can either succeed or fail, when there is a disproportionate increase in the success of p2 over p1 processors executing a task. We identify a range of conditions that may lead to superunitary speedup or success ratio, and propose several new paradigms for problems that admit such superunitary behaviour. Our results suggest that a new theory of parallel computation may be required to accommodate these new paradigms.
ISSN:1063-7192
DOI:10.1080/10637199708915591