{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:43:55Z","timestamp":1648853035972},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[1995,12]]},"abstract":"<jats:p> Suboptimal solutions to the NP-complete problem of scheduling in a multiprocessing system are achievable with the aid of heuristic methods. Development and evaluation of static scheduling heuristics for real-time multiprocessing systems have inherited techniques from work for non-real-time systems. Unfortunately, the existing techniques compromise the results of the scheduling effort by limiting the scope of the problem. In this paper we present results of experimentation in which the parameters of the Directed Acyclic Graph (DAG) are enhanced to more correctly correspond to those of a real-world application. A method of specifying weighted combinations and priorities of simple scheduling heuristics to the scheduling algorithm is presented. Results of the compound heuristics are compared to the results of previous work in the field with some interesting conclusions. <\/jats:p>","DOI":"10.1142\/s0129626495000539","type":"journal-article","created":{"date-parts":[[2004,11,10]],"date-time":"2004-11-10T11:14:37Z","timestamp":1100085277000},"page":"599-610","source":"Crossref","is-referenced-by-count":1,"title":["EVALUATION OF STATIC SCHEDULING HEURISTICS FOR REAL-TIME MULTIPROCESSING"],"prefix":"10.1142","volume":"05","author":[{"given":"BEHROOZ","family":"SHIRAZI","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, Texas 76019, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HEE YONG","family":"YOUN","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, Texas 76019, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DANIEL M.","family":"LORTS","sequence":"additional","affiliation":[{"name":"E-Systems, Incorporated, FM1570 Majors Field CBN 017, Greenville, Texas 75403, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626495000539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:33:16Z","timestamp":1565184796000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626495000539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1995,12]]}},"alternative-id":["10.1142\/S0129626495000539"],"URL":"https:\/\/doi.org\/10.1142\/s0129626495000539","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}