Nowadays, due to the advantage of technology and the Internet popularization, Peer-to-Peer (P2P) computing technology has been gradually becoming the mainstream on the distributed system applications. However, the main purpose of P2P computing technology is to process the large-scale task through the distributed system computer cooperatively. Therefore, how to efficiently assign tasks to every nodes and how to make tasks to achieve the load balance on each node of the system are a worthy discussion issue. In this research paper, we proposed the Load Balance Min-Min (LBMM) schedule algorithm to process the task assignment in the three tiers of P2P network topology architecture. Through setting up the threshold value, every task which needs to be executed can be quickly assigned on the suitable nodes. In this method, it can not only improve the task loading on each node but also choose the most suitable node by the task characteristic in order to provide the Quality Assurance (QA) on the three tiers of P2P network topology of the load balance and the performance efficacy.
[1]
Matei Ripeanu,et al.
Peer-to-peer architecture case study: Gnutella network
,
2001,
Proceedings First International Conference on Peer-to-Peer Computing.
[2]
Srinivasan Seshan,et al.
A case for end system multicast
,
2002,
IEEE J. Sel. Areas Commun..
[3]
Shu-Chin Wang,et al.
A hybrid load balancing policy underlying grid computing environment
,
2007,
Comput. Stand. Interfaces.
[4]
Hyunsoo Yoon,et al.
Grapes: topology-based hierarchical virtual network for peer-to-peer lookup services
,
2002,
Proceedings. International Conference on Parallel Processing Workshop.