{"id":"https://openalex.org/W7127604906","doi":"https://doi.org/10.48550/arxiv.2602.03081","title":"Studying the Effect of Schedule Preemption on Dynamic Task Graph Scheduling","display_name":"Studying the Effect of Schedule Preemption on Dynamic Task Graph Scheduling","publication_year":2026,"publication_date":"2026-02-03","ids":{"openalex":"https://openalex.org/W7127604906","doi":"https://doi.org/10.48550/arxiv.2602.03081"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.03081","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03081","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.03081","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5117427929","display_name":"Mohammadali Khodabandehlou","orcid":"https://orcid.org/0009-0005-5791-5337"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Khodabandehlou, Mohammadali","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025634277","display_name":"Jared Coleman","orcid":"https://orcid.org/0000-0003-1227-2962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Coleman, Jared","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125040854","display_name":"Niranjan Suri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Suri, Niranjan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125028950","display_name":"Bhaskar Krishnamachari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krishnamachari, Bhaskar","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5117427929"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.33660000562667847,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.33660000562667847,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.19030000269412994,"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.12219999730587006,"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/preemption","display_name":"Preemption","score":0.8899999856948853},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5659000277519226},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5333999991416931},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5131000280380249},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4442000091075897},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.4000999927520752},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.3968000113964081},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.3921000063419342}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8899999856948853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7558000087738037},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5659000277519226},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5333999991416931},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5131000280380249},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4442000091075897},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44290000200271606},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.4000999927520752},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.3968000113964081},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3921000063419342},{"id":"https://openalex.org/C37736160","wikidata":"https://www.wikidata.org/wiki/Q1801315","display_name":"Adversarial system","level":2,"score":0.3871999979019165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37220001220703125},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32899999618530273},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3158999979496002},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.2912999987602234},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26809999346733093},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.25940001010894775}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.03081","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03081","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.03081","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.03081","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Dynamic":[0],"scheduling":[1],"of":[2,71],"task":[3,11,34],"graphs":[4,35],"is":[5],"often":[6],"addressed":[7],"without":[8],"revisiting":[9],"prior":[10],"allocations,":[12],"with":[13],"a":[14],"primary":[15],"focus":[16],"on":[17],"minimizing":[18],"makespan.":[19],"We":[20],"study":[21],"controlled":[22],"schedule":[23],"preemption,":[24],"introducing":[25],"the":[26],"Last-K":[27],"Preemption":[28],"model,":[29],"which":[30],"selectively":[31],"reschedules":[32],"recent":[33],"while":[36,74],"preserving":[37],"earlier":[38],"allocations.":[39],"Using":[40],"synthetic,":[41],"RIoTBench,":[42],"WFCommons,":[43],"and":[44,51,58,68,77],"adversarial":[45],"workloads,":[46],"we":[47],"compare":[48],"preemptive,":[49],"non-preemptive,":[50],"partial-preemptive":[52],"strategies":[53],"across":[54],"makespan,":[55],"fairness,":[56],"utilization,":[57],"runtime.":[59],"Results":[60],"show":[61],"moderate":[62],"preemption":[63,73],"can":[64],"match":[65],"most":[66],"makespan":[67],"utilization":[69],"gains":[70],"full":[72],"maintaining":[75],"fairness":[76],"low":[78],"overhead.":[79]},"counts_by_year":[],"updated_date":"2026-02-06T02:05:47.483045","created_date":"2026-02-06T00:00:00"}
