DMCA
Limits of Control Flow on Parallelism (1992)
Download From
IEEE
Download Links
- [suif.stanford.edu]
- [www.cag.lcs.mit.edu]
- [web.cecs.pdx.edu]
- [web.cecs.pdx.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 19th Annual International Symposium on Computer Architecture |
| Citations: | 255 - 2 self |
BibTeX
@INPROCEEDINGS{Lam92limitsof,
author = {Monica S. Lam and Robert P. Wilson},
title = {Limits of Control Flow on Parallelism},
booktitle = {In Proceedings of the 19th Annual International Symposium on Computer Architecture},
year = {1992},
pages = {46--57}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper discusses three techniques useful in relaxing the constraints imposed by control flow on parallelism: control dependence analysis, executing multiple flows of control simultaneously, and speculative execution. We evaluate these techniques by using trace simulations to find the limits of parallelism for machines that employ different combinations of these techniques. We have three major results. First, local regions of code have limited parallelism, and control dependence analysis is useful in extracting global parallelism from different parts of a program. Second, a superscalar processor is fundamentally limited because it cannot execute independent regions of code concurrently. Higher performance can be obtained with machines, such as multiprocessors and dataflow machines, that can simultaneously follow multiple flows of control. Finally, without speculative execution to allow instructions to execute before their control dependences are resolved, only modest amounts of para...
Keyphrases
control flow speculative execution multiple flow control dependence different combination modest amount dataflow machine trace simulation global parallelism control dependence analysis execute independent region superscalar processor different part dependence analysis major result local region
