{"id":"https://openalex.org/W7127101090","doi":"https://doi.org/10.48550/arxiv.2601.22996","title":"Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference","display_name":"Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference","publication_year":2026,"publication_date":"2026-01-30","ids":{"openalex":"https://openalex.org/W7127101090","doi":"https://doi.org/10.48550/arxiv.2601.22996"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.22996","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124826744","display_name":"Yiding Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Feng, Yiding","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124855751","display_name":"Zonghan Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Zonghan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124808186","display_name":"Yuhao Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yuhao","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5124826744"],"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/T14347","display_name":"Big Data and Digital Economy","score":0.19550000131130219,"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/T14347","display_name":"Big Data and Digital Economy","score":0.19550000131130219,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.17759999632835388,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.125,"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/competitive-analysis","display_name":"Competitive analysis","score":0.6359000205993652},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5929999947547913},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5361999869346619},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.47290000319480896},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.4595000147819519},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4334000051021576},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.40209999680519104},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.37470000982284546}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7440000176429749},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6359000205993652},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5929999947547913},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5361999869346619},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.47290000319480896},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4555000066757202},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4334000051021576},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.40209999680519104},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.37470000982284546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37139999866485596},{"id":"https://openalex.org/C20729856","wikidata":"https://www.wikidata.org/wiki/Q2078279","display_name":"Geometric programming","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.30959999561309814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30869999527931213},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27970001101493835},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.2736000120639801},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.2565000057220459}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.22996","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.22996","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.22996","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.22996","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6407963037490845,"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":{"Large":[0],"Language":[1],"Model":[2],"(LLM)":[3],"inference":[4],"presents":[5],"a":[6,17,36,42,89,129,143,161,183],"unique":[7],"scheduling":[8,32],"challenge":[9],"due":[10],"to":[11,110,137,172],"the":[12,24,47,102,107,112,121,175,186,204,211],"Key-Value":[13],"(KV)":[14],"cache,":[15],"where":[16],"job's":[18],"memory":[19,44,139,154],"footprint":[20],"grows":[21],"linearly":[22],"with":[23,34,142],"number":[25],"of":[26,50,68,85,164,196,216],"decoded":[27],"tokens.":[28],"This":[29],"growth":[30],"couples":[31],"decisions":[33],"feasibility:":[35],"scheduler":[37],"must":[38],"minimize":[39],"latency":[40],"under":[41],"hard":[43],"budget,":[45],"yet":[46],"response":[48,69],"lengths":[49,70],"requests":[51],"are":[52],"inherently":[53],"unknown.":[54],"While":[55],"recent":[56],"works":[57],"have":[58],"explored":[59],"this":[60,98,118],"problem":[61,119],"either":[62],"assuming":[63],"clairvoyance":[64],"--":[65,71,207],"exact":[66],"knowledge":[67,84],"or":[72],"relying":[73],"on":[74,221],"machine-learned":[75],"predictions,":[76],"obtaining":[77],"robust":[78],"performance":[79],"guarantees":[80],"without":[81],"any":[82],"prior":[83],"job":[86],"sizes":[87],"remains":[88],"theoretically":[90],"fundamental":[91],"and":[92,201],"practically":[93],"important":[94],"open":[95],"problem.":[96],"In":[97],"work,":[99],"we":[100],"propose":[101],"Geometric":[103,187],"Slicing":[104],"Algorithm":[105,189],"(GSA),":[106],"non-clairvoyant":[108],"policy":[109],"achieve":[111],"first":[113],"constant":[114],"competitive":[115,162],"ratio":[116,163,195],"for":[117,168,198],"in":[120,174,203],"offline":[122],"batch":[123],"setting.":[124],"GSA":[125,159],"manages":[126],"uncertainty":[127],"through":[128],"geometric":[130],"phase":[131],"structure":[132],"that":[133,147,158,226],"periodically":[134],"restarts":[135],"jobs":[136],"bound":[138,215],"exposure,":[140],"combined":[141],"staggered":[144],"pipeline":[145],"mechanism":[146],"enables":[148],"high":[149],"concurrency":[150],"by":[151],"smoothing":[152],"aggregate":[153],"consumption.":[155],"We":[156],"prove":[157],"achieves":[160,192],"at":[165],"most":[166],"61.92":[167],"general":[169,199],"instances,":[170],"improving":[171,209],"32":[173],"large-memory":[176,205],"regime.":[177],"Our":[178],"algorithmic":[179],"framework":[180],"also":[181],"yields":[182],"clairvoyant":[184],"counterpart,":[185],"Batching":[188],"(GBA),":[190],"which":[191],"an":[193],"approximation":[194],"10.67":[197],"instances":[200],"6.75":[202],"regime":[206],"significantly":[208],"upon":[210],"best":[212],"previously":[213],"known":[214],"over":[217],"9000.":[218],"Numerical":[219],"experiments":[220],"real":[222],"request":[223],"traces":[224],"demonstrate":[225],"our":[227],"algorithms":[228],"perform":[229],"robustly":[230],"while":[231],"preserving":[232],"these":[233],"worst-case":[234],"guarantees.":[235]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-03T00:00:00"}