{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:14:51Z","timestamp":1759133691198,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":[[1990,5]]},"DOI":"10.1016\/0743-7315(90)90116-7","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"87-92","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"title":["Scheduling with sufficient loosely coupled processors"],"prefix":"10.1016","volume":"9","author":[{"given":"Frank D.","family":"Anger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing-Jang","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Chieh","family":"Chow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"An O(n) algorithm for scheduling with communication delays","year":"1989","author":"Anger","key":"10.1016\/0743-7315(90)90116-7_BIB1"},{"issue":"6","key":"10.1016\/0743-7315(90)90116-7_BIB2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","article-title":"A shortest tree algorithm for optimal assignments across space and time in a distributed processor system","volume":"SE-7","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-7315(90)90116-7_BIB3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/TSE.1982.235574","article-title":"Load balancing in distributed systems","volume":"S#-8","author":"Chou","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"5","key":"10.1016\/0743-7315(90)90116-7_BIB4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/TC.1979.1675365","article-title":"Models for dynamic load balancing in a heterogeneous multiprocessor systems","volume":"C-28","author":"Chow","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/0743-7315(90)90116-7_BIB5","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1109\/TC.1984.5009355","article-title":"Estimation of intermodule communication (IMC) and its application in distributed processing systems","volume":"C-33","author":"Chu","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90116-7_BIB6","series-title":"Proc. IEEE 1984 Symposium on Real-Time Systems","article-title":"Task response time model and its applications for real-time distributed processing systems","author":"Chu","year":"1984"},{"issue":"3","key":"10.1016\/0743-7315(90)90116-7_BIB7","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0743-7315(90)90116-7_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"article-title":"Problems on multiprocessor scheduling arising from interprocessor communication overhead","year":"1986","author":"Hwang","key":"10.1016\/0743-7315(90)90116-7_BIB9"},{"issue":"2","key":"10.1016\/0743-7315(90)90116-7_BIB10","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","article-title":"Scheduling precedence graphs in systems with interprocessor communication times","volume":"18","author":"Hwang","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0743-7315(90)90116-7_BIB11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-6377(88)90080-6","article-title":"Multiprocessor scheduling with interprocessor communication delays","volume":"7","author":"Lee","year":"1988","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/0743-7315(90)90116-7_BIB12","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0216044","article-title":"A communication-time tradeoff","volume":"6","author":"Papadimitriou","year":"1987","journal-title":"SIAM J. Comput."},{"article-title":"UET scheduling with unit interprocessor communication delays","year":"1986","author":"Rayward-Smith","key":"10.1016\/0743-7315(90)90116-7_BIB13"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590901167?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590901167?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:39Z","timestamp":1757514639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731590901167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0743731590901167"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90116-7","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scheduling with sufficient loosely coupled processors","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(90)90116-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}