Group-Based scheduling scheme for result checking in global computing systems

Authors:
HongSoo Kim;SungJin Choi;MaengSoon Baik;KwonWoo Yang;HeonChang Yu;Chong-Sun Hwang
Affiliations:
Dept. of Computer Science & Engineering, Korea University, Seoul, Rep. Korea;Dept. of Computer Science & Engineering, Korea University, Seoul, Rep. Korea;Dept. of Computer Science & Engineering, Korea University, Seoul, Rep. Korea;Gongju National University of Education, GongJu city, Rep. Korea;Dept. of Computer Education, Korea University, Seoul, Rep. Korea;Dept. of Computer Science & Engineering, Korea University, Seoul, Rep. Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 6
Cited 0

Cilk: an efficient multithreaded runtime system

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Sabotage-tolerance mechanisms for volunteer computing systems

Future Generation Computer Systems - Best papers from symp. on cluster computing and the grid (CCGRID 2001)
Advanced eager scheduling for Java-based adaptively parallel computing

JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Global Computing Systems

LSSC '01 Proceedings of the Third International Conference on Large-Scale Scientific Computing-Revised Papers
Javelin 2.0: Java-Based Parallel Computing on the Internet

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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.