Solving task scheduling in peer-to-peer by tabu search

摘要：

In this study, we propose a tabu search algorithm for solving the task scheduling problem in peer-to-peer networking system. The communication costs for given tasks are considered in the proposed algorithm. The operating sequences among tasks are also discussed, which make the problem more realistic. The objective is to minimize the completion time of all tasks. Experimental results on several random generated cases verified the efficiency and effectiveness of the proposed algorithm.

关键词： Tabu search Peer-to-peer Task scheduling Completion time.

作者: Junqing Li Shengxian Xie Tao Sun Yuting Wang Huaqing Yang

作者单位: School of Computer, LiaochengUniversity, Liaocheng, Shandong, 252059, China School of Computer, LiaochengUniversity, Liaocheng, Shandong, 252059, China.

会议类型: 国际会议

会议名称: The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)

会议地点: 太原

会议语种:英文

页码: 3360-3364

在线出版日期: 2012-05-23（万方平台首次上网日期，不代表论文的发表时间）