Abstract
In an ad-hoc Grid environment where producers and consumers compete for providing and employing resources, trade handling in a fair and stable way is a challenging task. Dynamic changes in the availability of resources over time makes the treatment yet more complicated. Here we employ a continuous double auction protocol as an economic-based approach to allocate idle processing resources among the demanding nodes. Consumers and producers determine their bid and ask prices using a sophisticated history-based dynamic pricing strategy and the auctioneer follows a discriminatory pricing policy which sets the transaction price individually for each matched buyer-seller pair. The pricing strategy presented generally simulates human intelligence in order to define a logical price by local analysis of the previous trade cases. This strategy is adopted to meet the user requirements and constraints set by consumers/producers. Experimental results show waiting time optimization which is particularly critical when resources are scarce.
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
M. Litzkow, M. Livny, and M. Mutka, “Condor - a hunter of idle workstations”, In Proceedings of the 8$th$ International Conference of Distributed Computing Systems, June 1988.
R. Buyya, D. Abramson, and S. Venugopal, The grid economy. In Special Issue on Grid Computing, vol. 93, pp. 698-714, 2005.
R. Buyya, D. Abramson, and J. Giddy, “Nimrod-G: An architecture for a resource management and scheduling system in a global computational grid”, In Proceedings of The 4$th$ Int. Conf. on High Performance Computing in Asia-Pacific Region, USA, 2000.
R. Wolski, J. Brevik, J. S. Plank, and T. Bryan, Grid resource allocation and control using computational economies, In Grid Computing: Making The Global Infrastructure a Reality, John Wiley & Sons, 2003.
R. Buyya, D. Abramson, J. Giddy, and H. Stockinger, Economic models for resource management and scheduling in grid computing, Concurrency and Computation: Practice and Experience, vol. 14(13-15), pp.1507-1542, 2002.
C. Weng, X. Lu, G. Xue, Q. Deng, and M. Li, “A double auction mechanism for resource allocation on grid computing systems”, In GCC, page 269, 2004.
J. Gomoluch and M. Schroeder, Market-based resource allocation for grid computing: A model and simulation, 2003.
U. Kant and D. Grosu, “Double auction protocols for resource allocation in grids”, In Proceedings of the Int. Conf. on Information Technology: Coding and Computing, pp. 366-371, 2005.
D. Grosu and A. Das, “Auction-based resource allocation protocols in grids,” In Proceedings of the 16$th$ IASTED Int. Conf. on Parallel and Distributed Computing and Systems, pp. 20-27, November 2004.
M. D. de Assuncao and R. Buyya, “An evaluation of communication demand of auction protocols in grid environments”, In Proceedings of the 3$rd$ Int. Workshop on Grid Economics & Business, Singapore, 2006.
B. Pourebrahimi, K. Bertels, G. Kandru, and S. Vassiliadis, “Market-based resource allocation in grids”, In proceedings of 2$nd$ IEEE Int. Conf. on e-Science and Grid Computing, page 80, 2006.
M. Satterthwaite and S. Williams, “The Bayesian theory of the k-double auction”, The Double Auction Market: Institutions, Theories and Evidence, Santa Fe Institute Studies in the Sciences of Complexity, pp. 99-123, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media B.V.
About this paper
Cite this paper
Pourebrahimi, B., Ostadzadeh, S.A., Bertels, K. (2008). Resource Allocation in Market-based Grids Using a History-based Pricing Mechanism. In: Sobh, T. (eds) Advances in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8741-7_18
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8741-7_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8740-0
Online ISBN: 978-1-4020-8741-7
eBook Packages: Computer ScienceComputer Science (R0)