Abstract
Numerical software for sequential or parallel machines with memory hierarchies can benefit from locality optimizations which are usually achieved by program restructuring or program transformations. The choice of the program version that achieves the best performance is usually complex as many dependencies have to be taken into account. Thus program-based locality measures have been introduced to give programmers a guideline if a performance gain can be expected from a program restructuring. The novel contribution of this paper is the extension of these locality measures to support spatial locality. These extended measures are applied to two applications from scientific computing and the obtained prediction is compared to benchmark results.
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.
References
Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures. Academic Press, London (2002)
Rauber, T., Rünger, G.: Program-based locality measures for scientific computing. International Journal of Foundations of Computer Science 15, 535–554 (2004)
Hairer, E., Nørsett, S., Wanner, G.: Solving Ordinary Differential Equations, 2nd edn., vol. 1. Springer, Heidelberg (2002)
Rauber, T., Rünger, G.: Parallel Execution of Embedded and Iterated Runge-Kutta Methods. Concurrency - Practice and Experience 11, 367–385 (1999)
Hairer, E., Wanner, G.: Solving Ordinary Differential Equations, 2nd edn., vol. 2. Springer, Heidelberg (2004)
Ghosh, S., Martonosi, M., Malik, S.: Cache miss equations: An analytical representation of cache misses. In: Int. Conf. on Supercomputing, pp. 317–324 (1997)
Ghosh, S., Martonosi, M., Malik, S.: Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems 21, 703–746 (1999)
Ferdinand, C., Wilhelm, R.: Efficient and precise cache behavior prediction for real-time systems. Real-Time Syst. 17, 131–181 (1999)
Lam, M., Rothberg, E., Wolf, M.: The cache performance and optimizations of blocked algorithms. In: Proc. of the 4th Int. Conf. on Architectural support for programming languages and operating systems, pp. 63–74. ACM Press, New York (1991)
Rodriguez, B., Jordan, H., Alaghband, G.: A Metric for the Temporal Characterization of Parallel Programs. Journal of Parallel and Distributed Computing 46, 113–124 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dümmler, J., Rauber, T., Rünger, G. (2006). Combining Measures for Temporal and Spatial Locality. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_72
Download citation
DOI: https://doi.org/10.1007/11942634_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49860-5
Online ISBN: 978-3-540-49862-9
eBook Packages: Computer ScienceComputer Science (R0)