{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T11:14:08Z","timestamp":1790162048328,"version":"4.1.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2007,3,1]],"date-time":"2007-03-01T00:00:00Z","timestamp":1172707200000},"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":[[2007,3]]},"abstract":"<jats:p>This paper gives an overview of recent research on the impact of scheduling on the tail behavior of the response time of a job. We cover preemptive and non-preemptive scheduling disciplines, consider light-tailed and heavy-tailed distributions, and discuss optimality properties. The focus is on results, intuition and insight rather than methods and techniques.<\/jats:p>","DOI":"10.1145\/1243401.1243406","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:16Z","timestamp":1181140636000},"page":"13-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Tails in scheduling"],"prefix":"10.1145","volume":"34","author":[{"given":"Onno","family":"Boxma","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology, MB Eindhoven, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bert","family":"Zwart","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01158960"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01225324"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019115910569"},{"key":"e_1_2_1_4_1","volume-title":"Applied Probability and Queues","author":"Asmussen S.","year":"2003","unstructured":"Asmussen , S. ( 2003 ). Applied Probability and Queues . Springer-Verlag , New York . Asmussen, S. (2003). Applied Probability and Queues. Springer-Verlag, New York."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/105051604000000044"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2004.01.005"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1115046"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00006-3"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(03)00071-3"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-7585-9"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017913826973"},{"key":"e_1_2_1_12_1","volume-title":"Paper in preparation","author":"Boxma O. J.","year":"2007","unstructured":"Boxma , O. J. , Denisov , D. , Resnick , S. I. ( 2007 ). Paper in preparation . Boxma, O. J., Denisov, D., Resnick, S. I. (2007). Paper in preparation."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:QUES.0000021141.02821.6d"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00679132"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212351"},{"key":"e_1_2_1_16_1","volume-title":"Amsterdam","author":"Cohen J. W.","year":"1982","unstructured":"Cohen , J. W. ( 1982 ). The Single Server Queue. North-Holland Publ. Cy ., Amsterdam ; revised edition. Cohen, J. W. (1982). The Single Server Queue. North-Holland Publ. Cy., Amsterdam; revised edition."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/233013.233038"},{"key":"e_1_2_1_18_1","volume-title":"Asymptotics for first passage times of L\u00e9vy processes and random walks. Eurandom research report 2006--017","author":"Denisov D.","year":"2006","unstructured":"Denisov , D. , Shneer , V. ( 2006 ). Asymptotics for first passage times of L\u00e9vy processes and random walks. Eurandom research report 2006--017 . Denisov, D., Shneer, V. (2006). Asymptotics for first passage times of L\u00e9vy processes and random walks. Eurandom research report 2006--017."},{"key":"e_1_2_1_19_1","volume-title":"Sojourn time asymptotics in processor sharing queues with varying service rate. Submitted for publication","author":"Egorova R.","year":"2006","unstructured":"Egorova , R. , Mandjes , M. , Zwart , B. ( 2006 ). Sojourn time asymptotics in processor sharing queues with varying service rate. Submitted for publication . Egorova, R., Mandjes, M., Zwart, B. (2006). Sojourn time asymptotics in processor sharing queues with varying service rate. Submitted for publication."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-9007-4"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964806060268"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-33483-2","volume-title":"Modeling Extremal Events","author":"Embrechts P.","year":"1997","unstructured":"Embrechts , P. , Kl\u00fcppelberg , C. , Mikosch , T. ( 1997 ). Modeling Extremal Events . Springer , New York . Embrechts, P., Kl\u00fcppelberg, C., Mikosch, T. (1997). Modeling Extremal Events. Springer, New York."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1034625337"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-3613-z"},{"key":"e_1_2_1_25_1","volume-title":"The principle of a single big jump: discrete and continuous time modulated random walks with heavy-tailed increments. J. Theor. Prob., to appear","author":"Foss S.","year":"2007","unstructured":"Foss , S. , Konstantopoulos , T. , Zachary , S. ( 2007 ). The principle of a single big jump: discrete and continuous time modulated random walks with heavy-tailed increments. J. Theor. Prob., to appear . Foss, S., Konstantopoulos, T., Zachary, S. (2007). The principle of a single big jump: discrete and continuous time modulated random walks with heavy-tailed increments. J. Theor. Prob., to appear."},{"key":"e_1_2_1_26_1","volume-title":"Big Queues","author":"Ganesh A.","year":"2003","unstructured":"Ganesh , A. , O'Connell , N. , Wischik , D. ( 2003 ). Big Queues . Springer , New York . Ganesh, A., O'Connell, N., Wischik, D. (2003). Big Queues. Springer, New York."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1086957584"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/258612.258670"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177692642"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1030.0082"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.587.16396"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800110105"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-4149(97)00060-4"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212973"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964805050205"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-5567-6"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752159"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020905810996"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0504"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-8767-1"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2004.11.010"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212870"},{"key":"e_1_2_1_43_1","first-page":"92","article-title":"On busy period asymptotics in the GI\/G\/1 queue","volume":"83","author":"Palmowksi Z.","year":"2006","unstructured":"Palmowksi , Z. , Rolski , T. ( 2006 ). On busy period asymptotics in the GI\/G\/1 queue . Adv. Appl. Prob. 83 , 92 -- 103 . Palmowksi, Z., Rolski, T. (2006). On busy period asymptotics in the GI\/G\/1 queue. Adv. Appl. Prob. 83, 92--103.","journal-title":"Adv. Appl. Prob."},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","DOI":"10.1002\/047120644X","volume-title":"Self-Similar Network Traffic and Performance Evaluation","author":"Park K.","year":"2000","unstructured":"Park , K. , Willinger , W. (eds.) ( 2000 ). Self-Similar Network Traffic and Performance Evaluation . Wiley , New York . Park, K., Willinger, W. (eds.) (2000). Self-Similar Network Traffic and Performance Evaluation. Wiley, New York."},{"key":"e_1_2_1_45_1","volume-title":"Proc. Performance '90","author":"Sadowsky J. S.","year":"1990","unstructured":"Sadowsky , J. S. , Szpankowski , W. ( 1990 ). On the analysis of the tail queue length and waiting time distributions of a GI\/G\/c queue . In: Proc. Performance '90 , 93--107. Sadowsky, J. S., Szpankowski, W. (1990). On the analysis of the tail queue length and waiting time distributions of a GI\/G\/c queue. In: Proc. Performance '90, 93--107."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-0068-1"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/998926986"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(77)90047-3"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.554723"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064236"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01182931"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:QUES.0000021155.44510.9f"},{"key":"e_1_2_1_53_1","volume-title":"Proc. ITC-16","author":"Zwart A. P.","year":"1999","unstructured":"Zwart , A. P. ( 1999 ). Sojourn times in a multiclass processor sharing queue . In: Proc. ITC-16 , Edinburgh, UK, eds. P. Key, D. Smith (North-Holland, Amsterdam), 335--344. Zwart, A. P. (1999). Sojourn times in a multiclass processor sharing queue. In: Proc. ITC-16, Edinburgh, UK, eds. P. Key, D. Smith (North-Holland, Amsterdam), 335--344."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.3.485.10584"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019142010994"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1243401.1243406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1243401.1243406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:48Z","timestamp":1750258068000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1243401.1243406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,3]]}},"alternative-id":["10.1145\/1243401.1243406"],"URL":"https:\/\/doi.org\/10.1145\/1243401.1243406","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2007,3]]},"assertion":[{"value":"2007-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}