{"id":"https://openalex.org/W4283824155","doi":"https://doi.org/10.1109/iwqos54832.2022.9812865","title":"BUDA: Budget and Deadline Aware Scheduling Algorithm for Task Graphs in Heterogeneous Systems","display_name":"BUDA: Budget and Deadline Aware Scheduling Algorithm for Task Graphs in Heterogeneous Systems","publication_year":2022,"publication_date":"2022-06-10","ids":{"openalex":"https://openalex.org/W4283824155","doi":"https://doi.org/10.1109/iwqos54832.2022.9812865"},"language":"en","primary_location":{"id":"doi:10.1109/iwqos54832.2022.9812865","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos54832.2022.9812865","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","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/A5021957568","display_name":"Hamza Djigal","orcid":"https://orcid.org/0000-0003-1218-5682"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hamza Djigal","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100358867","display_name":"Linfeng Liu","orcid":"https://orcid.org/0000-0002-0824-6203"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Linfeng Liu","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038923039","display_name":"Luo Jian","orcid":"https://orcid.org/0000-0002-7034-6459"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Luo","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018815299","display_name":"Jia Xu","orcid":"https://orcid.org/0000-0002-0523-9673"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jia Xu","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023"],"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications,Jiangsu Key Laboratory of Big Data Security and Intelligent Processing,Nanjing,China,210023","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021957568"],"corresponding_institution_ids":["https://openalex.org/I41198531"],"apc_list":null,"apc_paid":null,"fwci":1.9086,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88640231,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998000264167786,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9995999932289124,"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.9944999814033508,"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.8383709192276001},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6242114305496216},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5688925385475159},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5498538017272949},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5210784673690796},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4574439227581024},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42635446786880493},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.41211581230163574},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3815919756889343},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2342696189880371},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15099453926086426},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.0965917706489563},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07250061631202698}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8383709192276001},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6242114305496216},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5688925385475159},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5498538017272949},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5210784673690796},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4574439227581024},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42635446786880493},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.41211581230163574},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3815919756889343},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2342696189880371},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15099453926086426},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0965917706489563},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07250061631202698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iwqos54832.2022.9812865","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos54832.2022.9812865","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W239946453","https://openalex.org/W1417403813","https://openalex.org/W1985416667","https://openalex.org/W1998082182","https://openalex.org/W2018198861","https://openalex.org/W2031725441","https://openalex.org/W2051644464","https://openalex.org/W2057392949","https://openalex.org/W2060240123","https://openalex.org/W2071180893","https://openalex.org/W2106076593","https://openalex.org/W2149294210","https://openalex.org/W2327866891","https://openalex.org/W2514834950","https://openalex.org/W2561389184","https://openalex.org/W2604792441","https://openalex.org/W2766496082","https://openalex.org/W2800076725","https://openalex.org/W2810678090","https://openalex.org/W2883668652","https://openalex.org/W2962760490","https://openalex.org/W2996865961","https://openalex.org/W2997305752","https://openalex.org/W3009473322","https://openalex.org/W3043337151","https://openalex.org/W3109215866","https://openalex.org/W3126186914","https://openalex.org/W3163373189","https://openalex.org/W3170788757","https://openalex.org/W3183673024","https://openalex.org/W6786697443","https://openalex.org/W6795739708"],"related_works":["https://openalex.org/W1545991362","https://openalex.org/W2184166483","https://openalex.org/W2167574351","https://openalex.org/W3184267879","https://openalex.org/W2545511463","https://openalex.org/W1935185185","https://openalex.org/W2978148977","https://openalex.org/W4300092030","https://openalex.org/W2377713709","https://openalex.org/W2128426273"],"abstract_inverted_index":{"Task":[0],"graphs":[1,120,186,190],"are":[2,71],"widely":[3],"used":[4,146],"to":[5,39,81,147,167],"represent":[6],"data-intensive":[7],"applications.":[8],"To":[9],"efficiently":[10],"execute":[11],"these":[12],"applications":[13,189],"on":[14,23,138,183],"heterogeneous":[15,58,128],"systems,":[16],"each":[17],"task":[18,33,119,176],"must":[19],"be":[20],"properly":[21],"scheduled":[22],"the":[24,27,32,61,72,89,94,133,169,174,193,197],"processors":[25],"of":[26,31,46,93,132,202],"system.":[28],"The":[29,130,180],"NP-completeness":[30],"scheduling":[34,50,85,121],"problem":[35],"has":[36,63],"motivated":[37],"researchers":[38],"propose":[40],"various":[41],"heuristic":[42,112],"methods.":[43],"Recently,":[44],"Quality":[45],"Service":[47],"(QoS)":[48],"aware":[49],"is":[51,79,136,145],"becoming":[52],"an":[53],"active":[54],"research":[55],"area":[56],"in":[57,127,200],"systems":[59],"because":[60],"end-user":[62],"different":[64],"QoS":[65],"requirements.":[66],"Generally,":[67],"time":[68,92,170,204],"and":[69,102,124,150,171,187,206],"cost":[70,172],"most":[73],"relevant":[74],"user":[75],"concerns.":[76],"However,":[77],"it":[78],"challenging":[80],"find":[82],"a":[83,110,139,158],"feasible":[84],"plan":[86],"which":[87],"minimizes":[88],"total":[90],"execution":[91],"user\u2019s":[95],"application":[96],"(makespan)":[97],"while":[98],"satisfying":[99],"both":[100],"budget":[101,123],"deadline":[103,125],"constraints.":[104],"In":[105,154],"this":[106],"paper,":[107],"we":[108,156],"present":[109],"novel":[111],"algorithm":[113,135,195],"called":[114],"Budget-Deadline-Aware-Scheduling":[115],"(BUDA)":[116],"that":[117,144,165,192],"addresses":[118],"under":[122],"constraints":[126],"systems.":[129],"novelty":[131],"BUDA":[134,194],"based":[137,182],"Heterogeneous":[140,160],"Time-Cost":[141,161],"Matrix":[142],"(HTCM)":[143],"prioritize":[148],"tasks":[149],"for":[151,173],"processor":[152],"selection.":[153],"addition,":[155],"introduce":[157],"new":[159],"Trade-off":[162],"factor":[163],"(HTCT)":[164],"tries":[166],"adjust":[168],"current":[175],"among":[177],"all":[178],"processors.":[179],"experiments":[181],"randomly":[184],"generated":[185],"real-world":[188],"show":[191],"outperforms":[196],"state-of-the-art":[198],"algorithms":[199],"terms":[201],"makespan,":[203],"efficiency,":[205],"success":[207],"rate.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-31T07:56:22.981413","created_date":"2025-10-10T00:00:00"}