@article{westbrook_load_2000,
	title = {Load {Balancing} for {Response} {Time}},
	volume = {35},
	issn = {0196-6774},
	url = {http://www.sciencedirect.com/science/article/B6WH3-45FC2TW-14/2/988241207b1647a825bb3ae3b0306b71},
	doi = {10.1006/jagm.2000.1074},
	abstract = {A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the tasks assigned to it. The goal is to minimize the maximum response time of any server. Previous papers on on-line load balancing have generally concentrated only on keeping the current maximum load bounded by some function of the maximum off-line load ever seen. Our goal is to keep the current maximum load on an on-line server bounded by a function of the current off-line load. Thus the loads are not permanently skewed by transient peaks, and the algorithm takes advantage of reductions in total weight. To achieve this, the scheduler must occasionally reassign tasks, in an attempt to decrease the maximum load. We study several variants of load balancing, including identical machines, related machines, and virtual circuit routing. In each case, only a limited amount of reassignment is used but the load is kept substantially lower than possible without reassignment.},
	number = {1},
	urldate = {2010-05-07TZ},
	journal = {Journal of Algorithms},
	author = {Westbrook, Jeffery},
	month = apr,
	year = {2000},
	pages = {1--16}
}

{"_id":"rJaBeoGG4ujesWuSF","bibbaseid":"westbrook-loadbalancingforresponsetime-2000","downloads":0,"creationDate":"2016-12-19T20:50:58.621Z","title":"Load Balancing for Response Time","author_short":["Westbrook, J."],"year":2000,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"Load Balancing for Response Time","volume":"35","issn":"0196-6774","url":"http://www.sciencedirect.com/science/article/B6WH3-45FC2TW-14/2/988241207b1647a825bb3ae3b0306b71","doi":"10.1006/jagm.2000.1074","abstract":"A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the tasks assigned to it. The goal is to minimize the maximum response time of any server. Previous papers on on-line load balancing have generally concentrated only on keeping the current maximum load bounded by some function of the maximum off-line load ever seen. Our goal is to keep the current maximum load on an on-line server bounded by a function of the current off-line load. Thus the loads are not permanently skewed by transient peaks, and the algorithm takes advantage of reductions in total weight. To achieve this, the scheduler must occasionally reassign tasks, in an attempt to decrease the maximum load. We study several variants of load balancing, including identical machines, related machines, and virtual circuit routing. In each case, only a limited amount of reassignment is used but the load is kept substantially lower than possible without reassignment.","number":"1","urldate":"2010-05-07TZ","journal":"Journal of Algorithms","author":[{"propositions":[],"lastnames":["Westbrook"],"firstnames":["Jeffery"],"suffixes":[]}],"month":"April","year":"2000","pages":"1--16","bibtex":"@article{westbrook_load_2000,\n\ttitle = {Load {Balancing} for {Response} {Time}},\n\tvolume = {35},\n\tissn = {0196-6774},\n\turl = {http://www.sciencedirect.com/science/article/B6WH3-45FC2TW-14/2/988241207b1647a825bb3ae3b0306b71},\n\tdoi = {10.1006/jagm.2000.1074},\n\tabstract = {A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the tasks assigned to it. The goal is to minimize the maximum response time of any server. Previous papers on on-line load balancing have generally concentrated only on keeping the current maximum load bounded by some function of the maximum off-line load ever seen. Our goal is to keep the current maximum load on an on-line server bounded by a function of the current off-line load. Thus the loads are not permanently skewed by transient peaks, and the algorithm takes advantage of reductions in total weight. To achieve this, the scheduler must occasionally reassign tasks, in an attempt to decrease the maximum load. We study several variants of load balancing, including identical machines, related machines, and virtual circuit routing. In each case, only a limited amount of reassignment is used but the load is kept substantially lower than possible without reassignment.},\n\tnumber = {1},\n\turldate = {2010-05-07TZ},\n\tjournal = {Journal of Algorithms},\n\tauthor = {Westbrook, Jeffery},\n\tmonth = apr,\n\tyear = {2000},\n\tpages = {1--16}\n}\n\n","author_short":["Westbrook, J."],"key":"westbrook_load_2000","id":"westbrook_load_2000","bibbaseid":"westbrook-loadbalancingforresponsetime-2000","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/B6WH3-45FC2TW-14/2/988241207b1647a825bb3ae3b0306b71"},"downloads":0,"html":""},"search_terms":["load","balancing","response","time","westbrook"],"keywords":[],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}