{"id":"https://openalex.org/W2107463456","doi":"https://doi.org/10.1109/cec.2006.1688723","title":"An Efficient Genetic Algorithm for Task Scheduling in Heterogeneous Distributed Computing Systems","display_name":"An Efficient Genetic Algorithm for Task Scheduling in Heterogeneous Distributed Computing Systems","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W2107463456","doi":"https://doi.org/10.1109/cec.2006.1688723","mag":"2107463456"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2006.1688723","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688723","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Evolutionary Computation","raw_type":"proceedings-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/A5045110068","display_name":"Mohammad I. Daoud","orcid":"https://orcid.org/0000-0002-9399-5769"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M.I. Daoud","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","Concordia University, Montr\u00e9al"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University, Montr\u00e9al","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007362775","display_name":"Nawwaf Kharma","orcid":"https://orcid.org/0000-0003-3399-3902"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N. Kharma","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","Concordia University, Montr\u00e9al"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University, Montr\u00e9al","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045110068"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":0.3018,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.64150712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3258","last_page":"3265"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":1.0,"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":1.0,"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.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"}},{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8432971239089966},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6150505542755127},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6110837459564209},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5673245191574097},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5639702081680298},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5047236680984497},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5046349763870239},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49022799730300903},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.468546986579895},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.46656695008277893},{"id":"https://openalex.org/keywords/symmetric-multiprocessor-system","display_name":"Symmetric multiprocessor system","score":0.4482821524143219},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.41219621896743774},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1438574194908142},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07381683588027954}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8432971239089966},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6150505542755127},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6110837459564209},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5673245191574097},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5639702081680298},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5047236680984497},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5046349763870239},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49022799730300903},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.468546986579895},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.46656695008277893},{"id":"https://openalex.org/C172430144","wikidata":"https://www.wikidata.org/wiki/Q17111997","display_name":"Symmetric multiprocessor system","level":2,"score":0.4482821524143219},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41219621896743774},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1438574194908142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07381683588027954},{"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.1109/cec.2006.1688723","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2006.1688723","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Conference on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2009277123","https://openalex.org/W2023753260","https://openalex.org/W2040466547","https://openalex.org/W2097911714","https://openalex.org/W2118173476","https://openalex.org/W2149294210","https://openalex.org/W2150532704","https://openalex.org/W2151038512","https://openalex.org/W2155951254","https://openalex.org/W2163109311","https://openalex.org/W4247225412"],"related_works":["https://openalex.org/W3184267879","https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2545511463","https://openalex.org/W2167574351","https://openalex.org/W2106332846","https://openalex.org/W4300092030","https://openalex.org/W2978148977","https://openalex.org/W2225350526","https://openalex.org/W1526709096"],"abstract_inverted_index":{"Task":[0],"scheduling":[1,19,31,75],"plays":[2],"an":[3],"important":[4],"role":[5],"in":[6,23,109],"the":[7,24,65,99,102,106],"operation":[8],"of":[9,14,64,72,93,101,111],"distributed":[10],"computing":[11],"systems.":[12],"Because":[13],"its":[15],"importance,":[16],"several":[17],"task":[18,88,91],"algorithms":[20,32,76],"are":[21,33],"proposed":[22,34],"literature,":[25],"mainly":[26],"for":[27,35,60,77],"homogeneous":[28],"processors.":[29],"Few":[30],"Heterogeneous":[36],"Distributed":[37],"Computing":[38],"Systems":[39],"(HeDCSs).":[40],"In":[41],"this":[42],"paper,":[43],"we":[44],"present":[45],"a":[46,51],"new":[47,66,103],"approach":[48],"which":[49,81],"uses":[50],"customized":[52],"genetic":[53],"algorithm":[54,67,104],"to":[55,70],"produce":[56],"high-quality":[57],"tasks":[58],"schedules":[59],"HeDCSs.":[61,78],"The":[62,79],"performance":[63],"is":[68,82],"compared":[69],"that":[71],"two":[73],"leading":[74],"comparison,":[80],"based":[83],"on":[84],"both":[85],"randomly":[86],"generated":[87],"graphs":[89,92],"and":[90,115],"certain":[94],"real-world":[95],"numerical":[96],"applications,":[97],"exhibits":[98],"supremacy":[100],"over":[105],"older":[107],"ones,":[108],"terms":[110],"schedule":[112],"length,":[113],"speedup":[114],"efficiency.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}