Abstract
Many studies have shown that significant levels of parallelism can be extracted from ordinary programs if a processor can accurately look ahead arbitrarily far into the dynamic instruction stream. Control flow changes caused by conditional branches are a major impediment to determining which of the distant instructions belong to the dynamic instruction stream. This paper highlights the importance of exploiting control independence information for extracting this “distant parallelism”. We describe a methodology to find the maximum parallelism available when exploiting control independence. Our study with this tool shows that putting control independence to work has the potential to provide high performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Austin, T.M., Sohi, G.S.: Dynamic Dependency Analysis of Ordinary Programs. In: Proc. 19th Int’l Symposium on Computer Architecture, pp. 342–351 (1992)
Cytron, R., Ferrante, J., Rosen, B., Wegman, M., Zadeck, F.: Efficiently Computing Static Single Assignment Form and the Control Dependence Graph. ACM Trans. Programming Languages and Systems 13(4), 451–490 (1991)
Dubey, P., O’Brien, K., O’Brien, K.M., Barton, C.: Single-Program Speculative Multithreading (SPSM) Architecture: Compiler-assisted Fine-Grained Multithreading. In: Proc. Int’l Conf. on Parallel Architecture and Compilation Techniques, PACT 1995 (1995)
Lam, M.S., Wilson, R.P.: Limits of Control Flow on Parallelism. In: Proc. 19th Int’l Symposium on Computer Architecture, pp. 46–57 (1992)
Postiff, M., Greene, D., Tyson, G., Mudge, T.: The limits of instructions level parallelism in SPEC95 applications. In: Proc. 3rd Workshop on Interaction Between Compilers and Computer Architecture, INTERACT-3 (1998)
Rotenberg, E., Jacobson, Q., Smith, J.E.: A Study of Control Independence in Superscalar Processors. In: Proc. Int’l Symposium on High Performance Computer Architecture, HPCA (1999)
Theobald, K.B., Gao, G.R., Hendren, L.J.: On the Limits of Program Parallelism and its Smoothability. In: Proc. 25th Int’l Symposium on Microarchitecture (MICRO-25), pp. 10–19 (1992)
Yeh, T.-Y., Patt, Y.N.: Alternative Implementations of Two-Level Adaptive Branch Prediction. In: Proc. 19th Int’l Symposium on Computer Architecture, pp. 124–134 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vadlapatla, S., Franklin, M. (1999). Performance Benefits of Exploiting Control Independence. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive