DocumentCode
2194046
Title
Tree-Based Task Scheduling Model and Dynamic Load-Balancing Algorithm for P2P Computing
Author
Lin, Weiwei ; Shen, Wuyao
Author_Institution
Coll. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China
fYear
2010
fDate
June 29 2010-July 1 2010
Firstpage
2903
Lastpage
2907
Abstract
Based on analyzing the problem of task scheduling and load balancing for parallel applications in P2P computing environment that can be broken down into independent subtasks, a tree-based task scheduling model for P2P computing is proposed. The hierarchical approach is introduced to the model so as to schedule a large number of parallel tasks and the mathematical analysis for this model shows a good performance. To solve the load imbalancing problem that parallel computing exists by the model, a dynamic load-balancing algorithm is presented. Finally, the simulation experimental results show the effectiveness of the dynamic load-balancing algorithm.
Keywords
mathematical analysis; peer-to-peer computing; resource allocation; P2P computing; dynamic load balancing algorithm; mathematical analysis; parallel computing; peer-to-peer computing; tree-based task scheduling model; Analytical models; Computational modeling; Dynamic scheduling; Heuristic algorithms; Load modeling; Processor scheduling; load balancing; peer-to-peer computing; task scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on
Conference_Location
Bradford
Print_ISBN
978-1-4244-7547-6
Type
conf
DOI
10.1109/CIT.2010.485
Filename
5578049
Link To Document