Abstract
Security and reliability are major concerns in Grid computing systems. Trust mechanism has been focus of much research in recent years providing a safety and reliable Grid computing environment. Based on EigenTrust model, in this paper, we extend the traditional job scheduling strategies and present a new algorithm named Trust-Oriented Sufferage algorithm. Simulations are performed to evaluate the performance of the new algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of Supercomputer Application (2001)
Wang, W., Zeng, G.S.: Trusted Dynamic Level Scheduling Based on Bayes Trust Model. Science in China: Series F Information Sciences 37(2), 285–296 (2007)
Azzedin, F., Matheswaran, M.: Integrating trust into grid resource management systems. In: ICPP 2002. 2002 International Conference on Parallel Processing, pp. 47–54. IEEE Press, Canada (2002)
Abdul-Rahman, A., Hailes, S.: Supporting trust in virtual communities. In: Hawaii Int’l Conference on System Sciences (January 2000)
Song, S., Kwok, Y.-K., Hwang, K.: Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2005) (2005)
Abawajy, J.H.: Fault-Tolerant Scheduling Policy for Grid Computing Systems. In: Proc. IPDPS (2004)
Misztal, B.: Trust in Modern Societies [M]. Polity Press, Cambridge (1996)
Grandison, T., Sloman, M.: A survey of trust in Internet applications. IEEE Communications Surveys & Tutorials 4(4), 2–16 (2000)
Kamvar, S.D., Schlosser, M.T., Garcia-Molna, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th International World Wide Web Conference (WWW 2003), Budapest, Hungary (2003)
Buyya, R., Murshed, M.: A Deadline Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids, CoRR cs.DC/0203020 (2002)
Li, K., He, Y., Liu, X., Wang, Y.: Security-Driven Scheduling Algorithms Based on EigenTrust in Grid. In: pdcat, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT 2005), pp. 1068–1072 (2005)
Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems. In: Proceedings of the Eighth Heterogeneous Computing Workshop (HCW 1999), San Juan, Puerto Rico, pp. 30–44 (April 1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, M., Zeng, G., Yuan, L., Wang, W. (2007). A Trust-Oriented Heuristic Scheduling Algorithm for Grid Computing. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2007. Lecture Notes in Computer Science, vol 4671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73940-1_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-73940-1_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73939-5
Online ISBN: 978-3-540-73940-1
eBook Packages: Computer ScienceComputer Science (R0)