{"id":"https://openalex.org/W2962760490","doi":"https://doi.org/10.1145/3339186.3339206","title":"Task Scheduling for Heterogeneous Computing using a Predict Cost Matrix","display_name":"Task Scheduling for Heterogeneous Computing using a Predict Cost Matrix","publication_year":2019,"publication_date":"2019-07-22","ids":{"openalex":"https://openalex.org/W2962760490","doi":"https://doi.org/10.1145/3339186.3339206","mag":"2962760490"},"language":"en","primary_location":{"id":"doi:10.1145/3339186.3339206","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3339186.3339206","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3339186.3339206&file=a25-djigal-corrigendum.pdf&download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshop Proceedings of the 48th International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3339186.3339206&file=a25-djigal-corrigendum.pdf&download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021957568","display_name":"Hamza Djigal","orcid":"https://orcid.org/0000-0003-1218-5682"},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hamza Djigal","raw_affiliation_strings":["College of Computer and Information, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information, Nanjing, China","institution_ids":["https://openalex.org/I200845125"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101844109","display_name":"Jun Feng","orcid":"https://orcid.org/0000-0002-2627-5403"},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun Feng","raw_affiliation_strings":["College of Computer and Information, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information, Nanjing, China","institution_ids":["https://openalex.org/I200845125"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036273604","display_name":"Jiamin Lu","orcid":"https://orcid.org/0000-0002-0643-0736"},"institutions":[{"id":"https://openalex.org/I200845125","display_name":"Nanjing University of Information Science and Technology","ror":"https://ror.org/02y0rxk19","country_code":"CN","type":"education","lineage":["https://openalex.org/I200845125"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiamin Lu","raw_affiliation_strings":["College of Computer and Information, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information, Nanjing, China","institution_ids":["https://openalex.org/I200845125"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021957568"],"corresponding_institution_ids":["https://openalex.org/I200845125"],"apc_list":null,"apc_paid":null,"fwci":3.3398,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.92941943,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9979000091552734,"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.9957000017166138,"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.8127284646034241},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7034406661987305},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6257345080375671},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6188854575157166},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6007948517799377},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5420838594436646},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5281605124473572},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.499222993850708},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4747522175312042},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3909178674221039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3767285943031311},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3751814365386963},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.241327166557312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07890748977661133},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0782235860824585},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.053907543420791626}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8127284646034241},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7034406661987305},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6257345080375671},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6188854575157166},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6007948517799377},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5420838594436646},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5281605124473572},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.499222993850708},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4747522175312042},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3909178674221039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3767285943031311},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3751814365386963},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.241327166557312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07890748977661133},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0782235860824585},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.053907543420791626}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3339186.3339206","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3339186.3339206","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3339186.3339206&file=a25-djigal-corrigendum.pdf&download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshop Proceedings of the 48th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3339186.3339206","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3339186.3339206","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3339186.3339206&file=a25-djigal-corrigendum.pdf&download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Workshop Proceedings of the 48th International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2962760490.pdf","grobid_xml":"https://content.openalex.org/works/W2962760490.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W178407265","https://openalex.org/W239946453","https://openalex.org/W1936679285","https://openalex.org/W1995279652","https://openalex.org/W2021529311","https://openalex.org/W2023753260","https://openalex.org/W2028351695","https://openalex.org/W2033676590","https://openalex.org/W2036337911","https://openalex.org/W2068612352","https://openalex.org/W2070307035","https://openalex.org/W2095930915","https://openalex.org/W2096709532","https://openalex.org/W2106076593","https://openalex.org/W2118396891","https://openalex.org/W2143031615","https://openalex.org/W2149294210","https://openalex.org/W2152275923","https://openalex.org/W2163354311","https://openalex.org/W2172250608","https://openalex.org/W2264711506","https://openalex.org/W2300268035","https://openalex.org/W2316339787","https://openalex.org/W2343962288","https://openalex.org/W2462800345","https://openalex.org/W2519876678","https://openalex.org/W2613221718","https://openalex.org/W2768659692","https://openalex.org/W2796304651"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2184166483","https://openalex.org/W1545991362","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W4386128920","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W4390711951","https://openalex.org/W2372008037"],"abstract_inverted_index":{"This":[0,98],"paper":[1],"presents":[2],"a":[3,27,103],"list-based":[4],"scheduling":[5,23,50,120,150],"algorithm":[6,72,116,141],"called":[7],"Predict":[8],"Priority":[9],"Task":[10],"Scheduling":[11],"(PPTS)":[12],"for":[13],"heterogeneous":[14],"computing.":[15],"The":[16,67,132],"main":[17],"goal":[18],"is":[19,73,99],"to":[20,76],"minimize":[21],"the":[22,31,35,39,44,63,70,82,89,95,110,114,119,124,128,143],"length":[24,121,151],"by":[25],"introducing":[26],"lookahead":[28],"feature":[29,60],"in":[30,62,81,88,147],"two":[32,111],"phases":[33,112],"of":[34,69,113,127,149],"PPTS":[36,71,140],"algorithm,":[37],"namely":[38],"task":[40,90],"prioritizing":[41,91],"phase":[42,85],"and":[43,55,122],"processor":[45,64,83],"selection":[46,65,84],"phase.":[47,66],"Existing":[48],"list":[49],"algorithms,":[51],"such":[52],"as":[53],"PEFT":[54],"Lookahead":[56],"have":[57],"introduced":[58],"this":[59],"only":[61,80],"novelty":[68],"its":[74],"ability":[75],"look":[77],"ahead":[78],"not":[79],"but":[86],"also":[87],"phase,":[92],"without":[93],"increasing":[94],"time":[96],"complexity.":[97],"achieved":[100],"based":[101,134],"on":[102,135],"predict":[104],"cost":[105],"matrix":[106],"(PCM),":[107],"which":[108],"determines":[109],"proposed":[115],"while":[117],"minimizing":[118],"maintaining":[123],"same":[125],"complexity":[126],"existing":[129,144],"related":[130,145],"algorithms.":[131],"experiments":[133],"real":[136],"applications":[137],"show":[138],"that":[139],"outperforms":[142],"algorithms":[146],"terms":[148],"ratio.":[152]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4}],"updated_date":"2026-03-31T07:56:22.981413","created_date":"2025-10-10T00:00:00"}