{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:18Z","timestamp":1757629458708,"version":"3.44.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0743-7315(91)90118-s","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"130-134","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["On optimal parallelization of arbitrary loops"],"prefix":"10.1016","volume":"11","author":[{"given":"Uwe","family":"Schwiegelshohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Gasperoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kemal","family":"Ebcio\u01e7lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(91)90118-S_BIB1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","article-title":"A comparison of list schedules for parallel processing systems","volume":"17","author":"Adam","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(91)90118-S_BIB2","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/32.6136","article-title":"A development environment for horizontal microcode","volume":"14","author":"Aiken","year":"1988","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-7315(91)90118-S_BIB3","series-title":"Proc. SIGPLAN 1988 Conference on Programming Language Design and Implementation","first-page":"308","article-title":"Optimal loop parallelization","author":"Aiken","year":"1988"},{"key":"10.1016\/0743-7315(91)90118-S_BIB4","series-title":"ESOP '88: 2nd European Symposium on Programming","first-page":"221","article-title":"Perfect pipelining: A new loop parallelization technique","author":"Aiken","year":"1988"},{"key":"10.1016\/0743-7315(91)90118-S_BIB5","series-title":"Proc. Aegean Workshop on Computing (VLSI Algorithms and Architectures)","first-page":"124","article-title":"A scheduling problem arising from loop parallelization on MIMD machines","author":"Anderson","year":"1988"},{"year":"1976","series-title":"Computer and Job-Shop Scheduling Theory","author":"Coffman","key":"10.1016\/0743-7315(91)90118-S_BIB6"},{"key":"10.1016\/0743-7315(91)90118-S_BIB7","series-title":"Proc. 1985 International Conference on Parallel Processing (Penn State University, PA)","first-page":"836","article-title":"Doacross: Beyond vectorization for multiprocessors","author":"Cytron","year":"1986"},{"key":"10.1016\/0743-7315(91)90118-S_BIB8","series-title":"Proc. 20th Annual Microprogramming Workshop","first-page":"69","article-title":"A compilation technique for software pipelining of loops with conditional jumps","author":"Ebcio\u01e7lu","year":"1987"},{"key":"10.1016\/0743-7315(91)90118-S_BIB9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/24039.24041","article-title":"The program dependence graph and its use in optimization","volume":"9","author":"Ferrante","year":"1987","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0743-7315(91)90118-S_BIB10","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1981.1675827","article-title":"Trace Scheduling: A technique for global microcode compaction","volume":"C-30","author":"Fisher","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90118-S_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/MC.1984.1659185","article-title":"The VLIW machine: A multiprocessor for compiling scientific code","volume":"17","author":"Fisher","year":"1984","journal-title":"IEEE Comput."},{"key":"10.1016\/0743-7315(91)90118-S_BIB12","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1109\/T-C.1972.223515","article-title":"Percolation of code to enhance parallel dispatching and execution","volume":"C-21","author":"Foster","year":"1972","journal-title":"IEEE Trans. Comput."},{"year":"1979","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0743-7315(91)90118-S_BIB13"},{"key":"10.1016\/0743-7315(91)90118-S_BIB14","series-title":"Proc. SIGPLAN 1988 Conference on Programming Language Design and Implementation","first-page":"318","article-title":"Software pipelining: An effective scheduling technique for VLIW machines","author":"Lam","year":"1988"},{"article-title":"Scheduling loops on processors: Algorithms and complexity","year":"1987","author":"Munshi","key":"10.1016\/0743-7315(91)90118-S_BIB15_1"},{"issue":"4","key":"10.1016\/0743-7315(91)90118-S_BIB15_2","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1137\/0219051","volume":"19","author":"Munshi","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(91)90118-S_BIB16","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1109\/TC.1980.1675676","article-title":"High-speed multiprocessors and compilation techniques","volume":"C-29","author":"Padua","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90118-S_BIB17","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":"Comm. ACM"},{"year":"1988","series-title":"Parallel Programming and Compilers","author":"Polychronopoulos","key":"10.1016\/0743-7315(91)90118-S_BIB18"},{"key":"10.1016\/0743-7315(91)90118-S_BIB19","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/T-C.1972.223514","article-title":"The inhibition of potential parallelism by conditional jumps","volume":"C-21","author":"Riseman","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(91)90118-S_BIB20","series-title":"Proc. International Conference on Supercomputing","article-title":"Requirements for optimal execution of loops with tests","author":"Uht","year":"1988"},{"key":"10.1016\/0743-7315(91)90118-S_BIB22","unstructured":"also available as Tech. Rep. CS88-116, University of California, San Diego."},{"key":"10.1016\/0743-7315(91)90118-S_BIB21","series-title":"Proc. International Conference on Parallel Processing","first-page":"130","article-title":"Optimal static scheduling of sequential loops on multiprocessors","author":"Zaky","year":"1989"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190118S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190118S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:07Z","timestamp":1757514607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190118S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["074373159190118S"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90118-s","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On optimal parallelization of arbitrary loops","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90118-S","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}