{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:05:33Z","timestamp":1748336733194,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002746","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"285-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Handling memory cache policy with integer points countings"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Clauss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/71.466632"},{"key":"34_CR2","first-page":"257","volume-title":"Int. Conf. PARCELLA'94","author":"P. Clauss","year":"1994","unstructured":"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\u2013266, Potsdam, Germany, Sept. 1994, Akademie Verlag. http:\/\/icps.u-strasbg.fr\/pub-94\/pub-94-15.ps.Z"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/237578.237617"},{"key":"34_CR4","unstructured":"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"},{"key":"34_CR5","unstructured":"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."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013235, San Francisco, California, IEEE Computer Society Press. http.\/\/icps.u-strasbg.fr\/pub-94\/pub-94-08.ps.Z","DOI":"10.1109\/ASAP.1994.331801"},{"key":"34_CR7","series-title":"International Series of Numerical Mathematics","volume-title":"Polyn\u00f4mes arithm\u00e9tiques et M\u00e9thode des Poly\u00e8dres en Combinatoire","author":"E. Ehrhart","year":"1977","unstructured":"E. Ehrhart: Polyn\u00f4mes arithm\u00e9tiques et M\u00e9thode des Poly\u00e8dres en Combinatoire. International Series of Numerical Mathematics, vol.35, Birkhauser Verlag, Basel\/Stuttgart, 1977."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"J. Ferrante, V. Sarkar and W. Thrash: On estimating and enhancing cache effectiveness. Advances in Languages and Compilers for Parallel Processing, pages 328\u2013343. The MIT Press, 1991.","DOI":"10.1007\/BFb0038674"},{"key":"34_CR9","unstructured":"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"},{"issue":"4","key":"34_CR10","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1063\/1.4823319","volume":"8","author":"Charles H. Koelbel","year":"1994","unstructured":"C. Koelbel, D. Loveman, R. Schreiber, G. Steel, M. Zosel: The High Performance Fortran Handbook. The MIT Press. 1994.","journal-title":"Computers in Physics"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"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\u201374, Palo Alto, California, April 1991.","DOI":"10.1145\/106972.106981"},{"key":"34_CR12","unstructured":"W. Li: Compiler Optimizations for Cache Locality and Coherence. Technical report 504, University of Rochester, Department of Computer Science, April 1994."},{"key":"34_CR13","unstructured":"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"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"8","author":"W. Pugh","year":"1992","unstructured":"W. Pugh: The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102\u2013114, August 1992.","journal-title":"Communications of the ACM"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"W. Pugh: Counting Solutions to Presburger Formulas: How and Why. Proc. of the 1994 ACM SIGPLAN Conference on Programming Language Design and Implementation, 1994.","DOI":"10.1145\/178243.178254"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"H. S. Stone and D. Thiebaut: Footprints in the cache. Proc. ACM SIGMETRICS 1986, pp. 4\u20138, May 1986. *** DIRECT SUPPORT *** A0008C42 00010","DOI":"10.1145\/317531.317533"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:02:24Z","timestamp":1736114544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0002746","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}