Abstract
In this paper, we discuss the design of result verification systems to support deadline tasks in desktop grid systems. Both correctness and performance are considered important issues in the design of such systems. To guarantee the correctness of results, voting-based and trust-based sabotage-tolerance mechanisms are generally used. However, these mechanisms suffer from two potential shortcomings: waste of resources due to running redundant replications of the task, and increased turnaround times due to the inability to deal with dynamic environments. In this paper, we propose a priority-based list scheduling (PLiS) system for sabotage-tolerance with deadline tasks. It is based on the classification of volunteers according to their credibility and result return probability. Using these two parameters, our desktop grid system can provide both correct results and shorter turnaround times. In addition, simulation results show that compared to existing result verification mechanisms, the PLiS can reduce resource waste in result verification without increasing turnaround times.
| Original language | English |
|---|---|
| Pages (from-to) | 121-131 |
| Number of pages | 11 |
| Journal | Computer Systems Science and Engineering |
| Volume | 23 |
| Issue number | 2 |
| Publication status | Published - 2008 Mar 1 |
Fingerprint
Keywords
- Desktop grid computing
- List scheduling
- Result verification
- Sabotage tolerance
ASJC Scopus subject areas
- Hardware and Architecture
- Theoretical Computer Science
- Computational Theory and Mathematics
Cite this
Priority based list scheduling for sabotage-tolerance with deadline tasks in desktop grids. / Kim, Hong Soo; Hwang, Chong Sun; Lee, Sang-Geun; Choi, Sung Jin; Gil, Joon Min.
In: Computer Systems Science and Engineering, Vol. 23, No. 2, 01.03.2008, p. 121-131.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Priority based list scheduling for sabotage-tolerance with deadline tasks in desktop grids
AU - Kim, Hong Soo
AU - Hwang, Chong Sun
AU - Lee, Sang-Geun
AU - Choi, Sung Jin
AU - Gil, Joon Min
PY - 2008/3/1
Y1 - 2008/3/1
N2 - In this paper, we discuss the design of result verification systems to support deadline tasks in desktop grid systems. Both correctness and performance are considered important issues in the design of such systems. To guarantee the correctness of results, voting-based and trust-based sabotage-tolerance mechanisms are generally used. However, these mechanisms suffer from two potential shortcomings: waste of resources due to running redundant replications of the task, and increased turnaround times due to the inability to deal with dynamic environments. In this paper, we propose a priority-based list scheduling (PLiS) system for sabotage-tolerance with deadline tasks. It is based on the classification of volunteers according to their credibility and result return probability. Using these two parameters, our desktop grid system can provide both correct results and shorter turnaround times. In addition, simulation results show that compared to existing result verification mechanisms, the PLiS can reduce resource waste in result verification without increasing turnaround times.
AB - In this paper, we discuss the design of result verification systems to support deadline tasks in desktop grid systems. Both correctness and performance are considered important issues in the design of such systems. To guarantee the correctness of results, voting-based and trust-based sabotage-tolerance mechanisms are generally used. However, these mechanisms suffer from two potential shortcomings: waste of resources due to running redundant replications of the task, and increased turnaround times due to the inability to deal with dynamic environments. In this paper, we propose a priority-based list scheduling (PLiS) system for sabotage-tolerance with deadline tasks. It is based on the classification of volunteers according to their credibility and result return probability. Using these two parameters, our desktop grid system can provide both correct results and shorter turnaround times. In addition, simulation results show that compared to existing result verification mechanisms, the PLiS can reduce resource waste in result verification without increasing turnaround times.
KW - Desktop grid computing
KW - List scheduling
KW - Result verification
KW - Sabotage tolerance
UR - http://www.scopus.com/inward/record.url?scp=45449109183&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=45449109183&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:45449109183
VL - 23
SP - 121
EP - 131
JO - Computer Systems Science and Engineering
JF - Computer Systems Science and Engineering
SN - 0267-6192
IS - 2
ER -