{"id":"https://openalex.org/W2044606196","doi":"https://doi.org/10.1177/0037549711406911","title":"An effective duplication-based task-scheduling algorithm for heterogeneous systems","display_name":"An effective duplication-based task-scheduling algorithm for heterogeneous systems","publication_year":2011,"publication_date":"2011-06-03","ids":{"openalex":"https://openalex.org/W2044606196","doi":"https://doi.org/10.1177/0037549711406911","mag":"2044606196"},"language":"en","primary_location":{"id":"doi:10.1177/0037549711406911","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0037549711406911","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5003454718","display_name":"Mahsa Hosseinzadeh","orcid":"https://orcid.org/0000-0001-9328-1910"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mahsa Hosseinzadeh","raw_affiliation_strings":["Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran","[Electrical Engineering Department, Iran University of Science & Technology, Tehran, Iran]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":"[Electrical Engineering Department, Iran University of Science & Technology, Tehran, Iran]","institution_ids":["https://openalex.org/I67009956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016964685","display_name":"Hadi Shahriar Shahhoseini","orcid":"https://orcid.org/0000-0002-6042-0993"},"institutions":[{"id":"https://openalex.org/I67009956","display_name":"Iran University of Science and Technology","ror":"https://ror.org/01jw2p796","country_code":"IR","type":"education","lineage":["https://openalex.org/I67009956"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hadi Shahriar Shahhoseini","raw_affiliation_strings":["Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran","[Electrical Engineering Department, Iran University of Science & Technology, Tehran, Iran]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran","institution_ids":["https://openalex.org/I67009956"]},{"raw_affiliation_string":"[Electrical Engineering Department, Iran University of Science & Technology, Tehran, Iran]","institution_ids":["https://openalex.org/I67009956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67009956"],"apc_list":null,"apc_paid":null,"fwci":0.7155,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72689702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"87","issue":"12","first_page":"1067","last_page":"1080"},"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.9998999834060669,"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.9998999834060669,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8229957818984985},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5879486203193665},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5673123598098755},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5666462182998657},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48273274302482605},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.46481236815452576},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4517084062099457},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4486643075942993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4404427111148834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1468171775341034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09461468458175659}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8229957818984985},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5879486203193665},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5673123598098755},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5666462182998657},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48273274302482605},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.46481236815452576},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4517084062099457},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4486643075942993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4404427111148834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1468171775341034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09461468458175659},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0037549711406911","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0037549711406911","pdf_url":null,"source":{"id":"https://openalex.org/S32573412","display_name":"SIMULATION","issn_l":"0037-5497","issn":["0037-5497","1741-3133"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIMULATION","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1502928793","https://openalex.org/W1537714433","https://openalex.org/W1544290052","https://openalex.org/W1547274107","https://openalex.org/W1949097574","https://openalex.org/W1965919411","https://openalex.org/W1990640262","https://openalex.org/W2067761170","https://openalex.org/W2092776860","https://openalex.org/W2096709532","https://openalex.org/W2101578791","https://openalex.org/W2109854454","https://openalex.org/W2110059735","https://openalex.org/W2113860155","https://openalex.org/W2114719509","https://openalex.org/W2127706528","https://openalex.org/W2131363892","https://openalex.org/W2132180549","https://openalex.org/W2132829376","https://openalex.org/W2134752297","https://openalex.org/W2138066369","https://openalex.org/W2142296204","https://openalex.org/W2147514286","https://openalex.org/W2149294210","https://openalex.org/W2158556163","https://openalex.org/W2158691237","https://openalex.org/W2159361848","https://openalex.org/W2160969018","https://openalex.org/W2165239677","https://openalex.org/W2166483183","https://openalex.org/W2166666222","https://openalex.org/W2798812054","https://openalex.org/W3143043155","https://openalex.org/W4300669422"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2027972911","https://openalex.org/W2146343568","https://openalex.org/W2013643406","https://openalex.org/W2157978810","https://openalex.org/W2149404148","https://openalex.org/W1632514893"],"abstract_inverted_index":{"One":[0],"of":[1],"the":[2,36,54,56,98,115],"main":[3],"issues":[4],"in":[5],"distributed":[6,33],"computing":[7],"systems":[8],"is":[9,71],"to":[10,24,62,79,83],"determine":[11],"an":[12,21,64],"optimal":[13],"task-scheduling":[14],"method.":[15],"In":[16],"this":[17],"paper,":[18],"we":[19],"present":[20],"effective":[22,65],"algorithm":[23,48,70,74,108],"schedule":[25],"a":[26,31,72,76,81],"directed":[27],"acyclic":[28],"graph":[29],"onto":[30],"heterogeneous":[32],"system,":[34],"called":[35],"Earliest":[37,122],"Starting":[38],"and":[39,58,92,103,125],"Finishing":[40],"time":[41],"Duplication":[42],"based":[43],"(ESFD)":[44],"algorithm.":[45],"Our":[46],"proposed":[47],"considers":[49],"all":[50],"parameters":[51],"associated":[52],"with":[53,75],"processors,":[55],"task,":[57],"its":[59],"immediate":[60],"predecessors":[61],"perform":[63],"task":[66],"allocation.":[67],"The":[68],"ESFD":[69,107],"three-phase":[73],"dynamic":[77],"phase":[78],"assign":[80],"priority":[82],"each":[84],"task.":[85],"Simulation":[86],"results":[87],"on":[88],"both":[89],"random":[90],"graphs":[91,95],"real":[93],"application":[94],"show":[96],"that":[97],"network":[99],"storage":[100],"link,":[101],"speedup,":[102],"efficiency":[104],"generated":[105,113],"by":[106,114],"are":[109],"better":[110],"than":[111],"those":[112],"well-known":[116],"Heterogeneous":[117,121],"Critical":[118],"Parent":[119],"Trees,":[120],"Finish":[123],"Time,":[124],"Levelized":[126],"Heavily":[127],"Communicating":[128],"Node":[129],"First":[130],"algorithms.":[131]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}