{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:43:24Z","timestamp":1743111804213,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","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":[[1999]]},"DOI":"10.1007\/3-540-48311-x_49","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"375-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Storage Mapping Optimization for Parallel Programs"],"prefix":"10.1007","author":[{"given":"Albert","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Lefebvre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jpdc.1996.1261","volume":"40","author":"D. Barthou","year":"1997","unstructured":"D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. Journal of Parallel and Distributed Computing, 40:210\u2013226, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"49_CR2","unstructured":"L. Carter, J. Ferrante, and S. Flynn Hummel. Efficient multiprocessor parallelism via hierarchical tiling. In SIAM Conference on Parallel Processing for Scientific Computing, 1995."},{"key":"49_CR3","unstructured":"A. Cohen and V. Lefebvre. Optimization of storage mappings for parallel programs. Technical Report 1998\/46, PRiSM, U. of Versailles, 1998."},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"J.-F. Collard. The advantages of reaching definition analyses in Array (S)SA. In Proc. Workshop on Languages and Compilers for Parallel Computing, Chapel Hill, NC, August 1998. Springer-Verlag.","DOI":"10.1007\/3-540-48319-5_22"},{"key":"49_CR5","unstructured":"B. Creusillet. Array Region Analyses and Applications. PhD thesis, Ecole des Mines de Paris, December 1996."},{"issue":"4","key":"49_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451\u2013490, October 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"49_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1023\/A:1025168022993","volume":"25","author":"A. Darte","year":"1997","unstructured":"A. Darte and F. Vivien. Optimal_ne and medium grain parallelism detection in polyhedral reduced dependence graphs. Int. Journal of Parallel Programming, 25(6):447\u2013496, December 1997.","journal-title":"Int. Journal of Parallel Programming"},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"P. Feautrier. Dataflow analysis of scalar and array references. Int. Journal of Parallel Programming, 20(1):23\u201353, February 1991.","journal-title":"Int. Journal of Parallel Programming"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"P. Feautrier. Some efficient solution to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6), December 1992.","DOI":"10.1007\/BF01379404"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"F. Irigoin and R. Triolet. Supernode partitioning. In Proc. 15th POPL, pages 319\u2013328, San Diego, Cal., January 1988.","DOI":"10.1145\/73560.73588"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0167-8191(98)00029-5","volume":"24","author":"V. Lefebvre","year":"1998","unstructured":"V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Journal on Parallel Computing, 24:649\u2013671, 1998.","journal-title":"Journal on Parallel Computing"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"D.E. Maydan, S.P. Amarasinghe, and M.S. Lam. Array dataflow analysis and its use in array privatization. In Proc. of ACM Conf. on Principles of Programming Languages, pages 2\u201315, January 1993.","DOI":"10.1145\/158511.158515"},{"issue":"8","key":"49_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"W. Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8):27\u201347, August 1992.","journal-title":"Communications of the ACM"},{"key":"49_CR14","unstructured":"Fabien Quiller\u00e9 and Sanjay Rajopadhye. Optimizing memory usage in the polyhedral model. Technical Report 1228, IRISA, January 1999."},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"M. Mills Strout, L. Carter, J. Ferrante, and B. Simon. Schedule-independent storage mapping for loops. In ACM Int. Conf. on Arch. Support for Prog. Lang.and Oper. Sys. (ASPLOS-VIII), 1998.","DOI":"10.1145\/291069.291015"},{"key":"49_CR16","series-title":"Lect Notes Comput Sci","first-page":"500","volume-title":"Proc. Sixth Workshop on Languages and Compilers for Parallel Computing","author":"P. Tu","year":"1993","unstructured":"P. Tu and D. Padua. Automatic array privatization. In Proc. Sixth Workshop on Languages and Compilers for Parallel Computing, number 768 in Lecture Notes in Computer Science, pages 500\u2013521, August 1993. Portland, Oregon."},{"key":"49_CR17","unstructured":"D.G. Wonnacott. Constraint-Based Array Dependence Analysis. PhD thesis, University of Maryland, 1995."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:53:23Z","timestamp":1600354403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","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"}]}}