Handling memory cache policy with integer points countings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1300 LNCS, Issue , 1997, Pages 285-293

  Clauss, Philippe ^a  

^a UNIVERSITÉ DE STRASBOURG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC METHOD; INTEGER POINT; LINEAR MAPPING; MATHEMATICAL PROBLEMS; MEMORY LOCATIONS; POLYTOPES;

CACHE MEMORY;

EID: 84882729664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0002746     Document Type: Conference Paper

References (16)

1. 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.
2. 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
3. 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
4. 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
5. 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.
6. 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
7. 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.
8. 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.
9. 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
10. C. Koelbel, D. Loveman, R. Schreiber, G. Steel, M. Zosel: The High Performance Fortran Handbook. The MIT Press. 1994.
11. 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.
12. W. Li: Compiler Optimizations for Cache Locality and Coherence. Technical report 504, University of Rochester, Department of Computer Science, April 1994.
13. 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
14. W. Pugh: The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, August 1992.
15. W. Pugh: Counting Solutions to Presburger Formulas: How and Why. Proc. of the 1994 ACM SIGPLAN Conference on Programming Language Design and Implementation, 1994.
16. H. S. Stone and D. Thiebaut: Footprints in the cache. Proc. ACM SIGMETRICS 1986, pp. 4-8, May 1986.