TY - JOUR
T1 - A dependable Peer-to-Peer computing platform
AU - Wang, Hong
AU - Takizawa, Hiroyuki
AU - Kobayashi, Hiroaki
N1 - Funding Information:
The authors would like to thank anonymous reviewers for their constructive comments. This research was partially supported by Grant-in-Aid for Scientific Research on Priority Areas of Ministry of Education, Culture, Sports, Science and Technology, Japan (MEXT Grant), No. 18049003, and Strategic Information and Communications R&D Promotion Program (SCOPE-S) No. 061102002.
PY - 2007/11
Y1 - 2007/11
N2 - This paper discusses a dependable and widely applicable Peer-to-Peer (P2P) computing platform. As the existing P2P computing platforms are limited due to the lack of support for various computational models, this paper proposes a workflow management mechanism to support task dependency in parallel programs while increasing computing efficiency. In general, task dependency leads to a serious performance degradation for failed task re-execution because of volatile peers. Therefore, it results in low dependability. Here, dependability is defined as a comparison of the actual performance with task failures to the theoretical one without failure on a P2P computing platform. Redundant task dispatch and a runtime optimization method are proposed to guarantee high dependability even with highly volatile peers. Large-scale simulation results indicate that the computing platform efficiently solves the problem of P2P computing due to volatile peers.
AB - This paper discusses a dependable and widely applicable Peer-to-Peer (P2P) computing platform. As the existing P2P computing platforms are limited due to the lack of support for various computational models, this paper proposes a workflow management mechanism to support task dependency in parallel programs while increasing computing efficiency. In general, task dependency leads to a serious performance degradation for failed task re-execution because of volatile peers. Therefore, it results in low dependability. Here, dependability is defined as a comparison of the actual performance with task failures to the theoretical one without failure on a P2P computing platform. Redundant task dispatch and a runtime optimization method are proposed to guarantee high dependability even with highly volatile peers. Large-scale simulation results indicate that the computing platform efficiently solves the problem of P2P computing due to volatile peers.
KW - Peer-to-Peer
KW - Redundant task dispatch
KW - Runtime optimization
KW - Workflow management
UR - http://www.scopus.com/inward/record.url?scp=34447342256&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34447342256&partnerID=8YFLogxK
U2 - 10.1016/j.future.2007.03.004
DO - 10.1016/j.future.2007.03.004
M3 - Article
AN - SCOPUS:34447342256
SN - 0167-739X
VL - 23
SP - 939
EP - 955
JO - Future Generation Computer Systems
JF - Future Generation Computer Systems
IS - 8
ER -