{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:20Z","timestamp":1750308620892,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0721899, CCF-0728782 and CNS 0721899"],"award-info":[{"award-number":["CNS-0721899, CCF-0728782 and CNS 0721899"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CNS-0721899, CCF-0728782 and CNS 0721899"],"award-info":[{"award-number":["CNS-0721899, CCF-0728782 and CNS 0721899"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>\n            In this article, the online pull-based broadcast model is considered. In this model, there are\n            <jats:italic>n<\/jats:italic>\n            pages of data stored at a server and requests arrive for pages online. When the server\n            <jats:italic>broadcasts<\/jats:italic>\n            page\n            <jats:italic>p<\/jats:italic>\n            , all outstanding requests for the same page\n            <jats:italic>p<\/jats:italic>\n            are simultaneously satisfied. We consider the problem of minimizing average (total) flow time online where all pages are unit-sized. For this problem, there has been a decade-long search for an online algorithm which is scalable, that is, (1 + \u03f5)-speed\n            <jats:italic>O<\/jats:italic>\n            (1)-competitive for any fixed \u03f5 &gt; 0. In this article, we give the\n            <jats:italic>first<\/jats:italic>\n            analysis of an online scalable algorithm.\n          <\/jats:p>","DOI":"10.1145\/2344422.2344429","type":"journal-article","created":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T13:50:00Z","timestamp":1349185800000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["An online scalable algorithm for average flow time in broadcast scheduling"],"prefix":"10.1145","volume":"8","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Acharya S. Franklin M. and Zdonik S. 1995. Dissemination-based data delivery using broadcast disks. Personal Communications IEEE {see also IEEE Wireless Communications} 2 6 (Dec) 50--60.  Acharya S. Franklin M. and Zdonik S. 1995. Dissemination-based data delivery using broadcast disks. Personal Communications IEEE {see also IEEE Wireless Communications} 2 6 (Dec) 50--60.","DOI":"10.1109\/98.475988"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.811450"},{"volume-title":"SODA '05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 215--221","author":"Bansal N.","key":"e_1_2_1_3_1","unstructured":"Bansal , N. , Charikar , M. , Khanna , S. , and Naor , J. S . 2005. Approximating the average response time in broadcast scheduling . In SODA '05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 215--221 . Bansal, N., Charikar, M., Khanna, S., and Naor, J. S. 2005. Approximating the average response time in broadcast scheduling. In SODA '05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. 215--221."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/060674417"},{"key":"e_1_2_1_5_1","volume-title":"Tech. Rep. CMU-CS-09-174","author":"Bansal N.","year":"2009","unstructured":"Bansal , N. , Krishnaswamy , R. , and Nagarajan , V . 2009 . Better scalable algorithms for broadcast scheduling. Tech. Rep. CMU-CS-09-174 , Carnegie Mellon University , Pittsburgh, PA . Bansal, N., Krishnaswamy, R., and Nagarajan, V. 2009. Better scalable algorithms for broadcast scheduling. Tech. Rep. CMU-CS-09-174, Carnegie Mellon University, Pittsburgh, PA."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.27.3.518.314"},{"volume-title":"SODA '00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 558--559","author":"Bartal Y.","key":"e_1_2_1_7_1","unstructured":"Bartal , Y. and Muthukrishnan , S . 2000. Minimizing maximum response time in scheduling broadcasts . In SODA '00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 558--559 . Bartal, Y. and Muthukrishnan, S. 2000. Minimizing maximum response time in scheduling broadcasts. In SODA '00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. 558--559."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.12.001"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Chan W.-T. Lam T. W. Ting H.-F. and \n      Wong P. W. H\n  . \n  2004\n  . New results on on-demand broadcasting with deadline via job scheduling with cancellation. \n  In COCOON Lecture Notes in Computer Science vol. \n  3106\n  . 210--218.  Chan W.-T. Lam T. W. Ting H.-F. and Wong P. W. H. 2004. New results on on-demand broadcasting with deadline via job scheduling with cancellation. In COCOON Lecture Notes in Computer Science vol. 3106. 210--218.","DOI":"10.1007\/978-3-540-27798-9_24"},{"volume-title":"SODA '08: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 473--482","author":"Chang J.","key":"e_1_2_1_10_1","unstructured":"Chang , J. , Erlebach , T. , Gailis , R. , and Khuller , S . 2008. Broadcast scheduling: algorithms and complexity . In SODA '08: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 473--482 . Chang, J., Erlebach, T., Gailis, R., and Khuller, S. 2008. Broadcast scheduling: algorithms and complexity. In SODA '08: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 473--482."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109594"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12450-1_6"},{"volume-title":"ESA '09: Proceedings of the 17th Annual European Symposium on Algorithms. 444--455","author":"Chekuri C.","key":"e_1_2_1_13_1","unstructured":"Chekuri , C. , Im , S. , and Moseley , B . 2009b. Minimizing maximum response time and delay factor in broadcasting scheduling . In ESA '09: Proceedings of the 17th Annual European Symposium on Algorithms. 444--455 . Chekuri, C., Im, S., and Moseley, B. 2009b. Minimizing maximum response time and delay factor in broadcasting scheduling. In ESA '09: Proceedings of the 17th Annual European Symposium on Algorithms. 444--455."},{"volume-title":"SODA '09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics","author":"Chekuri C.","key":"e_1_2_1_14_1","unstructured":"Chekuri , C. and Moseley , B . 2009. Online scheduling to minimize the maximum delay factor . In SODA '09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics , Philadelphia, PA, 1116--1125. Chekuri, C. and Moseley, B. 2009. Online scheduling to minimize the maximum delay factor. In SODA '09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1116--1125."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-5595-4"},{"key":"e_1_2_1_16_1","first-page":"227","article-title":"Optimal control of bulk queues with compound poisson arrivals and batch service","volume":"21","author":"Deb R. K.","year":"1984","unstructured":"Deb , R. K. 1984 . Optimal control of bulk queues with compound poisson arrivals and batch service . Opsearch. 21 , 227 -- 245 . Deb, R. K. 1984. Optimal control of bulk queues with compound poisson arrivals and batch service. Opsearch. 21, 227--245.","journal-title":"Opsearch."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426040"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00186-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1018-5"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077467"},{"volume-title":"SODA '09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics","author":"Edmonds J.","key":"e_1_2_1_21_1","unstructured":"Edmonds , J. and Pruhs , K . 2009. Scalably scheduling processes with arbitrary speedup curves . In SODA '09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics , Philadelphia, PA, 685--692. Edmonds, J. and Pruhs, K. 2009. Scalably scheduling processes with arbitrary speedup curves. In SODA '09: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 685--692."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000019682.75022.96"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1058-x"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147954.1147956"},{"volume-title":"Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA 03)","author":"Hall A.","key":"e_1_2_1_25_1","unstructured":"Hall , A. and T\u00e4ubig , H. 2003. Comparing push- and pull-based broadcasting. or: Would \u201cMicrosoft watches\u201d profit from a transmitter&quest; . In Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA 03) . 148--164. Hall, A. and T\u00e4ubig, H. 2003. Comparing push- and pull-based broadcasting. or: Would \u201cMicrosoft watches\u201d profit from a transmitter&quest;. In Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms (WEA 03). 148--164."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/jos.87"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.02.047"},{"key":"e_1_2_1_29_1","first-page":"305","article-title":"Optimal control of batch service queues with nonlinear waiting costs","volume":"10","author":"Weiss J.","year":"1979","unstructured":"Weiss , J. 1979 . Optimal control of batch service queues with nonlinear waiting costs . Modeling and Simulation 10 , 305 -- 309 . Weiss, J. 1979. Optimal control of batch service queues with nonlinear waiting costs. Modeling and Simulation 10, 305--309.","journal-title":"Modeling and Simulation"},{"key":"e_1_2_1_30_1","first-page":"12","article-title":"Optimal policies for batch service queueing systems","volume":"19","author":"Weiss J.","year":"1982","unstructured":"Weiss , J. and Pliska , S. 1982 . Optimal policies for batch service queueing systems . Opsearch 19 , 1, 12 -- 22 . Weiss, J. and Pliska, S. 1982. Optimal policies for batch service queueing systems. Opsearch 19, 1, 12--22.","journal-title":"Opsearch"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.16350"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11809678_34"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2344422.2344429","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2344422.2344429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:39Z","timestamp":1750273659000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2344422.2344429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1145\/2344422.2344429"],"URL":"https:\/\/doi.org\/10.1145\/2344422.2344429","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2012,9]]},"assertion":[{"value":"2009-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}