Abstract
Since participants in a computational grid may be independent bodies, some mechanisms are necessary for resolving the differences in their preferences for price and desirable time slots for utilizing/leasing computing resources. Whereas there are mechanisms for supporting price negotiation for grid resource allocation, there is little or no negotiation support for allocating mutually acceptable time slots for grid participants. The contribution of this work is designing a negotiation mechanism for facilitating time slot negotiations between grid participants. In particular, this work adopts a relaxed time slot negotiation protocol designed to enhance the success rate and resource utilization level by allowing some flexibility for making slight adjustments following a tentative agreement for a mutually acceptable time slot. The ideas of the relaxed time slot negotiation are implemented in an agent-based grid testbed, and empirical results of the relaxed time slot negotiation mechanism carried out, (i) a consumer and a provider agent have a mutually satisfying agreement on time slot and price, (ii) consumer agents achieved higher success rates in negotiation, and (iii) provider agents achieved higher utility and resource utilization of overall grid.
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., et al.: Brain meets brawn: Why Grid and agents need each other. In: 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems, USA, pp. 8–15 (2004)
Sim, K.M.: A Survey of Bargaining Models for Grid Resource Allocation. In: ACM SIGECOM: E-commerce Exchange, vol. 5(5), pp. 22–32 (2006)
Lang, F.: Developing Dynamic Strategies for Multi-Issue Automated Contracting in the Agent Based Commercial Grid. In: The IEEE Int. Sym. on Cluster Computing and the Grid (CCGrid 2005), Cardiff (2005)
Lawley, R., et al.: Automated Negotiation between publishers and consumers of grid notifications. Parallel Processing Letters 13(4), 537–548 (2003)
Sim, K.M., Ng, K.F.: A Relaxed-Criteria Bargaining Protocol for Grid Resource Management. In: Proceedings of the 6th IEEE Int. Sym. on Cluster Computing and the Grid (Agent-based Grid Computing Workshop) (2006)
Venugopal, S., Chu, X., Buyya, R.: A Negotiation Mechanism for Advance Resource Reservation using the Alternate Offers Protocol. In: 16th Int. Workshop on Quality of Service (IWQoS 2008). University of Twente, Netherlands (2008)
Waeldrich, O., Wieder, P., Ziegler, W.: A meta-scheduling service for co-allocating arbitrary types of resources. CoreGRID Technical Report (December 2005)
Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50(1), 97–109
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
Son, S., Sim, K.M. (2009). Relaxed Time Slot Negotiation for Grid Resource Allocation. In: Ślęzak, D., Kim, Th., Yau, S.S., Gervasi, O., Kang, BH. (eds) Grid and Distributed Computing. GDC 2009. Communications in Computer and Information Science, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10549-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-10549-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10548-7
Online ISBN: 978-3-642-10549-4
eBook Packages: Computer ScienceComputer Science (R0)