{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T20:40:12Z","timestamp":1712695212345},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T00:00:00Z","timestamp":1312934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s11227-011-0660-y","type":"journal-article","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T09:45:33Z","timestamp":1312883133000},"page":"935-965","source":"Crossref","is-referenced-by-count":1,"title":["Data locality optimization of interference graphs based on polyhedral computations"],"prefix":"10.1007","volume":"61","author":[{"given":"Hassan","family":"Motallebi","sequence":"first","affiliation":[]},{"given":"Saeed","family":"Parsa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,10]]},"reference":[{"issue":"2","key":"660_CR1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1006\/jpdc.1999.1552","volume":"58","author":"M Kandemir","year":"1999","unstructured":"Kandemir M, Choudhary A, Ramanujam J, Banerjee P (1999) A matrix-based approach to global locality optimization. J Parallel Distrib Comput 58(2):190\u2013235","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"660_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1013535431127","volume":"21","author":"V Loechner","year":"2002","unstructured":"Loechner V, Meister B, Clauss P (2002) Precise data locality optimization of nested loops. J Supercomput 21(1):37\u201376","journal-title":"J Supercomput"},{"key":"660_CR3","volume-title":"Optimizing compilers for modern architectures","author":"R Allen","year":"2001","unstructured":"Allen R, Kennedy K (2001) Optimizing compilers for modern architectures. Kaufmann, San Mateo"},{"key":"660_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/3-540-36579-6_23","volume-title":"CC\u201912 int conf on compiler construction","author":"C Bastoul","year":"2003","unstructured":"Bastoul C, Feautrier P (2003) Improving data locality by chunking. In: CC\u201912 int conf on compiler construction. Lecture notes in computer science, vol 2622, pp 320\u2013335"},{"key":"660_CR5","first-page":"406","volume-title":"Proc of the 7th int workshop on languages and compilers for parallel computing","author":"A Bik","year":"1994","unstructured":"Bik A, Knijnenburg P, Wijshoff H (1994) Reshaping access patterns for generating sparse codes. In: Proc of the 7th int workshop on languages and compilers for parallel computing, NY, USA, pp 406\u2013422"},{"key":"660_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/207110.207162","volume-title":"Proc of the ACM SIGPLAN conf on programming language design and implementation (PLDI \u201995)","author":"S Coleman","year":"1995","unstructured":"Coleman S, McKinley K (1995) Tile size selection using cache organization and data layout. In: Proc of the ACM SIGPLAN conf on programming language design and implementation (PLDI \u201995), La\u00a0Jolla, California, USA, pp 279\u2013290"},{"key":"660_CR7","unstructured":"Li W (1993) Compiling for NUMA parallel machines. PhD thesis, Computer Science Department, Cornell University, NY"},{"key":"660_CR8","first-page":"19","volume-title":"Proc of the 24th int conf on parallel processing (ICPP\u201995)","author":"N Manjikian","year":"1995","unstructured":"Manjikian N, Abdelrahman T (1995) Fusion of loops for parallelism and locality. In: Proc of the 24th int conf on parallel processing (ICPP\u201995), Oconomowoc, Wisconsin, vol\u00a0II, pp 19\u201328"},{"issue":"4","key":"660_CR9","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/233561.233564","volume":"18","author":"K McKinley","year":"1996","unstructured":"McKinley K, Carr S, Tseng C (1996) Improving data locality with loop transformations. ACM Trans Program Lang Syst, 18(4):424\u2013453","journal-title":"ACM Trans Program Lang Syst"},{"key":"660_CR10","first-page":"30","volume-title":"Proc of the SIGPLAN \u201991 conf on programming language design and implementation","author":"M Wolf","year":"1991","unstructured":"Wolf M, Lam M (1991) A data locality optimizing algorithm. In: Proc of the SIGPLAN \u201991 conf on programming language design and implementation, Toronto, Ontario, pp 30\u201344"},{"key":"660_CR11","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/76263.76337","volume-title":"Proc of supercomputing \u201989","author":"M Wolfe","year":"1989","unstructured":"Wolfe M (1989) More iteration space tiling. In: Proc of supercomputing \u201989, Reno, Nevada, pp 655\u2013664"},{"key":"660_CR12","first-page":"69","volume-title":"Proc of the 1998 ACM int conf on supercomputing (ICS\u201998)","author":"M Kandemir","year":"1998","unstructured":"Kandemir M, Choudhary A, Shenoy N, Banerjee P, Ramanujam J (1998) A hyperplane based approach for optimizing spatial locality in loop nests. In: Proc of the 1998 ACM int conf on supercomputing (ICS\u201998), Melbourne, Australia, pp 69\u201376"},{"issue":"2","key":"660_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/71.752779","volume":"10","author":"M Kandemir","year":"1999","unstructured":"Kandemir M, Choudhary A, Shenoy N, Banerjee P, Ramanujam J (1999) A linear algebra framework for automatic determination of optimal data layouts. IEEE Trans Parallel Distrib Syst 10(2):115\u2013135","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"660_CR14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1018744411700","volume":"27","author":"M O\u2019Boyle","year":"1999","unstructured":"O\u2019Boyle M, Knijnenburg P (1999) Non-singular data transformations: definition, validity, and applications. Int J Parallel Program 27(1):131\u2013159","journal-title":"Int J Parallel Program"},{"key":"660_CR15","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/277650.277661","volume-title":"The ACM SIGPLAN conf on programming language design and implementation (PLDI\u201998)","author":"G Rivera","year":"1998","unstructured":"Rivera G, Tseng C (1998) Data transformations for eliminating conflict misses. In: The ACM SIGPLAN conf on programming language design and implementation (PLDI\u201998), Montreal, Canada, pp\u00a038\u201349"},{"issue":"7","key":"660_CR16","first-page":"564","volume":"65","author":"M Kandemir","year":"2004","unstructured":"Kandemir M (2004) Improving whole-program locality using intra-procedural and inter-procedural transformations. J Parallel Distrib Comput 65(7):564\u2013582","journal-title":"J Parallel Distrib Comput"},{"key":"660_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/MICRO.1998.742790","volume-title":"Proc of the 31st int symp on microarchitecture (MICRO-31)","author":"M Kandemir","year":"1998","unstructured":"Kandemir M, Choudhary A, Ramanujam J, Banerjee P (1998) Improving locality using loop and data transformations in an integrated framework. In: Proc of the 31st int symp on microarchitecture (MICRO-31), Dallas, Texas, pp 285\u2013296"},{"issue":"4","key":"660_CR18","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1006\/jpdc.2001.1815","volume":"62","author":"M O\u2019Boyle","year":"2002","unstructured":"O\u2019Boyle M, Knijnenburg P (2002) Integrating loop and data transformations for global optimization. J Parallel Distrib Comput 62(4):563\u2013590","journal-title":"J Parallel Distrib Comput"},{"key":"660_CR19","first-page":"738","volume-title":"Proc of the 1999 int parallel processing symp (IPPS\u201999)","author":"M Kandemir","year":"1999","unstructured":"Kandemir M, Choudhary A, Ramanujam J, Banerjee P (1999) A graph based framework to detect optimal memory layouts for improving data locality. In: Proc of the 1999 int parallel processing symp (IPPS\u201999), San Juan, Puerto Rico, pp 738\u2013743"},{"key":"660_CR20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/ICPP.1994.59","volume-title":"Proc of the 1994 int conf on parallel processing (ICPP\u201994)","author":"W Blume","year":"1994","unstructured":"Blume W, Eigenmann R (1994) An overview of symbolic analysis techniques needed for the effective parallelization of the PERFECT benchmarks. In: Proc of the 1994 int conf on parallel processing (ICPP\u201994), North Carolina State University, vol\u00a0II, pp 233\u2013238"},{"key":"660_CR21","first-page":"262","volume-title":"Proc of the 7th int Euro-Par conf Manchester on parallel processing","author":"V Loechner","year":"2001","unstructured":"Loechner V, Meister B, Clauss P (2001) Data sequence locality: a generalization of temporal locality. In: Proc of the 7th int Euro-Par conf Manchester on parallel processing, UK, pp 262\u2013272"},{"issue":"6","key":"660_CR22","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/A:1025117523902","volume":"25","author":"V Loechner","year":"1997","unstructured":"Loechner V, Wilde D (1997) Parameterized polyhedra and their vertices. Int J Parallel Program, 25(6):525\u2013549","journal-title":"Int J Parallel Program"},{"key":"660_CR23","first-page":"112","volume-title":"Proc SIGPLAN conf on programming language design and implementation (PLDI\u201993)","author":"J Anderson","year":"1993","unstructured":"Anderson J, Lam M (1993) Global optimizations for parallelism and locality on scalable parallel machines. In: Proc SIGPLAN conf on programming language design and implementation (PLDI\u201993), Albuquerque, New Mexico, pp 112\u2013125"},{"key":"660_CR24","unstructured":"Wilde D (1993) A library for doing polyhedral operations. Technical report PI 785, IRISA, Rennes, France"},{"key":"660_CR25","series-title":"Lecture notes in computer science","first-page":"23","volume-title":"Proc of the workshop on languages and compilers for parallel computing (LCPC\u201903)","author":"C Bastoul","year":"2003","unstructured":"Bastoul C, Cohen A, Girbal A, Sharma S, Temam O (2003) Putting polyhedral loop transformations to work. In: Proc of the workshop on languages and compilers for parallel computing (LCPC\u201903), Texas, USA. Lecture notes in computer science, vol 2558, pp 23\u201330"},{"key":"660_CR26","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-61736-1_44","volume-title":"The data parallel programming model","author":"P Feautrier","year":"1996","unstructured":"Feautrier P (1996) Automatic parallelization in the polytope model. In: The data parallel programming model. Lecture notes in computer science, vol 1132, pp 79\u2013103"},{"key":"660_CR27","first-page":"543","volume-title":"Proc of the 5th SIAM conf on parallel processing for scientific computing","author":"J Ramanujam","year":"1992","unstructured":"Ramanujam J (1992) A linear algebraic view of loop transformations and their interaction. In: Sorensen D (ed) Proc of the 5th SIAM conf on parallel processing for scientific computing. SIAM, Philadelphia, pp 543\u2013548"},{"key":"660_CR28","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, New York"},{"key":"660_CR29","first-page":"39","volume-title":"Proc of the 3rd ACM SIGPLAN symp principle and practice of parallel programming","author":"C Ancourt","year":"1991","unstructured":"Ancourt C, Irigoin F (1991) Scanning polyhedra with DO loops. In: Proc of the 3rd ACM SIGPLAN symp principle and practice of parallel programming, Williamsburg, USA, pp 39\u201350"},{"key":"660_CR30","unstructured":"Bastoul C (2002) Generating loops for scanning polyhedra\u2014CLooG user\u2019s guide. Technical report 2002\/23, PRiSM, Versailles University, France"},{"key":"660_CR31","unstructured":"Le Verge H, Van Dongen V, Wilde D (1994) Loop nest synthesis using the polyhedral library. Technical report 830, IRISA, Rennes, France"},{"issue":"5","key":"660_CR32","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1023\/A:1007554627716","volume":"28","author":"S Rajopadhye","year":"2000","unstructured":"Rajopadhye S, Quiller\u00e9 F, Wilde D (2000) Generation of efficient nested loops from polyhedra. Int\u00a0J Parallel Program, 28(5):469\u2013498","journal-title":"Int\u00a0J Parallel Program"},{"key":"660_CR33","volume-title":"High performance compilers for parallel computing","author":"M Wolfe","year":"1996","unstructured":"Wolfe M (1996) High performance compilers for parallel computing. Addison-Wesley, Reading"},{"issue":"8","key":"660_CR34","doi-asserted-by":"crossref","first-page":"688","DOI":"10.4169\/193009709X460813","volume":"116","author":"SV Sam","year":"2009","unstructured":"Sam SV (2009) A bijective proof for a theorem of Ehrhart. Am Math Mon 116(8):688\u2013701","journal-title":"Am Math Mon"},{"key":"660_CR35","doi-asserted-by":"crossref","unstructured":"Clauss P (1996) Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs. Research report ICPS 96-03, 10th ACM int conf on Supercomputing (ICS\u201996), Philadelphia, Pennsylvania, USA, pp 278\u2013285","DOI":"10.1145\/237578.237617"},{"issue":"4","key":"660_CR36","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02577771","volume":"23","author":"C Ancourt","year":"1995","unstructured":"Ancourt C, Irigoin F, Yang Y (1995) Minimal data dependence abstractions for loop transformations. Int J Parallel Program, 23(4):359\u2013388","journal-title":"Int J Parallel Program"},{"key":"660_CR37","first-page":"10506","volume-title":"Proc of the design, automation and test in Europe conf and exhibition (DATE\u2019 04)","author":"M Kandemir","year":"2004","unstructured":"Kandemir M (2004) Impact of data transformations on memory bank locality. In: Proc of the design, automation and test in Europe conf and exhibition (DATE\u2019 04), Paris, France, vol\u00a01, pp 10506\u201310511"},{"issue":"3","key":"660_CR38","doi-asserted-by":"crossref","first-page":"242","DOI":"10.2307\/2324456","volume":"100","author":"W Gilbert","year":"1993","unstructured":"Gilbert W (1993) Bricklaying and the Hermite normal form. Am Math Mon 100(3):242\u2013245","journal-title":"Am Math Mon"},{"issue":"1","key":"660_CR39","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.laa.2005.10.013","volume":"414","author":"X Zhan","year":"2006","unstructured":"Zhan X (2006) Completion of a partial integral matrix to a unimodular matrix. Linear Algebra Appl 414(1):373\u2013377","journal-title":"Linear Algebra Appl"},{"key":"660_CR40","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-1-4613-8354-3_5","volume":"50","author":"B Mohar","year":"1993","unstructured":"Mohar B, Poljak S (1993) Eigenvalues in combinatorial optimization: combinatorial and graph-theoretical problems in linear algebra. IMA Vol Math Appl 50:107\u2013151","journal-title":"IMA Vol Math Appl"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0660-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-011-0660-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0660-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T20:06:58Z","timestamp":1712693218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-011-0660-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,10]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["660"],"URL":"http:\/\/dx.doi.org\/10.1007\/s11227-011-0660-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,10]]}}}