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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel algorithms and applications Ročník 11; číslo 1-2; s. 129 - 153
Hlavní autoři: AKL, S. G., LINDON, L. FAVA
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis Group 01.01.1997
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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