{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T09:30:43Z","timestamp":1673515843819},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf01582075","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:37:34Z","timestamp":1114677454000},"page":"331-370","source":"Crossref","is-referenced-by-count":4,"title":["A strategy for array management in local memory"],"prefix":"10.1007","volume":"63","author":[{"given":"Christine","family":"Eisenbeis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Jalby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Windheiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Bodin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"M. Burke and R. Cytron, \u201cInterprocedural analysis and parallelization,\u201d in:Proceedings of SIGPLAN 86, Symposium on Compiler Construction (1986) pp. 162\u2013175."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"C.H. Chi and H. Dietz, \u201cUnified management of registers and cache using liveness and cache bypass,\u201dProceedings of 1989 SIGPLAN Conference on Programming Language. Design and Implementation (1989).","DOI":"10.1145\/73141.74849"},{"key":"CR3","first-page":"238","volume-title":"Proceedings of ACM International Conference on Supercomputing","author":"K. Gallivan","year":"1988","unstructured":"K. Gallivan, D. Gannon and W. Jalby, \u201cOn the problem of optimizing data transfers for complex memory systems,\u201d in:Proceedings of ACM International Conference on Supercomputing (ACM, New York, (1988) pp. 238\u2013253."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"K. Gallivan, D. Gannon, W. Jalby, A. Malony and H. Wijshoff, \u201cExperimentally characterizing the behavior of multiprocessor memory systems: A case study,\u201dIEEE Transaction on Software Engineering 16(2) (1990).","DOI":"10.1109\/32.44384"},{"key":"CR5","first-page":"433","volume-title":"Proceedings of ACM International Conference on Supercomputing","author":"K. Gallivan","year":"1989","unstructured":"K. Gallivan, W. Jalby, A. Malony and H. Wijshoff, \u201cPerformance prediction of loop constructs on multiprocessor hierarchical memory systems,\u201d in:Proceedings of ACM International Conference on Supercomputing (ACM, New York, 1989) pp. 433\u2013442."},{"key":"CR6","volume-title":"Proceedings of the International Conference on Supercomputing","author":"D. Gannon","year":"1987","unstructured":"D. Gannon, W. Jalby and K. Gallivan, \u201cStrategies for cache and local memory management by global program transformation,\u201d in:Proceedings of the International Conference on Supercomputing (Springer Verlag, New York, 1987) andJournal of Parallel and Distributed Computing 5 (1988) 587\u2013616."},{"key":"CR7","volume-title":"\u201cAutomatic translation of Fortran programs to vector form,\u201d Technical Report","author":"K. Kennedy","year":"1980","unstructured":"K. Kennedy, \u201cAutomatic translation of Fortran programs to vector form,\u201d Technical Report, Rice University (Houston, TX, 1980)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"D. Kuck, R. Kuhn, B. Leasure and M. Wolfe, \u201cDependence graphs and compiler optimization,\u201dProceedings of the Symposium on POPL (1981).","DOI":"10.1145\/567532.567555"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"D. Padua and D. Kuck, \u201cHigh-speed multiprocessors and compilation techniques,\u201dIEEE Transactions on Computers C-29(9) (1980) 763\u2013776.","DOI":"10.1109\/TC.1980.1675676"},{"issue":"12","key":"CR10","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","volume":"29","author":"D. Padua","year":"1986","unstructured":"D. Padua and M. Wolfe, \u201cAdvanced compiler optimizations for supercomputers,\u201dCommunications of the ACM 29(12) (1986) 1184\u20131201.","journal-title":"Communications of the ACM"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"G. Pfister and A. Norton, \u201cHot spot contention and combining in multistage interconnection networks,\u201d in:Proceedings of the 1985 International Conference on Parallel Processing (1985) pp. 790\u2013797.","DOI":"10.1109\/TC.1985.6312198"},{"key":"CR12","volume-title":"\u201cCompiler management of program locality,\u201d Technical Report","author":"A. Porterfield","year":"1988","unstructured":"A. Porterfield, \u201cCompiler management of program locality,\u201d Technical Report, Rice University (Houston, TX, 1988)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S. Sahni","year":"1975","unstructured":"S. Sahni, \u201cApproximate algorithms for the [0, 1] knapsack problem,\u201dJournal of the ACM 22 (1975) 115\u2013124.","journal-title":"Journal of the ACM"},{"key":"CR14","unstructured":"A. Veidenbaum and H. Cheong, \u201cCache Coherence Scheme with Fast Selective Invalidation,\u201d in:Proceedings of the International Symposium on Computer Architecture (1988)."},{"key":"CR15","volume-title":"\u201cAn algorithm to generate sequential and parallel code with improved data locality,\u201d Technical Report","author":"M. Wolf","year":"1990","unstructured":"M. Wolf and M. Lam, \u201cAn algorithm to generate sequential and parallel code with improved data locality,\u201d Technical Report, Stanford University (Stanford, CA, 1990)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582075.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582075\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582075","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:44Z","timestamp":1556896544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01582075"],"URL":"https:\/\/doi.org\/10.1007\/bf01582075","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}