{"id":"https://openalex.org/W7131396082","doi":"https://doi.org/10.48550/arxiv.2602.20561","title":"A Granularity Characterization of Task Scheduling Effectiveness","display_name":"A Granularity Characterization of Task Scheduling Effectiveness","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131396082","doi":"https://doi.org/10.48550/arxiv.2602.20561"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.20561","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.20561","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.20561","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126836162","display_name":"Sana Taghipour Anvar","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anvari, Sana Taghipour","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5123474332","display_name":"David Kaeli","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaeli, David","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5126836162"],"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.7473000288009644,"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.7473000288009644,"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.1274999976158142,"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.0851999968290329,"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/granularity","display_name":"Granularity","score":0.8016999959945679},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6389999985694885},{"id":"https://openalex.org/keywords/software-portability","display_name":"Software portability","score":0.5690000057220459},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5482000112533569},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5296000242233276},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4609000086784363},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4325000047683716},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.3564999997615814}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8083000183105469},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.8016999959945679},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6524999737739563},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6389999985694885},{"id":"https://openalex.org/C63000827","wikidata":"https://www.wikidata.org/wiki/Q3080428","display_name":"Software portability","level":2,"score":0.5690000057220459},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5482000112533569},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5314000248908997},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5296000242233276},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4609000086784363},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.3564999997615814},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.3098999857902527},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3050999939441681},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.2989000082015991},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.2635999917984009},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2533000111579895},{"id":"https://openalex.org/C2780870223","wikidata":"https://www.wikidata.org/wiki/Q1004415","display_name":"Runtime system","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2515000104904175}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.20561","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.20561","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.20561","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.20561","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":[{"display_name":"Peace, Justice and strong institutions","score":0.6405526995658875,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Task-based":[0],"runtime":[1,182],"systems":[2],"provide":[3],"flexible":[4],"load":[5],"balancing":[6],"and":[7,131,157,178],"portability":[8],"for":[9,40,46,185],"parallel":[10,129,142],"scientific":[11],"applications,":[12],"but":[13],"their":[14],"strong":[15],"scaling":[16],"is":[17,56,69],"highly":[18],"sensitive":[19],"to":[20,32,35,87],"task":[21],"granularity.":[22],"As":[23],"parallelism":[24],"increases,":[25],"scheduling":[26,68,84,123,133],"overhead":[27,85,103,124,134,168],"may":[28],"transition":[29],"from":[30,171],"negligible":[31,45],"dominant,":[33],"leading":[34],"rapid":[36],"drops":[37],"in":[38,162],"performance":[39],"some":[41],"algorithms,":[42],"while":[43],"remaining":[44],"others.":[47],"Although":[48],"such":[49],"effects":[50],"are":[51],"widely":[52],"observed":[53,161],"empirically,":[54],"there":[55],"a":[57,77,116,180],"general":[58],"lack":[59],"of":[60],"understanding":[61],"how":[62,102],"algorithmic":[63],"structure":[64],"impacts":[65],"whether":[66],"dynamic":[67,187],"always":[70],"beneficial.":[71],"In":[72],"this":[73,109],"work,":[74],"we":[75,111,148],"introduce":[76],"granularity":[78,118],"characterization":[79,153],"framework":[80],"that":[81,93,120,150,167],"directly":[82],"links":[83],"growth":[86],"task-graph":[88],"dependency":[89,94,146,172],"topology.":[90],"We":[91,164],"show":[92,166],"structure,":[95],"rather":[96],"than":[97],"problem":[98],"size":[99],"alone,":[100],"governs":[101],"scales":[104],"with":[105,144],"parallelism.":[106],"Based":[107],"on":[108,140],"observation,":[110],"characterize":[112],"execution":[113,190],"behavior":[114],"using":[115],"simple":[117],"measure":[119],"indicates":[121],"when":[122,132],"can":[125],"be":[126],"amortized":[127],"by":[128],"computation":[130],"dominates":[135],"performance.":[136],"Through":[137],"experimental":[138],"evaluation":[139],"representative":[141],"workloads":[143],"diverse":[145],"patterns,":[147],"demonstrate":[149],"the":[151],"proposed":[152],"explains":[154],"both":[155],"gradual":[156],"abrupt":[158],"strong-scaling":[159,176,194],"breakdowns":[160],"practice.":[163],"further":[165],"models":[169],"derived":[170],"topology":[173],"accurately":[174],"predict":[175],"limits":[177],"enable":[179],"practical":[181],"decision":[183],"rule":[184],"selecting":[186],"or":[188,196],"static":[189],"without":[191],"requiring":[192],"exhaustive":[193],"studies":[195],"extensive":[197],"offline":[198],"tuning.":[199]},"counts_by_year":[],"updated_date":"2026-02-27T06:17:20.405678","created_date":"2026-02-26T00:00:00"}
