{"id":"https://openalex.org/W136514839","doi":null,"title":"A Performance-Efficient Task Duplication-Based Scheduling Algorithm for Heterogeneous Computing.","display_name":"A Performance-Efficient Task Duplication-Based Scheduling Algorithm for Heterogeneous Computing.","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W136514839","mag":"136514839"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.9743","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.9743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iec.cugb.edu.cn/worldcomp2006/pdp4324.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080105556","display_name":"Yang-Ping Cheng","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang-Ping Cheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064940596","display_name":"Jiun-Hung Ding","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiun-Hung Ding","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Shih\u2010Hsiang Lo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shih\u2010Hsiang Lo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043627040","display_name":"Yeh\u2010Ching Chung","orcid":"https://orcid.org/0000-0002-8704-9821","observed_orcids":["https://orcid.org/0000-0002-8704-9821"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yeh\u2010Ching Chung","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-8704-9821","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"656","last_page":"662"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.8687000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.8687000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0949999988079071,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.007300000172108412,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task-scheduling","display_name":"task scheduling","score":0.9649999737739563},{"id":"https://openalex.org/keywords/heterogeneous-computing","display_name":"heterogeneous computing","score":0.8939999938011169},{"id":"https://openalex.org/keywords/task-duplication","display_name":"task duplication","score":0.9869999885559082},{"id":"https://openalex.org/keywords/communication-overhead-reduction","display_name":"communication cost reduction","score":0.843999981880188},{"id":"https://openalex.org/keywords/schedule-length-minimization","display_name":"schedule length minimization","score":0.8610000014305115},{"id":"https://openalex.org/keywords/weighted-directed-acyclic-graph","display_name":"weighted directed acyclic graph","score":0.8730000257492065},{"id":"https://openalex.org/keywords/heft","display_name":"HEFT","score":0.7269999980926514},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.7850000262260437}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7873409986495972},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5780020952224731},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49607405066490173},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4548502564430237},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4373512864112854},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43700775504112244},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4195478558540344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35438618063926697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1324254274368286},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12011510133743286},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10146364569664001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08112618327140808},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.9743","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.9743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iec.cugb.edu.cn/worldcomp2006/pdp4324.pdf","raw_type":"text"},{"id":"mag:136514839","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/pdpta/pdpta2006-2.html#ChengDLC06","pdf_url":null,"source":{"id":"https://openalex.org/S4306420677","display_name":"Parallel and Distributed Processing Techniques and Applications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Parallel and Distributed Processing Techniques and Applications","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W213174430","https://openalex.org/W2019356799","https://openalex.org/W2023753260","https://openalex.org/W2031415642","https://openalex.org/W2040466547","https://openalex.org/W2065689629","https://openalex.org/W2097911714","https://openalex.org/W2100550451","https://openalex.org/W2113947516","https://openalex.org/W2118396891","https://openalex.org/W2131363892","https://openalex.org/W2133465620","https://openalex.org/W2149294210","https://openalex.org/W2151038512","https://openalex.org/W2155951254","https://openalex.org/W2164631467","https://openalex.org/W3137896427"],"related_works":["https://openalex.org/W2351165627","https://openalex.org/W1760594881","https://openalex.org/W4283800734","https://openalex.org/W2407282828","https://openalex.org/W7098573610","https://openalex.org/W2055022889","https://openalex.org/W2044606196","https://openalex.org/W4385377072","https://openalex.org/W2129581052","https://openalex.org/W2091657695"],"abstract_inverted_index":{"Abstract-":[0],"Efficient":[1],"task":[2,49,53,75,99,130,146],"scheduling":[3,23,50,55,100,131,147],"algorithm":[4,73,148],"is":[5],"critical":[6],"for":[7,36,57,113],"application":[8,90],"programs":[9],"to":[10,67,78,84],"achieve":[11],"high":[12,69],"performance":[13,95],"in":[14,28,152],"heterogeneous":[15,52,62],"computing":[16],"systems.":[17],"Although":[18],"a":[19,47,58,105,109],"large":[20],"number":[21,60],"of":[22,32,61,89,96,154],"heuristics":[24],"have":[25,103,123],"been":[26],"presented":[27],"the":[29,37,80,86,94,97,125,138],"literature,":[30],"most":[31],"them":[33],"are":[34],"mainly":[35],"systems":[38],"with":[39,64,119,128],"homogeneous":[40],"processors.":[41],"In":[42],"this":[43],"paper,":[44],"we":[45,102],"present":[46],"novel":[48],"algorithm,":[51,101],"duplication":[54,76],"(HTDS),":[56],"bounded":[59],"processors":[63],"an":[65],"objective":[66],"meet":[68],"performance.":[70],"The":[71,140],"HTDS":[72,126],"uses":[74],"method":[77],"decrease":[79],"communication":[81],"overhead":[82],"and":[83,135],"minimize":[85],"schedule":[87],"length":[88],"programs.":[91],"To":[92],"evaluate":[93],"proposed":[98],"developed":[104],"simulator":[106],"that":[107,144],"contains":[108],"parametric":[110],"graph":[111],"generator":[112],"generating":[114],"weighted":[115],"directed":[116],"acyclic":[117],"graphs":[118],"various":[120],"characteristics.":[121],"We":[122],"implemented":[124],"along":[127],"three":[129],"algorithms,":[132],"HEFT,":[133],"LDBS1,":[134],"LDBS2,":[136],"on":[137],"simulator.":[139],"simulation":[141],"results":[142],"show":[143],"our":[145],"outperforms":[149],"other":[150],"algorithms":[151],"terms":[153],"speedup.":[155]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}