{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:05:10Z","timestamp":1761944710439,"version":"build-2065373602"},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040380","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"124-133","source":"Crossref","is-referenced-by-count":3,"title":["A scheduling problem arising from loop parallelization on MIMD machines"],"prefix":"10.1007","author":[{"given":"Richard J.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashfaq A.","family":"Munshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Simons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"R. Allen and K. Kennedy. Automatic translation of fortran programs to vector form. ACM Transactions on Programming Languages and Systems, 491\u2013542, October 1987.","key":"13_CR1","DOI":"10.1145\/29873.29875"},{"doi-asserted-by":"crossref","unstructured":"J. R. Allen, Ken Kennedy, Carrie Porterfield, and Joe Warren. Conversion of control dependences to data dependences. In ACM Principles of Programming Languages, pages 177\u2013189, 1983.","key":"13_CR2","DOI":"10.1145\/567067.567085"},{"unstructured":"R. G. Cytron. Compile-time Scheduling and Optimization for Asynchronous Machines. PhD thesis, University of Illinois at Urbana-Champagne, 1984.","key":"13_CR3"},{"key":"13_CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979."},{"doi-asserted-by":"crossref","unstructured":"D. J. Kuck, R. H. Kuhn, B. Leasure, and M. Wolfe. The structure of an advanced vectorizer for pipelined processors. In Proceedings of the IEEE 4th International COMPSAC, pages 207\u2013218, IEEE, 1980.","key":"13_CR5","DOI":"10.1145\/567532.567555"},{"unstructured":"E. W. Mayr. Well Structured Parallel Programs are Not Easier to Schedule. Technical Report, Department of Computer Science, Stanford University, September 1981.","key":"13_CR6"},{"unstructured":"A. A. Munshi. Compiling sequential codes for parallel machines. 1986. Unpublished manuscript.","key":"13_CR7"},{"unstructured":"B. Simons and A. A. Munshi. Scheduling Loops on Processors: Algorithms and Complexity. Technical Report RJ 5546 (56570), IBM, 1987.","key":"13_CR8"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040380.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:17:14Z","timestamp":1736500634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0040380","relation":{},"subject":[]}}