Abstract
In order to achieve a high performance increase of a given program, a large search tree of program transformation sequences has to be analyzed by a parallelizes A common way to prune a search tree is to restrict transformations to the computation intensive program parts. Frequently, only a small part of a given application program represents a large portion of the overall runtime of the program. It is a crucial problem to find these performance intensive program parts in the original sequential program. As a consequence the parallelizer can converge the parallelization effort to these program sections. Our approach enables the user to find these program parts by runtime profiling.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Fahringer, T. (1996). Sequential Program Parameters. In: Automatic Performance Prediction of Parallel Programs. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1371-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1371-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8592-2
Online ISBN: 978-1-4613-1371-7
eBook Packages: Springer Book Archive