{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:25:25Z","timestamp":1774599925507,"version":"3.50.1"},"reference-count":9,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:00Z","timestamp":1725494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2024,9,5]]},"abstract":"<jats:p>Service level objectives (SLOs) for queueing systems typically relate to the tail of the system's response time distribution T. The tail is the function mapping a time t to the probability P[T &gt; t]. SLOs typically ask that high percentiles of T are not too large, i.e. that P[T &gt; t] is small for large t.<\/jats:p>","DOI":"10.1145\/3695411.3695418","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:20:33Z","timestamp":1725661233000},"page":"15-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Gittins Policy for Optimizing Tail Latency"],"prefix":"10.1145","volume":"52","author":[{"given":"Amit","family":"Harlev","sequence":"first","affiliation":[{"name":"Cornell University"}]},{"given":"George","family":"Yu","sequence":"additional","affiliation":[{"name":"Cornell University"}]},{"given":"Ziv","family":"Scully","sequence":"additional","affiliation":[{"name":"Cornell University"}]}],"member":"320","published-online":{"date-parts":[[2024,9,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1243401.1243406"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Nils Charlet and Benny Van Houdt. 2024. Tail Optimality and Performance Analysis of the Nudge-M Scheduling Algorithm. arXiv:2403.06588 [cs math]","DOI":"10.1145\/3695411.3695420"},{"key":"e_1_2_1_3_1","volume-title":"Weber","author":"Gittins John C.","year":"2011","unstructured":"John C. Gittins, Kevin D. Glazebrook, and Richard R. Weber. 2011. Multi-Armed Bandit Allocation Indices (2 ed.). Wiley, Chichester, UK."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410220.3460102"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/998926985"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3570610"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005588"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1086"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3652963.3655084"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695411.3695418","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3695411.3695418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:11Z","timestamp":1750294691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3695411.3695418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,5]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,9,5]]}},"alternative-id":["10.1145\/3695411.3695418"],"URL":"https:\/\/doi.org\/10.1145\/3695411.3695418","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2024,9,5]]},"assertion":[{"value":"2024-09-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}