{"issue":"4","publisher":"Elsevier","oa_version":"None","volume":111,"page":"178-183","publication":"Information Processing Letters","language":[{"iso":"eng"}],"_id":"11760","day":"15","author":[{"full_name":"Dütting, Paul","first_name":"Paul","last_name":"Dütting"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Weber","first_name":"Ingmar","full_name":"Weber, Ingmar"}],"citation":{"mla":"Dütting, Paul, et al. “Offline File Assignments for Online Load Balancing.” Information Processing Letters, vol. 111, no. 4, Elsevier, 2011, pp. 178–83, doi:10.1016/j.ipl.2010.11.022.","ama":"Dütting P, Henzinger MH, Weber I. Offline file assignments for online load balancing. Information Processing Letters. 2011;111(4):178-183. doi:10.1016/j.ipl.2010.11.022","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” Information Processing Letters, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.","apa":"Dütting, P., Henzinger, M. H., & Weber, I. (2011). Offline file assignments for online load balancing. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2010.11.022","ista":"Dütting P, Henzinger MH, Weber I. 2011. Offline file assignments for online load balancing. Information Processing Letters. 111(4), 178–183.","short":"P. Dütting, M.H. Henzinger, I. Weber, Information Processing Letters 111 (2011) 178–183.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Offline File Assignments for Online Load Balancing.” Information Processing Letters. Elsevier, 2011. https://doi.org/10.1016/j.ipl.2010.11.022."},"date_published":"2011-01-15T00:00:00Z","publication_identifier":{"issn":["0020-0190"]},"scopus_import":"1","title":"Offline file assignments for online load balancing","extern":"1","article_type":"original","year":"2011","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased\r\nby this. We present simple deterministic algorithms for this problem and exhibit an interesting trade-off between the available space to make file copies and the obtainable makespan. We also give non-trivial lower bounds for a large class of deterministic algorithms and present a randomized algorithm that beats these bounds with high probability."}],"doi":"10.1016/j.ipl.2010.11.022","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-09-12T09:38:05Z","date_created":"2022-08-08T11:33:03Z","type":"journal_article","quality_controlled":"1","intvolume":" 111","status":"public","publication_status":"published","month":"01"}