{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:34:18Z","timestamp":1742394858693},"reference-count":13,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":[[1996,11]]},"DOI":"10.1016\/s0167-8191(96)00041-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"1197-1214","source":"Crossref","is-referenced-by-count":18,"title":["A heuristic for scheduling task graphs with communication delays onto multiprocessors"],"prefix":"10.1016","volume":"22","author":[{"given":"Goran Lj.","family":"Djordjevi\u0107","sequence":"first","affiliation":[]},{"given":"Milorad B.","family":"To\u0161i\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(96)00041-5_BIB1","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1109\/71.334905","article-title":"Performance evaluation of scheduling precedence-constrained computations on message-passing system","volume":"5","author":"Al-Mouhamed","year":"1994","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB2","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":"Communication of the ACM"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB3","series-title":"ICS Proc.","first-page":"447","article-title":"Clustering task graphs for message passing architectures","author":"Gerasoulis","year":"1990"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","article-title":"Scheduling in systems with interprocessor communication times","volume":"18","author":"Hwang","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8191(96)00041-5_BIB5","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"33","author":"Kasahara","year":"1984","journal-title":"IEEE Transaction on Computers"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB6","article-title":"Duplication scheduling heuristic (DSH), A new precedence task scheduler for parallel systems","author":"Kruatrachue","year":"1987"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-8191(90)90037-A","article-title":"An optimal algorithm for Gaussian elimination of band matrices on an MIMD computer","volume":"15","author":"Milovanovi\u0107","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB8","author":"Sarkar","year":"1989"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/71.277783","article-title":"Scheduling precedence constrained task graphs with non-negligible intertask communication onto multiprocessors","volume":"5","author":"Selvakumar","year":"1994","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB10","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0743-7315(90)90014-G","article-title":"Analysis and evaluation of heuristic methods for static task scheduling","volume":"10","author":"Shirazi","year":"1990","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/71.207593","article-title":"A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures","volume":"4","author":"Sih","year":"1993","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB12","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1109\/71.242160","article-title":"Deslustering: a new multiprocessor scheduling technique","volume":"4","author":"Sih","year":"1993","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(96)00041-5_BIB13","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","article-title":"DSC: Scheduling parallel program tasks on an unbounded number of processors","volume":"5","author":"Yang","year":"1994","journal-title":"IEEE Transaction on Parallel and Distributed Systems"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000415?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000415?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:20:26Z","timestamp":1555557626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196000415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0167819196000415"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00041-5","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}