Agent-based autonomous result verification mechanism in desktop grid systems
- Authors
- YU, Heonchang; Jung, Soon Young
- Issue Date
- 1월-2010
- Publisher
- Springer Verlag
- Keywords
- Desktop Grid; Agent
- Citation
- LECTURE NOTES IN COMPUTER SCIENCE (INCLUDING SUBSERIES LECTURE NOTES IN ARTIFICIAL INTELLIGENCE AND LECTURE NOTES IN BIOINFORMATICS), v.5319 LNAI, no.0, pp.72 - 84
- Indexed
- SCIE
SCOPUS
- Journal Title
- LECTURE NOTES IN COMPUTER SCIENCE (INCLUDING SUBSERIES LECTURE NOTES IN ARTIFICIAL INTELLIGENCE AND LECTURE NOTES IN BIOINFORMATICS)
- Volume
- 5319 LNAI
- Number
- 0
- Start Page
- 72
- End Page
- 84
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/104549
- ISSN
- 03029743
- Abstract
- In this paper we discuss the design of result verification in desktop grid systems. In this design, correctness and performance are considered as important issues. To guarantee the correctness of work results, sabotage-tolerant mechanisms have been mainly used, such as voting-based schemes and trust-based schemes. However, these mechanisms result in low scalability and high computation delay because they can not cope effectively with dynamic environments. In this paper, we propose a Sabotage-Tolerant Scheduling for Result Verification (STSRV), which is based on mobile agent technology. In STSRV, mobile agents are used to check periodically the credibility and availability of each volunteer. Using credibility and availability information, our desktop grid system can provide correctness of work results without a huge increase in the computation delay caused by result verification. Additionally, simulation results show that STSRV increases turnaround time for works from the viewpoint of credibility and availability, and thus enhances the overall performance of our desktop grid systems. ? 2010 Springer-Verlag Berlin Heidelberg.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.