{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T06:13:41Z","timestamp":1770444821435,"version":"3.49.0"},"reference-count":18,"publisher":"Wiley","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11372067"],"award-info":[{"award-number":["11372067"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2016]]},"abstract":"High-performance heterogeneous computing systems are achieved by the use of efficient application scheduling algorithms. However, most of the current algorithms have low efficiency in scheduling. Aiming at solving this problem, we propose a novel task scheduling algorithm for heterogeneous computing named HSIP (heterogeneous scheduling algorithm with improved task priority) whose functionality relies on three pillars: (1<\/mml:mn><\/mml:mrow><\/mml:math>) an improved task priority strategy based on standard deviation with improved magnitude as computation weight and communication cost weight to make scheduling priority more reasonable; (2<\/mml:mn><\/mml:mrow><\/mml:math>) an entry task duplication selection policy to make the makespan shorter; and (3<\/mml:mn><\/mml:mrow><\/mml:math>) an improved idle time slots (ITS) insertion-based optimizing policy to make the task scheduling more efficient. We evaluate our proposed algorithm on randomly generated DAGs, using some real application DAGs by comparison with some classical scheduling algorithms. According to the experimental results, our proposed algorithm appears to perform better than other algorithms in terms of schedule length ratio, efficiency, and frequency of best results.<\/jats:p>","DOI":"10.1155\/2016\/3676149","type":"journal-article","created":{"date-parts":[[2016,3,17]],"date-time":"2016-03-17T17:01:53Z","timestamp":1458234113000},"page":"1-11","source":"Crossref","is-referenced-by-count":28,"title":["HSIP: A Novel Task Scheduling Algorithm for Heterogeneous Computing"],"prefix":"10.1155","volume":"2016","author":[{"given":"Guan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Software Technology, Dalian University of Technology, Dalian 116620, China"},{"name":"Liaoning Police College, Dalian 116036, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software Technology, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"He","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Software Technology, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","first-page":"679","volume-title":"Heterogeneous distributed computing","volume":"8","year":"1999"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63574-2_14"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2005.04.002"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.57"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1581"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.06.005"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e90-d.4.736"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2010.12.004"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/71.265940"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2002.1850"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.05.015"},{"key":"18","first-page":"193","volume-title":"High performance task scheduling algorithm for heterogeneous computing system","year":"2005"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2007.94.103"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.01.003"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1206502"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.11"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/71.707547"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2016\/3676149.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2016\/3676149.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2016\/3676149.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T09:31:00Z","timestamp":1469525460000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/sp\/2016\/3676149\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":18,"alternative-id":["3676149","3676149"],"URL":"https:\/\/doi.org\/10.1155\/2016\/3676149","relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"value":"1058-9244","type":"print"},{"value":"1875-919X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}