Abstract
Flexible trust requirements are increasingly become major concern for applications running on data grids. However, existing scheduling strategies are unable to satisfy the trust needs of complex data-intensive applications. To address the issue, we introduce the trust heterogeneity concept for our scheduling model in the context of data grid. Based on the concept, we propose the trust-adaptive scheduling algorithm, which strives to maximize the probability that all tasks are executed with the flexible trust requirements. Extensive experimental studies indicate that the scheduling performance is affected by trust heterogeneities and other performance metrics. Additionally, empirical results demonstrate that with respect to trust and performance, the proposed scheduling algorithm achieves a good trade-off between trust heterogeneity and responsiveness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Qin, X., Jiang, H.: Data Grids: Supporting Data-Intensive Applications in Wide Area Networks. In: High Performance Computing: Paradigm and Infrastructure, pp. 481–494. John Wiley and Sons, Chichester (2005)
Qin, X.: Design and analysis of a load balancing strategy in Data Grids. Future Generation Computer Systems 23(1), 132–137 (2007)
Tang, M., Lee, B.-S., Tang, X., Yeo, C.-K.: The impact of data replication on job scheduling performance in the data grid. Future Generation Computer Systems 22(3), 254–268 (2006)
Park, S.-M., Kim, J.-H.: Chameleon: a resource scheduler in a data grid environment. In: Proc. Int’l. Symp. Cluster Computing and the Grid, pp. 258–265 (2003)
Ranganathan, K., Foster, I.: Decoupling computation and data scheduling in distributed data-intensive applications. In: Proc. IEEE Int. Symp. High Performance Distributed Computing, pp. 352–358 (2002)
Winton, L.: Data grids and high energy physics. A Melbourne perspective.Space Sci. Rev. 107(1–2), 523–540 (2003)
Guido, J., Van ’t Noordende, G.J.: A trusted data storage infrastructure for grid-based medical applications. In: 8th International Symposium on Cluster Computing and the Grid, pp. 627–632 (2008)
Hassan, M.W., McClatchey, R., Willers, I.W.: A Scalable Evidence Based Self-Managing Framework for Trust Management. Electronic Notes in Theoretical Computer Science 179, 59–73 (2007)
Azzedin, F., Maheswaran, M.: A Trust Brokering System and Its Application to Resource Management in Public Resource Grid. In: Intl. Parallel and Distributed Computing Symposium, pp. 289–298 (2004)
Lin, K.-J., Lu, H., Yu, T., Tai, C.-e., Hsu, J.Y.-j.: A Reputation and Trust Management Broker Framework for Web Applications. In: Proceedings of the 2005 IEEE International Conference on E-Technology, E-Commerce, and E-Service, pp. 262–269 (2005)
Sonnek, J.D., Chandra, A., Weissman, J.B.: Adaptive Reputation-Based Scheduling on Unreliable Distributed Infrastructures. IEEE Trans. Parallel Distributed System 18(11), 1551–1564 (2007)
Sonnek, J.D., Nathan, M., Chandra, A., Weissman, J.B.: Reputation-Based Scheduling on Unreliable Distributed Infrastructures. In: IEEE International Conference on Distributed Computing Systems, pp. 30–37 (2006)
Song, S., Kwok, Y.-K., Hwang, K.: Trusted job scheduling in open computational grids: security-driven heuristics and a fast genetic algorithms. In: Proc. Int’l. Symp. Parallel and Distributed Processing, pp. 33–40 (2005)
Song, S., Hwang, K., Kwok, Y.-K.: Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling. IEEE Trans. Computers 55(6), 703–719 (2006)
Sonnek, J.D., Weissman, J.B.: A Quantitative Comparison of Reputation Systems in the Grid. In: Proceedings of the 6th IEEE/ACM International Workshop on Grid Computing, pp. 242–249 (2005)
Liang, Z., Shi, W.: Analysis of ratings on trust inference in open environments. Performance Evaluation 65(2), 99–128 (2008)
Braun, T.D., et al.: A Comparison Study of Static Mapping Heuristics for a Class of Meta-tasks on Heterogeneous Computing Systems. In: Proc. Workshop Heterogeneous Computing, pp. 15–29 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, W., Du, W. (2009). Research on the Trust-Adaptive Scheduling for Data-Intensive Applications on Data Grids. In: Liu, W., Luo, X., Wang, F.L., Lei, J. (eds) Web Information Systems and Mining. WISM 2009. Lecture Notes in Computer Science, vol 5854. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05250-7_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-05250-7_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05249-1
Online ISBN: 978-3-642-05250-7
eBook Packages: Computer ScienceComputer Science (R0)