{"id":"https://openalex.org/W2810307597","doi":"https://doi.org/10.1109/uic-atc.2017.8397655","title":"Optimizing scheduling for heterogeneous computing systems using combinatorial meta-heuristic solution","display_name":"Optimizing scheduling for heterogeneous computing systems using combinatorial meta-heuristic solution","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2810307597","doi":"https://doi.org/10.1109/uic-atc.2017.8397655","mag":"2810307597"},"language":"en","primary_location":{"id":"doi:10.1109/uic-atc.2017.8397655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uic-atc.2017.8397655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computed, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)","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/A5057820355","display_name":"Amin Majd","orcid":"https://orcid.org/0000-0001-7256-6618"},"institutions":[{"id":"https://openalex.org/I130217899","display_name":"\u00c5bo Akademi University","ror":"https://ror.org/029pk6x14","country_code":"FI","type":"education","lineage":["https://openalex.org/I130217899"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Amin Majd","raw_affiliation_strings":["Department of Information Technology, Abo Akademi University, Turku, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Abo Akademi University, Turku, Finland","institution_ids":["https://openalex.org/I130217899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086876072","display_name":"Golnaz Sahebi","orcid":null},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Golnaz Sahebi","raw_affiliation_strings":["Malardalen University, Vasteras, Sweden"],"affiliations":[{"raw_affiliation_string":"Malardalen University, Vasteras, Sweden","institution_ids":["https://openalex.org/I82509713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063193249","display_name":"Masoud Daneshtalab","orcid":"https://orcid.org/0000-0001-6289-1521"},"institutions":[{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"education","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Masoud Daneshtalab","raw_affiliation_strings":["Department of Information Technology, University of Turku, Turku, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I155660961"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070192715","display_name":"Elena Troubitsyn\u00e5","orcid":null},"institutions":[{"id":"https://openalex.org/I130217899","display_name":"\u00c5bo Akademi University","ror":"https://ror.org/029pk6x14","country_code":"FI","type":"education","lineage":["https://openalex.org/I130217899"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Elena Troubitsyna","raw_affiliation_strings":["Department of Information Technology, Abo Akademi University, Turku, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Information Technology, Abo Akademi University, Turku, Finland","institution_ids":["https://openalex.org/I130217899"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057820355"],"corresponding_institution_ids":["https://openalex.org/I130217899"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.28842164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9997000098228455,"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.9983999729156494,"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.832004725933075},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5459871888160706},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5456588268280029},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5090457797050476},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4611625075340271},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4502696990966797},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.43505141139030457},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4340035021305084},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3904574513435364},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3770343065261841},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3367130756378174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1928480565547943}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.832004725933075},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5459871888160706},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5456588268280029},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5090457797050476},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4611625075340271},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4502696990966797},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.43505141139030457},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4340035021305084},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3904574513435364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3770343065261841},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3367130756378174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1928480565547943},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/uic-atc.2017.8397655","is_oa":false,"landing_page_url":"https://doi.org/10.1109/uic-atc.2017.8397655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computed, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/68e1ebd8-126b-4dba-8624-0534c02e389f","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/8397655","pdf_url":null,"source":{"id":"https://openalex.org/S4406923060","display_name":"\u00c5bo Akademi University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Majd , A , Sahebi , G , Daneshtalab , M & Troubitsyna , E 2017 , Optimizing Scheduling for Heterogeneous Computing Systems using Combinatorial Meta-heuristic Solution . in 2017 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computed, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) . IEEE , pp. \u2013 , IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computed, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI) , 04/08/17 . https://doi.org/10.1109/UIC-ATC.2017.8397655","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1868841418","https://openalex.org/W1963817896","https://openalex.org/W1964581121","https://openalex.org/W1979183926","https://openalex.org/W1982721171","https://openalex.org/W2022673945","https://openalex.org/W2027197113","https://openalex.org/W2033011996","https://openalex.org/W2057108708","https://openalex.org/W2058338151","https://openalex.org/W2094234826","https://openalex.org/W2097036543","https://openalex.org/W2099956623","https://openalex.org/W2110355119","https://openalex.org/W2112998751","https://openalex.org/W2118396891","https://openalex.org/W2121800009","https://openalex.org/W2124903056","https://openalex.org/W2127459836","https://openalex.org/W2145771636","https://openalex.org/W2151038512","https://openalex.org/W2160847478","https://openalex.org/W2172250608","https://openalex.org/W2303515842","https://openalex.org/W2509064609","https://openalex.org/W2518956575","https://openalex.org/W2600141734","https://openalex.org/W4234170792","https://openalex.org/W4247277820","https://openalex.org/W4253408813","https://openalex.org/W6639051974","https://openalex.org/W6641417333","https://openalex.org/W6664949214","https://openalex.org/W6677697167"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2106332846","https://openalex.org/W3036719625","https://openalex.org/W2372008037","https://openalex.org/W2397293317","https://openalex.org/W2978148977","https://openalex.org/W2545511463","https://openalex.org/W2167574351","https://openalex.org/W1545991362","https://openalex.org/W2225350526"],"abstract_inverted_index":{"Today,":[0],"based":[1],"on":[2,126,141],"fast":[3],"development":[4],"especially":[5,156],"in":[6,19,45,66,84,88],"Network-on-Chip":[7],"(NoC)-based":[8],"many-core":[9,145],"systems,":[10],"the":[11,32,41,49,79,85,92,186,190,199],"task":[12,82,136],"scheduling":[13,33,116,187],"problem":[14,34],"plays":[15],"a":[16,63,67,74,99,105,110,127,142,172,206],"critical":[17],"role":[18],"high-performance":[20],"computing.":[21],"It":[22],"is":[23,35,52,201],"an":[24,153],"NP-hard":[25],"problem.":[26],"The":[27,196],"complexity":[28],"increases":[29],"further":[30],"when":[31],"applied":[36],"to":[37,47,61,77,90],"heterogeneous":[38,86,143],"platforms.":[39],"Exploring":[40],"whole":[42],"search":[43],"space":[44],"order":[46,89],"find":[48,62],"optimal":[50],"solution":[51,65],"not":[53],"time":[54,164],"efficient,":[55],"thus":[56],"metaheuristics":[57],"are":[58,131],"mostly":[59],"used":[60],"near-optimal":[64,81,115],"reasonable":[68],"amount":[69],"of":[70,198],"time.":[71,94],"We":[72,108,151],"propose":[73],"compound":[75],"method":[76,103,113,175],"select":[78],"best":[80],"schedule":[83],"platform":[87,146],"minimize":[91],"execution":[93,140,163],"For":[95],"this,":[96],"we":[97,170],"combine":[98],"new":[100],"parallel":[101],"meta-heuristic":[102],"with":[104,147],"greedy":[106],"scheme.":[107],"introduce":[109,152],"novel":[111,173],"metaheuristic":[112],"for":[114,122,139,157,185],"that":[117,160],"can":[118],"provide":[119],"performance":[120],"guarantees":[121],"multiple":[123],"applications":[124],"implemented":[125],"shared":[128],"platform.":[129],"Applications":[130],"modeled":[132],"as":[133,215],"directed":[134],"acyclic":[135],"graphs":[137],"(DAG)":[138],"NoC-based":[144],"given":[148],"communication":[149],"costs.":[150],"order-based":[154],"encoding":[155],"pipelined":[158],"operation":[159],"improves":[161],"(decreases)":[162],"by":[165,177,203],"more":[166],"than":[167],"46%.":[168],"Moreover,":[169],"present":[171],"multi-population":[174],"inspired":[176],"both":[178],"genetic":[179],"and":[180,193,212],"imperialist":[181],"competitive":[182],"algorithms":[183],"specialized":[184],"problem,":[188],"improving":[189],"convergence":[191],"policy":[192],"selection":[194],"pressure.":[195],"potential":[197],"approach":[200],"demonstrated":[202],"experiments":[204],"using":[205],"Sobel":[207],"filter,":[208,210],"SUSAN":[209],"RASTA-PLP,":[211],"JPEG":[213],"encoder":[214],"real-world":[216],"case":[217],"studies.":[218]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}