TY - GEN
T1 - Volunteer availability based fault tolerant scheduling mechanism in desktop grid computing environment
AU - Choi, Sungjin
AU - Baik, Maeng Soon
AU - Hwang, Chong Sun
AU - Gil, Joon Min
AU - Yu, Heon Chang
PY - 2004
Y1 - 2004
N2 - Fault tolerance is essential to the further development of desktop grid computing system in order to guarantee continuous and reliable execution of tasks in spite of failures. In a desktop grid computing environment, volunteers are often susceptible to volunteer autonomy failures such as volatility failure and interference failure in the middle of execution of tasks because a desktop grid computing maximally respects autonomy of volunteers. The failures result in an independent livelock problem (i.e. the delay and blocking of the entire execution of a job). Therefore, the failures should be considered in a scheduling mechanism. In this paper, in order to tolerate volunteer autonomy failures, we propose a new fault tolerant scheduling mechanism. First, we specify a volunteer autonomy failures and an independent livelock problem. Then, we propose a volunteer availability which reflects the degree of volunteer autonomy failures. Finally, we propose a fault tolerant scheduling mechanism based on volunteer availability (which is called VAFTSM).
AB - Fault tolerance is essential to the further development of desktop grid computing system in order to guarantee continuous and reliable execution of tasks in spite of failures. In a desktop grid computing environment, volunteers are often susceptible to volunteer autonomy failures such as volatility failure and interference failure in the middle of execution of tasks because a desktop grid computing maximally respects autonomy of volunteers. The failures result in an independent livelock problem (i.e. the delay and blocking of the entire execution of a job). Therefore, the failures should be considered in a scheduling mechanism. In this paper, in order to tolerate volunteer autonomy failures, we propose a new fault tolerant scheduling mechanism. First, we specify a volunteer autonomy failures and an independent livelock problem. Then, we propose a volunteer availability which reflects the degree of volunteer autonomy failures. Finally, we propose a fault tolerant scheduling mechanism based on volunteer availability (which is called VAFTSM).
UR - http://www.scopus.com/inward/record.url?scp=18844392854&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:18844392854
SN - 0769522424
SN - 9780769522425
T3 - Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004
SP - 366
EP - 371
BT - Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004
T2 - Proceedings - Third IEEE International Symposium on Network Computing and Applications, NCA 2004
Y2 - 30 August 2004 through 1 September 2004
ER -