{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:46:18Z","timestamp":1748335578517},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0167-8191(96)00108-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"251-266","source":"Crossref","is-referenced-by-count":9,"title":["Plugging anti and output dependence removal techniques into loop parallelization algorithm"],"prefix":"10.1016","volume":"23","author":[{"given":"Pierre-Yves","family":"Calland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Darte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Vivien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(96)00108-1_BIB1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/29873.29875","article-title":"Automatic translation of Fortran programs to vector form","volume":"9","author":"Allen","year":"1987","journal-title":"ACM Toplas"},{"issue":"4","key":"10.1016\/S0167-8191(96)00108-1_BIB2","article-title":"Compiler transformations for high-performance computing","volume":"26","author":"Bacon","year":"1994","journal-title":"ADM Comput. Surv."},{"key":"10.1016\/S0167-8191(96)00108-1_BIB3","first-page":"211","article-title":"Automatic program parallelization","volume":"81","author":"Banerjee","year":"1993"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB4","series-title":"Int. Conf. of Supercomputing","first-page":"407","article-title":"The importance of direct dependences for automatic parallelization","author":"Brandes","year":"1988"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB5","article-title":"A Global Approach to Detection of Parallelism","author":"Callahan","year":"1987"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB6","series-title":"Application Specific Systems, Architectures and Processors","first-page":"353","article-title":"On the removal of anti and output dependences","author":"Calland","year":"1996"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB7","article-title":"Environnement logiciel de programmation d'un acc\u00e9l\u00e9rateur de calcul parall\u00e8le","author":"Chamski","year":"1993"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB8","series-title":"INRIA-IEEE Symp. on Emerging Technologies anti Factory Automation","first-page":"217","article-title":"A classification of nested loops parallelization algorithms","author":"Darte","year":"1995"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB9","doi-asserted-by":"crossref","DOI":"10.1109\/PACT.1996.552676","article-title":"Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs","author":"Darte","year":"1996"},{"issue":"1","key":"10.1016\/S0167-8191(96)00108-1_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","article-title":"Dataflow analysis of array and scalar references","volume":"20","author":"Feautrier","year":"1991","journal-title":"Int. J. Parallel Program"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB11","series-title":"Supercomputing 95","article-title":"Symbolic array dataflow analysis for array privatization and program parallelization","author":"Gu","year":"1995"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB12","series-title":"RenPar'8","first-page":"149","article-title":"Gestion de la m\u00e9moire dans les programmes parall\u00e8les","author":"Lefebvre","year":"1996"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB13","series-title":"Principles of Programming Languages","article-title":"Array dataflow analysis and its use in array privatization","author":"Maydan","year":"1993"},{"issue":"12","key":"10.1016\/S0167-8191(96)00108-1_BIB14","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1145\/7902.7904","article-title":"Advanced compiler optimizations for supercomputers","volume":"29","author":"Padua","year":"1986","journal-title":"Commun. ACM"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB15","first-page":"46","article-title":"The Tiny loop restructuring research tool","volume":"Vol. II","author":"Wolfe","year":"1991"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB16","author":"Wolfe","year":"1996"},{"key":"10.1016\/S0167-8191(96)00108-1_BIB17","author":"Zima","year":"1990"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196001081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196001081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:20:47Z","timestamp":1555557647000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196001081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0167819196001081"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00108-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}