{"id":"https://openalex.org/W7163638510","doi":"https://doi.org/10.48550/arxiv.2606.05933","title":"Beyond Greedy Chunking: SLO-Aware Sliding-Window Scheduling for LLM Inference","display_name":"Beyond Greedy Chunking: SLO-Aware Sliding-Window Scheduling for LLM Inference","publication_year":2026,"publication_date":"2026-06-04","ids":{"openalex":"https://openalex.org/W7163638510","doi":"https://doi.org/10.48550/arxiv.2606.05933"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.05933","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.05933","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.05933","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137965924","display_name":"Yuansheng Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Yuansheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137930870","display_name":"yue zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011076660","display_name":"Xuan Mo","orcid":"https://orcid.org/0000-0001-6858-9307"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mo, Xuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108675220","display_name":"Weigang Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Weigang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100679362","display_name":"Jialun Li","orcid":"https://orcid.org/0000-0003-0941-9820"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Jialun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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/T12127","display_name":"Software System Performance and Reliability","score":0.17790000140666962,"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/T12127","display_name":"Software System Performance and Reliability","score":0.17790000140666962,"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/T14347","display_name":"Big Data and Digital Economy","score":0.11680000275373459,"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/T11986","display_name":"Scientific Computing and Data Management","score":0.0989999994635582,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6215000152587891},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.5170000195503235},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.48410001397132874},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4796999990940094},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.44940000772476196},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.44510000944137573},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.3564999997615814},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.3160000145435333},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3147999942302704}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8525999784469604},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6215000152587891},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5562000274658203},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.48410001397132874},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4796999990940094},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.44940000772476196},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.3564999997615814},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33880001306533813},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.3160000145435333},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3147999942302704},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.313400000333786},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3077000081539154},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.301800012588501},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.28200000524520874},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.2745000123977661},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.2669999897480011},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.2558000087738037},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.05933","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.05933","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.05933","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.05933","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":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5124738216400146,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"With":[0],"the":[1,87,103,107,116,146,163,170,174,205],"rapid":[2],"growth":[3],"of":[4,62,90,152,165,178,207],"interactive":[5],"applications":[6],"in":[7,27,51,134,169],"large":[8],"language":[9],"model":[10],"(LLM)":[11],"online":[12,75],"services,":[13],"maintaining":[14,121],"high":[15],"system":[16,73,118],"throughput":[17,119],"while":[18,120],"ensuring":[19],"user-perceived":[20],"latency":[21,83],"has":[22],"become":[23],"a":[24,69,80,91],"key":[25],"issue":[26],"inference":[28,214],"scheduling.":[29],"Existing":[30],"LLM":[31,76],"service":[32,63,187],"systems":[33,197],"rely":[34],"on":[35,94],"coarse-grained":[36],"output":[37],"constraints,":[38],"making":[39],"it":[40],"difficult":[41],"to":[42,85,99,110,130,136,161,167,191,194],"effectively":[43],"handle":[44],"resource":[45,53],"contention":[46],"among":[47],"multiple":[48,143],"requests,":[49],"resulting":[50],"low":[52],"utilization":[54],"efficiency":[55],"and":[56,106,114,139,202],"limited":[57],"support":[58],"for":[59,74],"fine-grained":[60],"quality":[61],"(QoS)":[64],"differentiation.":[65],"We":[66],"present":[67],"SlidingServe,":[68],"sliding-window-driven":[70],"SLO-Aware":[71],"scheduling":[72,196],"inference.":[77],"SlidingServe":[78,96,125,184],"designed":[79],"lightweight":[81],"batch":[82,148],"predictor":[84],"estimate":[86],"execution":[88],"time":[89],"batch.":[92],"Based":[93],"this,":[95],"uses":[97,158],"SlidingChunker":[98],"combine":[100],"information":[101],"from":[102],"current":[104,171],"iteration":[105,109],"next":[108],"achieve":[111],"dynamic":[112,159],"chunking":[113],"improve":[115,186],"overall":[117],"strict":[122],"QoS":[123],"guarantees.":[124],"introduces":[126,155],"Multi-Level":[127],"Priority":[128],"Sorter":[129],"sort":[131],"candidate":[132],"requests":[133,144,166],"order":[135],"balance":[137],"fairness":[138],"efficiency.":[140],"Additionally,":[141],"when":[142],"within":[145],"same":[147],"are":[149],"at":[150],"risk":[151,177],"SLO":[153,175,208],"violating,SlidingServe":[154],"BatchConstructor,":[156],"which":[157],"programming":[160],"select":[162],"set":[164],"execute":[168],"round,":[172],"mitigating":[173],"violation":[176,209],"critical":[179],"requests.Our":[180],"evaluation":[181],"demonstrates":[182],"that":[183],"can":[185],"capacity":[188],"by":[189,210],"up":[190],"30%":[192],"compared":[193],"advanced":[195],"under":[198,212],"various":[199],"load":[200],"conditions,":[201],"further":[203],"reduces":[204],"rate":[206],"16%-53%":[211],"heavy-load":[213],"mode.":[215]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-06T00:00:00"}