Journal of South China University of Technology (Natural Science Edition) ›› 2010, Vol. 38 ›› Issue (6): 84-88.doi: 10.3969/j.issn.1000-565X.2010.06.016

• Computer Science & Technology • Previous Articles     Next Articles

Reliable P2P Computing Model Based on Probabilistic Redundant Scheduling

Lin Wei-wei  Qi De-yu   

  1. School of Computer Science and Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China
  • Received:2010-02-04 Revised:2010-04-17 Online:2010-06-25 Published:2010-06-25
  • Contact: 林伟伟（1980-），男，讲师，博士，主要从事分布式系统、计算机体系结构等研究． E-mail:linww@scut．edu．cn
  • About author:林伟伟（1980-），男，讲师，博士，主要从事分布式系统、计算机体系结构等研究．
  • Supported by:

    广东省中国科学院全面战略合作项目（x2jsF7091990）; 华南理工大学中央高校基本科研业务费专项资金资助项目（2009ZM0103）

PDF

970

Abstract:

In order to implement reliable peer-to-peer（P2P） computation in dynamic and unstable environments,a reliable P2P computing model based on the probabilistic redundant scheduling is established.In this model,the relationship among the success rate of P2P scheduling,the resource stability and the resource redundancy is used to obtain an optimal redundancy of task scheduling,improve the scheduling performance,and guarantee the reliability of P2P scheduling by probability.Moreover,a reliable probabilistic redundancy-based algorithm for task scheduling is designed,and the effectiveness of the proposed model and algorithm are validated by experiments.

Key words: probability, redundant scheduling, reliability, peer-to-peer