By Topic

Tree-Based Task Scheduling Model and Dynamic Load-Balancing Algorithm for P2P Computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weiwei Lin ; Coll. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China ; Wuyao Shen

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.

Published in:

Computer and Information Technology (CIT), 2010 IEEE 10th International Conference on

Date of Conference:

June 29 2010-July 1 2010