{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:11:56Z","timestamp":1648930316231},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1985,2]]},"DOI":"10.1016\/0164-1212(85)90008-1","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:49:55Z","timestamp":1060318195000},"page":"73-80","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of parallelism in nested DO loops"],"prefix":"10.1016","volume":"5","author":[{"given":"P.W.","family":"Foulk","sequence":"first","affiliation":[]},{"given":"S.M.","family":"Nassar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(85)90008-1_BIB1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/PGEC.1967.264606","article-title":"Experiments on Models of Computations and Systems","volume":"EC-16","author":"Martin","year":"1967","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/0164-1212(85)90008-1_BIB2","article-title":"Control Mechanisms for Parallelism in Programs","author":"Bingham","year":"1968"},{"key":"10.1016\/0164-1212(85)90008-1_BIB3","series-title":"Rep. 71\u2013424","article-title":"Parallelism Exposure and Exploitation in Programs","author":"Muraoka","year":"1971"},{"key":"10.1016\/0164-1212(85)90008-1_BIB4","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1109\/T-C.1972.223501","article-title":"On the Number of Operations Simultaneously Executable in Fortranlike Programs and Their Resulting Speedup","volume":"C-21","author":"Kuck","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0164-1212(85)90008-1_BIB5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1974.6323440","article-title":"Measurements of Parallelism in Ordinary Fortran Programs","volume":"7","author":"Kuck","year":"1974","journal-title":"Computer"},{"key":"10.1016\/0164-1212(85)90008-1_BIB6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0204012","article-title":"Time Bounds on the Parallel Evaluation of Arithmetic Expressions","volume":"4","author":"Kuck","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0164-1212(85)90008-1_BIB7","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/T-C.1975.224291","article-title":"Time and Parallel Processor Bounds for Linear Recurrence Systems","volume":"C-24","author":"Chen","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0164-1212(85)90008-1_BIB8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The Parallel Evaluation of General Arithmetic Expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0164-1212(85)90008-1_BIB9","article-title":"A Standard for Supercomputer Languages, Infotech: state of the art report","volume":"2","author":"Perrott","year":"1979","journal-title":"Supercomputers"},{"key":"10.1016\/0164-1212(85)90008-1_BIB10","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TC.1979.1675434","article-title":"Time and Parallel Processor Bounds for Fortran-like Loops","volume":"C-28","author":"Banerjee","year":"1979","journal-title":"IEEE Trans. Comp."},{"key":"10.1016\/0164-1212(85)90008-1_BIB11","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/TC.1982.1675890","article-title":"Improved Time and Parallel Processor Bounds for Fortran-like Loops","volume":"C-31","author":"Heuft","year":"1982","journal-title":"IEEE Trans. Comp."},{"key":"10.1016\/0164-1212(85)90008-1_BIB12","article-title":"Aids\u2014An Integrated Design System for Digital Hardware","volume":"127","author":"Foulk","year":"1980"},{"key":"10.1016\/0164-1212(85)90008-1_BIB13","article-title":"Formal Description of Computational Structure in Aids","volume":"127","author":"Foulk","year":"1980"},{"key":"10.1016\/0164-1212(85)90008-1_BIB14","doi-asserted-by":"crossref","DOI":"10.1049\/sm.1982.0054","article-title":"Directed-Graph Models and their Application to Software Development","volume":"1","author":"Foulk","year":"1982","journal-title":"Software & Microsystems"},{"key":"10.1016\/0164-1212(85)90008-1_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel Program Schemata","volume":"3","author":"Karp","year":"1963","journal-title":"J. Comp. & Syst. Sci."}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121285900081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121285900081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T02:54:40Z","timestamp":1552618480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0164121285900081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0164121285900081"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(85)90008-1","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}