{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:54Z","timestamp":1725456234078},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630913"},{"type":"electronic","value":"9783540691280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0017261","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:31:40Z","timestamp":1132641100000},"page":"315-329","source":"Crossref","is-referenced-by-count":3,"title":["Optimal reordering and mapping of a class of nested-loops for parallel execution"],"prefix":"10.1007","author":[{"given":"Chi-Chung","family":"Lam","sequence":"first","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]},{"given":"Rephael","family":"Wenger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"20_CR1","volume-title":"Crafting a Compiler","author":"C. N. Fischer","year":"1991","unstructured":"C. N. Fischer and R. J. Leblanc Jr. Crafting a Compiler. Menlo Park, CA: Benjamin\/ Cummings, 1991."},{"key":"20_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ken Kennedy and Kathryn S. McKinley. Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution. In Languages and Compilers for Parallel Computing, August 1993, 301\u2013320.","DOI":"10.1007\/3-540-57659-2_18"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Ken Kennedy and Kathryn S. McKinley. Optimizing for Parallelism and Data Locality. In Proceedings of the 1992 ACM International Conference on Supercomputing, July 1992, 323\u2013334.","DOI":"10.1145\/143369.143427"},{"key":"20_CR5","volume-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"V. Kumar","year":"1994","unstructured":"V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. RedWood City, CA: Benjamin\/Cummings, 1994."},{"issue":"6","key":"20_CR6","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1049\/ip-d.1993.0060","volume":"140","author":"C. C. Lu","year":"1993","unstructured":"C. C. Lu and W. C. Chew. Fast Algorithm for Solving Hybrid Integral Equations. In IEE Proceedings-H, 140(6): 455\u2013460, December 1993.","journal-title":"IEE Proceedings-H"},{"issue":"10","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1109\/5.104224","volume":"79","author":"E. K. Miller","year":"1991","unstructured":"Edmund K. Miller. Solving Bigger Problems-By Decreasing the Operation Count and Increasing the Computation Bandwidth. In Proceedings of the IEEE, 79(10): 1493\u20131504, October 1991.","journal-title":"Proceedings of the IEEE"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/43.486662","volume":"15","author":"M. Potkonjak","year":"1996","unstructured":"M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan. Multiple Constant Multiplications: Efficient and Versatile Framework and Algorithms for Exploring Common Subexpression Elimination. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 15(2): 151\u2013164, February 1996.","journal-title":"IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems"},{"key":"20_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970364","volume-title":"Arithmetic complexity of computations","author":"S. Winograd","year":"1980","unstructured":"S. Winograd. Arithmetic complexity of computations. Philadelphia: Society for Industrial and Applied Mathematics, 1980."},{"key":"20_CR10","unstructured":"M. Wolfe. High Performance Compilers for Parallel Computing. Addison Wesley, 1996."},{"key":"20_CR11","unstructured":"Michael E. Wolf and Monica S. Lam. A Data Locality Algorithm. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, June 1991, 30\u201344."}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:45:17Z","timestamp":1586573117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630913","9783540691280"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0017261","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}