Abstract
The scale of the parallel and distributed systems (PDSs), such as grids and clouds, and the diversity of applications running on them put reliability a high priority performance metric. This paper presents a reputation-based resource allocation strategy for PDSs with a market model. Resource reputation is determined by availability and reliable execution. The market model helps in defining a trust interaction between provider and consumer that leverages dependable computing. We also have explicitly taken into account data staging and its delay when making the decisions. Results demonstrate that our approach significantly increases successful execution, while exploiting diversity in tasks and resources.
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
Lee, Y.C., Zomaya, A.Y.: Scheduling in grid environments. In: Rajasekaran, S., Reif, J. (eds.) Handbook of Parallel Computing: Models, Algorithms and Applications, pp. 21.1–21.19. CRC Press, Boca Raton (2008)
Czajkowski, K., Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (2003)
Eymann, T., Konig, S., Matros, R.: A Framework for Trust and Reputation in Grid Environments. Journal Grid Computing 6(3), 225–237 (2008)
Hussin, M., Lee, Y.C., Zomaya, A.Y.: ADREA: A Framework for Adaptive Resource Allocation in Distributed Computing Systems. In: 11th Int’l Conf. on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 50–57 (2010)
Dabrowski, C.: Reliability in Grid Computing System. Concurrency and Computation: Practice and Experience 21(8), 927–959 (2009)
Xiao, L., Zhu, Y., Ni, L.M., et al.: Incentive-Based Scheduling for Market-Like Computational Grids. IEEE Transaction on Parallel and Distributed Systems 19(7), 903–913 (2008)
Chunlin, L., Layuan, L.: A Utility-based Two Level Market Solution For Optimal Resource Allocation In Computational Grid. In: Proc. of the 34th Int’l Conf. on Parallel Processing (ICPP), Washington (2005)
Damiani, E., Vimercati, S.D.C.d., Paraboschi, S., et al.: A Reputation-based Approach for Choosing Reliable Resources in Peer-to-Peer Networks. In: Proc. of the 9th ACM Conf. on Computer and Communications Security, Washington, DC, USA, pp. 207–216 (2002)
Sonnek, J., Chandra, A., Weissman, J.B.: Adaptive Reputation-based Scheduling on Unreliable Distributed Infrastructures. IEEE Transaction on Parallel and Distributed Systems 18(11), 1551–1564 (2007)
Liang, Z., Shi, W.: A reputation-driven scheduler for autonomic and sustainable resource sharing in Grid computing. Journal Parallel and Distributed Computing 70(2), 111–125 (2010)
Hwang, K., Kulkareni, S., Hu, Y.: Cloud Security with Virtualized Defense and Reputation-based Trust Management. In: 8th IEEE Int’l Conf. on Dependable, Autonomic and Secure Computing, Chengdu, China, pp. 717–722 (2009)
Casavant, T.L., Kuhl, J.G.: A Taxonomy of Scheduling in general-purpose Distributed Computing Systems. IEEE Transaction on Software Engineering 14(2), 141–154 (1988)
Shetty, S., Padala, P., Frank, M.P.: A Survey of Market-based Approaches to Distributed Computing. University of Florida, Florida (2003)
PWA: Parallel workloads archive, http://www.cs.huji.ac.il/labs/parallel/workload/logs.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hussin, M., Lee, Y.C., Zomaya, A.Y. (2011). Reputation-Based Resource Allocation in Market-Oriented Distributed Systems. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-24650-0_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24649-4
Online ISBN: 978-3-642-24650-0
eBook Packages: Computer ScienceComputer Science (R0)