Abstract
This paper considers the problem of correctness to fault-tolerance in global computing systems. Global computing system has been shown to be exposed to intentional attacks, where authentication is not relevant, network security techniques are insufficient. To guarantee correctness for computation, fault-tolerance schemes have been used to majority voting and spot-checking but these schemes intend to high computation delay because are not applied scheduling scheme for result checking. In this paper, we propose a new technique called GBSS(Group-Based Scheduling Scheme) which guarantee correctness and reduce computation delay by using fault-tolerant scheduling scheme to the result checking. Additionally, simulation results show increased usable rate of the CPU and increased performance of the system.
Original language | English |
---|---|
Pages (from-to) | 89-98 |
Number of pages | 10 |
Journal | Lecture Notes in Computer Science |
Volume | 3482 |
Issue number | III |
DOIs | |
Publication status | Published - 2005 |
Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 2005 May 9 → 2005 May 12 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science