On-Line Load Balancing with Task Buffer

Authors

  • Jiayin Wei College of Computer Science and Technology, Guizhou University
  • Daoyun Xu College of Computer Science and Technology, Guizhou University
  • Yongbin Qin College of Computer Science and Technology, Guizhou University
  • Ruizhang Huang College of Computer Science and Technology, Guizhou University

Keywords:

On-line schedule, load balancing, task buffer, planarization processing

Abstract

On-line load balancing is one of the most important problems for applications with resource allocation. It aims to assign tasks to suitable machines and balance the load among all of the machines, where the tasks need to be assigned to a machine upon arrival. In practice, tasks are not always required to be assigned to machines immediately. In this paper, we propose a novel on-line load balancing model with task buffer, where the buffer can temporarily store tasks as many as possible. Three algorithms, namely LPTCP1_α, LPTCP2_α, and LPTCP3_β, are proposed based on the Longest Processing Time (LPT) algorithm and a variety of planarization algorithms. The planarization algorithms are proposed for reducing the difference among each element in a set. Experimental results show that our proposed algorithms can effectively solve the on-line load balancing problem and have good performance in large scale experiments.

Downloads

Download data is not yet available.

Downloads

How to Cite

Wei, J., Xu, D., Qin, Y., & Huang, R. (2017). On-Line Load Balancing with Task Buffer. COMPUTING AND INFORMATICS, 36(5), 1207–1234. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/2017_5_1207