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.
This work was supported by grant No. G- 04-GS-01-03R-7 from the Korea Institute of Science and Technology Information.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Neary, M.O., Cappello, P.: Advanced Eager Scheduling for Java Based Adaptively Parallel Computing. In: JGI 2002, November 3-5 (2002)
Molnar, D.: The SETI@home Problem
Sarmenta, L.: Sabotage-Tolerance Mechanism for Volunteer Computing Systems. FGCS 18(4) (2002)
Germain, C., Playez, N.: Result Checking in Global Computing Systems. In: ICS 2003, June 23-26 (2003)
Blumofe, R.D., Joerg, C.F., Kuszmaul, B.C., Leiserson, C.E., Randall, K.H., Zhou, Y.: Cilk: An Efficient Multithreaded Runtime System. In: 5th ACM SIAPLAN Symposium on Principles and Practice of Parallel programming (PPOPP 1995), Santa Barbara, CA, pp. 207–216 (July 1995)
Baratloo, A., Karaul, M., Kedem, Z., Wyckoff, P.: Charlotte: Metacomputing on the Web. In: Proceeding 9th International Conference on Parallel and Distributed Computing Systems (1996)
Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4(3) (July 1982)
Entropia home page, http://www.entropia.com
Beberg, A.L., Lawson, J., McNett, D.: distributed.net home page, http://www.distributed.net
Neary, M.O., Phipps, A., Richman, S.: Javelin 2.0: Java-Based Parallel Computing on the Internet. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, p. 1231. Springer, Heidelberg (2000)
Camiel, N., London, S., Nisan, N., Regev, O.: The POPCORN Project: Distributed Computation over the Internet in Java. In: 6th International World Wide Web Conference (April 1997)
Germain, C., et al.: Global Computing Systems. In: Margenov, S., Waśniewski, J., Yalamov, P. (eds.) LSSC 2001. LNCS, vol. 2179, p. 218. Springer, Heidelberg (2001)
Lau, L.F., Ananda, A.L., Tan, G., Wong, W.F.: GUCHA: Internet-based Parallel Computing using Java. In: ICA3PP, pp. 397–408 (December 2000)
Korea@home home page, http://www.koreaathome.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H., Choi, S., Baik, M., Yang, K., Yu, H., Hwang, CS. (2005). Group-Based Scheduling Scheme for Result Checking in Global Computing Systems. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_10
Download citation
DOI: https://doi.org/10.1007/11424857_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)