{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T02:51:02Z","timestamp":1673059862348},"reference-count":24,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0167-739x(98)00035-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:24:10Z","timestamp":1027599850000},"page":"293-311","source":"Crossref","is-referenced-by-count":4,"title":["Arranging statements and data of program instances for locality"],"prefix":"10.1016","volume":"14","author":[{"given":"Claudia","family":"Leopold","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-739X(98)00035-1_BIB1","series-title":"Local Search in Combinatorial Optimization","author":"Aarts","year":"1997"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB2","article-title":"Improving the Performance of Virtual Memory Computers","author":"Abu-sufah","year":"1978"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB3","series-title":"Proceedings of the 20th ACM Symposium on the Theory of Computing","first-page":"173","article-title":"Virtual memory algorithms","author":"Aggarwal","year":"1988"},{"issue":"9","key":"10.1016\/S0167-739X(98)00035-1_BIB4","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","article-title":"The I\/O complexity of sorting and related problems","volume":"31","author":"Aggarwal","year":"1988","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB5","series-title":"Developing a Computer Science Agenda for High-Performance Computing","first-page":"9","article-title":"Performance Programming: A science waiting to happen","author":"Alpern","year":"1994"},{"issue":"2\/3","key":"10.1016\/S0167-739X(98)00035-1_BIB6","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BF01185206","article-title":"The uniform memory hierarchy model of computation","volume":"12","author":"Alpern","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB7","article-title":"Memory-hierarchy Management","author":"Carr","year":"1993"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB8","series-title":"Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation","first-page":"205","article-title":"Unifying data and control transformations for distributed shared memory machines","author":"Cierniak","year":"1995"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB9","series-title":"Proceedings of the ACM SIGPLAN'95 Conference on Programming Language Design and Implementation","first-page":"279","article-title":"Tile size selection using cache organization and data layout","author":"Coleman","year":"1995"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BFb0027029","article-title":"Local search in combinatorial optimization, Artificial Neural Networks","volume":"931","author":"Crama","year":"1991","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB11","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/0743-7315(88)90014-7","article-title":"Strategies for cache and local memory management by global program transformation","volume":"5","author":"Gannon","year":"1988","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0167-739X(98)00035-1_BIB12","series-title":"Proceedings of the ACM International Conference on Supercomputing","first-page":"269","article-title":"A compiler algorithm for optimizing locality in loop nests","author":"Kandemir","year":"1997"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","author":"Kernighan","year":"1970","journal-title":"The Bell Syst. Tech. J."},{"key":"10.1016\/S0167-739X(98)00035-1_BIB14","author":"Koelbel","year":"1994"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB15","series-title":"Proceedings of the ACM SIGPLAN Symposium on Discrete Algorithms","first-page":"370","article-title":"The influence of caches on the performance of sorting","author":"LaMarca","year":"1997"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB16","series-title":"The Traveling Salesman Problem \u2014 A Guided Tour of Combinatorial Optimization","year":"1995"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB17","series-title":"Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science","first-page":"328","article-title":"Maintaining dictionaries in a hierarchical memory","author":"Leopold","year":"1991"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB18","series-title":"Proceedings of the ACM Symposium on Applied Computing","first-page":"515","article-title":"A fuzzy approach to automatic data locality optimization","author":"Leopold","year":"1996"},{"issue":"4","key":"10.1016\/S0167-739X(98)00035-1_BIB19","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/233561.233564","article-title":"Improving data locality with loop transformations","volume":"18","author":"Mckinley","year":"1996","journal-title":"ACM Trans. Progr. Languages Syst."},{"key":"10.1016\/S0167-739X(98)00035-1_BIB20","series-title":"Advanced Compiler Design and Implementation","author":"Muchnick","year":"1997"},{"issue":"2\/3","key":"10.1016\/S0167-739X(98)00035-1_BIB21","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/BF01185207","article-title":"Algorithms for parallel memory I: two-level memories","volume":"12","author":"Vitter","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB22","series-title":"Proceedings of the Supercomputing'93","first-page":"12","article-title":"A parallel hashed oct-tree N-body algorithm","author":"Warren","year":"1993"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB23","series-title":"High Performance Compilers for Parallel Computing","author":"Wolfe","year":"1996"},{"key":"10.1016\/S0167-739X(98)00035-1_BIB24","series-title":"Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation","first-page":"30","article-title":"A data locality optimizing algorithm","author":"Wolf","year":"1991"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X98000351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X98000351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:20:04Z","timestamp":1556648404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X98000351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":24,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0167739X98000351"],"URL":"https:\/\/doi.org\/10.1016\/s0167-739x(98)00035-1","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}