{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:19:25Z","timestamp":1648747165304},"reference-count":27,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0305-0548(02)00031-x","type":"journal-article","created":{"date-parts":[[2003,1,10]],"date-time":"2003-01-10T18:08:14Z","timestamp":1042222094000},"page":"643-670","source":"Crossref","is-referenced-by-count":1,"title":["A fast task-to-processor assignment heuristic for real-time multiprocessor DSP applications"],"prefix":"10.1016","volume":"30","author":[{"given":"John W.","family":"Chinneck","sequence":"first","affiliation":[]},{"given":"Vitoria","family":"Pureza","sequence":"additional","affiliation":[]},{"given":"Rafik A.","family":"Goubran","sequence":"additional","affiliation":[]},{"given":"Gerald M.","family":"Karam","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Lavoie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0305-0548(02)00031-X_BIB1","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/19.85339","article-title":"Implementation of a real-time mobile channel simulator using a DSP chip","volume":"40","author":"Goubran","year":"1991","journal-title":"IEEE Transactions on Instrumentation and Measurement"},{"issue":"4","key":"10.1016\/S0305-0548(02)00031-X_BIB2","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","article-title":"Static scheduling algorithms for allocating directed task graphs to multiprocessors","volume":"31","author":"Kwok","year":"1999","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/S0305-0548(02)00031-X_BIB3","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TC.1987.5009446","article-title":"Static scheduling of synchronous data flow programs for digital signal processing","volume":"C-36","author":"Lee","year":"1987","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"10.1016\/S0305-0548(02)00031-X_BIB4","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/PROC.1987.13876","article-title":"Synchronous data flow","volume":"75","author":"Lee","year":"1987","journal-title":"Proceedings of the IEEE"},{"issue":"11","key":"10.1016\/S0305-0548(02)00031-X_BIB5","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/29.46557","article-title":"Gabriel","volume":"37","author":"Lee","year":"1989","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"issue":"6","key":"10.1016\/S0305-0548(02)00031-X_BIB6","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00031-X_BIB7","series-title":"Computer and job-shop scheduling theory","author":"Coffman","year":"1976"},{"issue":"1","key":"10.1016\/S0305-0548(02)00031-X_BIB8","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0305-0548(02)00031-X_BIB9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","article-title":"Models of machines and computations for mapping in multicomputers","volume":"25","author":"Norman","year":"1993","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"10.1016\/S0305-0548(02)00031-X_BIB10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/71.273050","article-title":"Optimal processor assignment for a class of pipelined computations","volume":"5","author":"Choudhary","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"10.1016\/S0305-0548(02)00031-X_BIB11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/71.273051","article-title":"Allocating tree structured programs in a distributed system with uniform communication costs","volume":"5","author":"Billionnet","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"10.1016\/S0305-0548(02)00031-X_BIB12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1979.1675348","article-title":"Assignment of tasks in a distributed processor system with limited memory","volume":"C-28","author":"Rao","year":"1979","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"10.1016\/S0305-0548(02)00031-X_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"SE-3","author":"Stone","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"7","key":"10.1016\/S0305-0548(02)00031-X_BIB14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/C-M.1978.218272","article-title":"Control of distributed processes","volume":"11","author":"Stone","year":"1978","journal-title":"IEEE Computer"},{"issue":"10","key":"10.1016\/S0305-0548(02)00031-X_BIB15","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/T-C.1969.222542","article-title":"Optimal file allocation in a multiple computer system","volume":"C-18","author":"Chu","year":"1969","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"10.1016\/S0305-0548(02)00031-X_BIB16","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1982.1654050","article-title":"Heuristic models of task assignment scheduling in distributed systems","volume":"15","author":"Efe","year":"1982","journal-title":"IEEE Computer"},{"key":"10.1016\/S0305-0548(02)00031-X_BIB17","first-page":"79","article-title":"Scheduling of task graphs into transputer networks","volume":"59","author":"Fernandez","year":"1987","journal-title":"Congressus Numerantium"},{"issue":"3","key":"10.1016\/S0305-0548(02)00031-X_BIB18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/356698.356700","article-title":"Deterministic processor scheduling","volume":"9","author":"Gonzalez","year":"1977","journal-title":"ACM Computing Surveys"},{"issue":"12","key":"10.1016\/S0305-0548(02)00031-X_BIB19","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":"Communications of the ACM"},{"key":"10.1016\/S0305-0548(02)00031-X_BIB20","series-title":"Theory of scheduling","author":"Conway","year":"1967"},{"issue":"11","key":"10.1016\/S0305-0548(02)00031-X_BIB21","doi-asserted-by":"crossref","first-page":"1023","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 Transactions on Computers"},{"issue":"3","key":"10.1016\/S0305-0548(02)00031-X_BIB22","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1145\/321406.321408","article-title":"Production and stabilization of real-time task schedulers","volume":"14","author":"Manacher","year":"1967","journal-title":"Journal of the ACM"},{"issue":"2","key":"10.1016\/S0305-0548(02)00031-X_BIB23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/TC.1972.5008918","article-title":"Optimal scheduling strategies in a multiprocessor system","volume":"C-21","author":"Ramamoorthy","year":"1972","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"10.1016\/S0305-0548(02)00031-X_BIB24","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/71.277783","article-title":"Scheduling precedence constrained task graphs with non-negligible intertask communications onto multiprocessors","volume":"5","author":"Selvakumar","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"8","key":"10.1016\/S0305-0548(02)00031-X_BIB25","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/71.298216","article-title":"Lower and upper bounds on time for multiprocessor optimal schedules","volume":"5","author":"Jain","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"12","key":"10.1016\/S0305-0548(02)00031-X_BIB26","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/32.62447","article-title":"Lower bound on the number of processors and time for scheduling precedence graphs with communications costs","volume":"16","author":"Al-Mouhamed","year":"1990","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0305-0548(02)00031-X_BIB27","unstructured":"Lavoie M. Task assignment in a DSP multiprocessor environment. Master's Thesis, Technical Report SCE-90-18, Dept. of Systems and Computer Engineering, Carleton University, Ottawa, Canada, August 1990."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480200031X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480200031X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:58:27Z","timestamp":1556776707000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505480200031X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S030505480200031X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00031-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}