{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T02:33:35Z","timestamp":1771727615973,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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,6]]},"DOI":"10.1016\/0743-7315(90)90042-n","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"138-153","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":323,"title":["Scheduling parallel program tasks onto arbitrary target machines"],"prefix":"10.1016","volume":"9","author":[{"given":"Hesham","family":"El-Rewini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.G.","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90042-N_BIB1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","article-title":"A comparison of list schedulers for parallel processing systems","volume":"17","author":"Adam","year":"1974","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0743-7315(90)90042-N_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1981.226469","article-title":"A shortest tree algorithm for optimal assignments across space and time in distributed processor system","volume":"SE-7","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"issue":"3","key":"10.1016\/0743-7315(90)90042-N_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0743-7315(90)90042-N_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/32.4634","article-title":"A taxonomy of scheduling in general purpose distributed computing systems","volume":"SE-14","author":"Casavant","year":"1988","journal-title":"IEEE Trans. Software Engrg."},{"issue":"4","key":"10.1016\/0743-7315(90)90042-N_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/TSE.1982.235574","article-title":"Load balancing in distributed systems","volume":"SE-8","author":"Chou","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0743-7315(90)90042-N_BIB6","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."},{"key":"10.1016\/0743-7315(90)90042-N_BIB7","series-title":"Proc. Second Hypercube Conference","first-page":"121","article-title":"Embedment of interesting task modules into a hypercube multiprocessor","author":"Chen","year":"1986"},{"key":"10.1016\/0743-7315(90)90042-N_BIB8","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 Inform."},{"key":"10.1016\/0743-7315(90)90042-N_BIB9","series-title":"Proc. BISYCP'89","article-title":"Static mapping of task graphs with communication onto arbitrary target machines-case study: Hypercube","author":"El-Rewini","year":"1989"},{"key":"10.1016\/0743-7315(90)90042-N_BIB10","article-title":"Task partitioning and scheduling on arbitrary parallel processing systems","author":"El-Rewini","year":"1990"},{"issue":"3","key":"10.1016\/0743-7315(90)90042-N_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/356698.356700","article-title":"Deterministic processor scheduling","volume":"9","author":"Gonzalez","year":"1977","journal-title":"Comput. Surveys"},{"key":"10.1016\/0743-7315(90)90042-N_BIB12","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0743-7315(90)90042-N_BIB13","article-title":"Static task scheduling and grain packing in parallel processing systems","author":"Kruatrachue","year":"1987"},{"issue":"3","key":"10.1016\/0743-7315(90)90042-N_BIB14","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."},{"key":"10.1016\/0743-7315(90)90042-N_BIB15","article-title":"Parallel programming support environment research","author":"Lewis","year":"1989","journal-title":"Technical Rep. Oregon Advanced Computing Institute"},{"key":"10.1016\/0743-7315(90)90042-N_BIB16","series-title":"Deterministic processor scheduling with communication cost","author":"Linnemann","year":"1985"},{"key":"10.1016\/0743-7315(90)90042-N_BIB17","series-title":"Proc. 4th International Conference Distr. Comput. Syst.","first-page":"30","article-title":"Heuristic algorithms for task assignment in distributed systems","author":"Lo","year":"1984"},{"key":"10.1016\/0743-7315(90)90042-N_BIB18","article-title":"Precedence-constrained scheduling with minimum time and communication","author":"Prastein","year":"1987"},{"key":"10.1016\/0743-7315(90)90042-N_BIB19","article-title":"Task grapher: Arbitrary machine topology and performance tools environment enhancement","author":"Su","year":"1990"},{"key":"10.1016\/0743-7315(90)90042-N_BIB20","series-title":"Computer Networks","author":"Tanenbaum","year":"1981"},{"key":"10.1016\/0743-7315(90)90042-N_BIB21","article-title":"Allocating programs containing branches and loops within a multiple processor systems","volume":"10","author":"Towsley","year":"1986","journal-title":"IEEE Trans. Software Engrg. SE12"},{"key":"10.1016\/0743-7315(90)90042-N_BIB22","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0743-7315(90)90042-N_BIB23","article-title":"LU decomposition on a multiprocessing system with communication delay","author":"Yu","year":"1984"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090042N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090042N?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:01Z","timestamp":1757514601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159090042N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["074373159090042N"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90042-n","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scheduling parallel program tasks onto arbitrary target machines","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)90042-N","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"}]}}