Escalonamento Tolerante a Sabotagem em Grades Computacionais Entre-Pares
Abstract
The computational grids were built to be an infrastructure to increase computing power. They have evolved in the sense of forming free-to-join communities to share computing power over the Internet, and won the title of peer- to-peer (P2P) grids. Note that as any user can freely join and leave a system, it can become susceptible to damages caused by cheater users. A solution to this problem is applying sabotage tolerant schemes, which are generally based on replication to estimate the computation correctness. This work concerns sabotage tolerant scheduling in P2P grids and shows that it is possible to obtain high levels of realiability for the computation results, minimizing the costs of replication through the use of credibility-based fault tolerance in the task scheduling.
References
Cirne, W., Brasileiro, F., Andrade, N., Costa, L., Andrade, A., Novaes, R., and Mowbray, M. (2006). Labs of the world, unite!!! Journal of Grid Computing.
Collberg, C. and Thomborson, C. (2002). Watermarking, tamper-proofing, and obfuscation tools for software protection. IEEE Transactions on Software Engineering, 28(8).
Collberg, C., Thomborson, C., and Low, D. (1997). A taxonomy of obfuscating transformations. Technical report 161, Department of Computer Science, The University of Auckland, New Zealand.
Dinda, P. (2004). Addressing the trust asymmetry problem in grid computing with encrypted computation. In Proceedings of the Seventh Workshop on Languages, Compilers and Run-time Support for Scalable Systems (LCR).
Hohl, F. (1998). Mobile Agents and Security, chapter Limited Blackbox Security: Protecting Mobile Agents from Malicious Hosts. Springer Verlag, Germany.
Molnar, D. (2000). The seti@home problem.
Sarmenta, L. F. G. (1999). Protecting programs from hostile environments: Encrypted computation, obfuscation, and other techniques. Area Exam Paper, Dept. of Electrical Engineering and Computer Science, MIT.
Sarmenta, L. F. G. (2002). Sabotage-tolerance mechanisms for volunteer computing systems. Future Generation Computer Systems (Expanded journal version of CCGrid ’01 Best Paper Finalist paper), Elsevier.
Sonnek, J., Nathan, M., and Chandra, A. (2006). Reputation-based scheduling on unreliable distributed infrastructures. To appear in the Proceedings of the 26th International Conference on Distributed Computing Systems (ICDCS’06), Lisboa, Portugal, July 2006.
Zhao, S., Lo, V., and GauthierDickey, C. (2005). Result verification and trust-based scheduling in peer-to-peer grids. In Fith IEEE International Conference on Peer-to-Peer Computing (IEEE P2P), pages 31–38.
