{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:51:55Z","timestamp":1752360715798},"reference-count":16,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":[[1994,6]]},"DOI":"10.1016\/0167-8191(94)90121-x","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T13:52:02Z","timestamp":1062597122000},"page":"869-885","source":"Crossref","is-referenced-by-count":12,"title":["A two-pass scheduling algorithm for parallel programs"],"prefix":"10.1016","volume":"20","author":[{"given":"Dongseung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Byung-Guoen","family":"Yi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90121-X_BIB1","doi-asserted-by":"crossref","DOI":"10.1109\/12.29469","article-title":"On the complexity of scheduling problems for parallel\/pipelined machines","author":"Bernstein","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0167-8191(94)90121-X_BIB2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TC.1987.1676922","article-title":"Interprocessor traffic scheduling algorithm for multiple-processor networks","volume":"C-36","author":"Bianchini","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90121-X_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MC.1980.1653419","article-title":"Task allocation in distributed data processing","author":"Chu","year":"1980","journal-title":"IEEE Comput."},{"issue":"6","key":"10.1016\/0167-8191(94)90121-X_BIB4","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/TC.1987.1676960","article-title":"Task allocation and precedence relations for distributed real-time systems","volume":"C-36","author":"Chu","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90121-X_BIB5","series-title":"Computer and Job-shop Scheduling","author":"Coffman","year":"1976"},{"key":"10.1016\/0167-8191(94)90121-X_BIB6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Informatica"},{"key":"10.1016\/0167-8191(94)90121-X_BIB7","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","article-title":"A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors","volume":"16","author":"Gerasoulis","year":"1992","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0167-8191(94)90121-X_BIB8","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing an assembly line problem","volume":"9","author":"Hu","year":"1961","journal-title":"Operat. Res."},{"issue":"11","key":"10.1016\/0167-8191(94)90121-X_BIB9","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"C-33","author":"Kasahara","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90121-X_BIB10","series-title":"Proc. Int'l. Conf. on Supercomputing","first-page":"856","article-title":"Parallel processing of near fine grain tasks using static scheduling on OSCAR","author":"Kasahara","year":"1990"},{"key":"10.1016\/0167-8191(94)90121-X_BIB11","first-page":"1","article-title":"A general approach to mapping of parallel computation upon multiprocessor architectures","volume":"Vol. III","author":"Kim","year":"1988"},{"issue":"459","key":"10.1016\/0167-8191(94)90121-X_BIB12","first-page":"45","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/0167-8191(94)90121-X_BIB13","series-title":"Parallel Processing for Computer Vision and Display","first-page":"353","article-title":"The design of parallel processing system for computer graphics","author":"Kunii","year":"1989"},{"key":"10.1016\/0167-8191(94)90121-X_BIB14","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/66451.66454","article-title":"Automatic determination of grain size for efficient parallel processing","author":"McCreary","year":"1989","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8191(94)90121-X_BIB15","first-page":"9","article-title":"Scheduling to account for interprocessor communication within interconnection-constrained processor networks","volume":"Vol. I","author":"Sih","year":"1990"},{"key":"10.1016\/0167-8191(94)90121-X_BIB16","first-page":"288","article-title":"Workload scheduling: a new technique for scheduling task graphs with communication costs in parallel systems","volume":"Vol. II","author":"Zhu","year":"1991"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919490121X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919490121X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T16:32:17Z","timestamp":1583944337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919490121X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["016781919490121X"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90121-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}