Abstract
We propose an automatic method allowing the computation of useful information on the distribution of data in the memory cache. The number of distinct memory locations touched by a loop is computed. It is shown that these problems are relevant to the same general mathematical problem, which is the counting of the exact number of integer points resulting from linear mappings of polytopes.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Agarwal, D.A. Kranz and V. Natarajan. Automatic Partitioning of Parallel Loops and Data Arrays for Distributed Shared-Memory Multiprocessors. IEEE Trans. on Parall. and Distrib. Syst., Vol. 6, NO. 9, Sept. 1995.
Ph. Clauss: An efficient allocation strategy for mapping affine recurrences into space and time optimal regular processor arrays. In C. Jesshope, V. Jossifov and W. Wilhelmi editors, Int. Conf. PARCELLA'94, pages 257–266, Potsdam, Germany, Sept. 1994, Akademie Verlag. http://icps.u-strasbg.fr/pub-94/pub-94-15.ps.Z
Ph. Clauss: Counting Solutions to Linear and Nonlinear Constraints through Ehrhart polynomials: Applications to Analyze and Transform Scientific Programs. 10th ACM Int. Conf. on Supercomputing, Philadelphia, May 1996. Also available as Research Report ICPS 96-03. http://icps.u-strasbg.fr/pub-96/pub-96-03.ps.gz
Ph. Clauss and V. Loechner: Parametric Analysis of Polyhedral Iteration Spaces. IEEE Int. Conf. on Application Specific Array Processors, ASAP'96, Chicago, Illinois, August 1996. Also available as Research Report ICPS 96-04. http://icps.u-strasbg.fr/pub-96/pub-96-04.ps.gz
Ph. Clauss and V. Loechner: Parametric Analysis of Polyhedral Iteration Spaces (extended version). To appear in Journal of VLSI Signal Processing, Kluwer Academic Pub., 1997.
Ph. Clauss and G.-R. Perrin: Optimal mapping of systolic algorithms by regular instruction shifts, Int. Conf on Application-Specific Array Processors, ASAP'94, pages. 224–235, San Francisco, California, IEEE Computer Society Press. http.//icps.u-strasbg.fr/pub-94/pub-94-08.ps.Z
E. Ehrhart: Polynômes arithmétiques et Méthode des Polyèdres en Combinatoire. International Series of Numerical Mathematics, vol.35, Birkhauser Verlag, Basel/Stuttgart, 1977.
J. Ferrante, V. Sarkar and W. Thrash: On estimating and enhancing cache effectiveness. Advances in Languages and Compilers for Parallel Processing, pages 328–343. The MIT Press, 1991.
D.-C. R. Ju, J.-F. Collard and K. Oukbir: Probabilistic Memory Disambiguation and its Application to Data Speculation. Research Report PRiSM 96-010, 1996. ftp://ftp.prism.uvsq.fr/pub/reports/1996/1996.010.ps.gz
C. Koelbel, D. Loveman, R. Schreiber, G. Steel, M. Zosel: The High Performance Fortran Handbook. The MIT Press. 1994.
M. S. Lam, E. E. Rothberg and M. E. Wolf: The cache performance and optimizations of blocked algorithms. In Proc. 4th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, ASPLOS IV, pages 63–74, Palo Alto, California, April 1991.
W. Li: Compiler Optimizations for Cache Locality and Coherence. Technical report 504, University of Rochester, Department of Computer Science, April 1994.
V. Loechner and D. K. Wilde: Parameterized polyhedra and their vertices. Research Report ICPS 96-09, 1996. http://icps.u-strasbg.fr/pub-96/pub-96-09.ps.gz
W. Pugh: The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102–114, August 1992.
W. Pugh: Counting Solutions to Presburger Formulas: How and Why. Proc. of the 1994 ACM SIGPLAN Conference on Programming Language Design and Implementation, 1994.
H. S. Stone and D. Thiebaut: Footprints in the cache. Proc. ACM SIGMETRICS 1986, pp. 4–8, May 1986. *** DIRECT SUPPORT *** A0008C42 00010
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clauss, P. (1997). Handling memory cache policy with integer points countings. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002746
Download citation
DOI: https://doi.org/10.1007/BFb0002746
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive