Title :
Solving task scheduling in peer-to-peer by tabu search
Author :
Li, Junqing ; Xie, Shengxian ; Sun, Tao ; Wang, Yuting ; Yang, Huaqing
Author_Institution :
Sch. of Comput., Liaocheng Univ., Liaocheng, China
Abstract :
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.
Keywords :
costing; peer-to-peer computing; scheduling; search problems; communication costs; operating sequences; peer-to-peer networking system; tabu search algorithm; task completion time minimization; task scheduling problem; Algorithm design and analysis; Benchmark testing; Job shop scheduling; Peer to peer computing; Search problems; Vectors; Completion time; Peer-to-peer; Tabu search; Task scheduling;
Conference_Titel :
Control and Decision Conference (CCDC), 2012 24th Chinese
Conference_Location :
Taiyuan
Print_ISBN :
978-1-4577-2073-4
DOI :
10.1109/CCDC.2012.6244532
