Abstract
Offering Grid services in an open market determines an optimization case for finding the best suitable resource allocation for a given number of requests and existing resources. Thus, appropriate resource allocation schemes, supporting accounting, are required in addition to a pricing scheme, which supports financial fairness criteria. The newly developed Resource Allocation Model for the Combinatorial Double Auction (RAMCoDA) achieves these requirements, while being incentive compatible.
This work was supported partly by the European Union through the EC-GIN project (STREP) under Grant No. FP6-2006-IST-045256. The authors acknowledge fruitful discussions with all their project partners.
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
Das, A., Grosu, D.: Combinatorial auction-based protocols for resource allocation in Grids. In: 19th IEEE International Parallel and Distributed Processing Symposium, Colorado, U.S.A., pp. 23–30 (2005)
Ghosh, P., Roy, N., Das, S.K., Basu, K.: A pricing strategy for job allocation in mobile Grids using a non-cooperative bargaining theory framework. Journal of Parallel and Distributed Computing 65(11), 1366–1383 (2005)
Li, L., Liu, Y.A., Stiller, B.: Combinatorial double auction-based scheme for resource allocation in Grids. University of Zürich, Department of Informatics, CSG, Technical Report No. 2008.05, Zürich, Switzerland (2008)
Pourebrahimi, B., Bertels, K., Kandru, G.M., Vassiliadis, S.: Market-based resource allocation in Grids. In: Second IEEE international Conference on e-Science and Grid Computing, Amsterdam, The Netherlands, pp. 80–88 (2006)
Stuer, G., Vanmechelen, K., Broeckhove, J.: A commodity market algorithm for pricing substitutable Grid resources. Future Generation Computer Systems 23(5), 688–701 (2007)
Schwind, M., Gujo, O., Stockheim, T.: Dynamic resource prices in a combinatorial Grid system. In: 8th IEEE International Conference on E-Commerce Technology and 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services, San Francisco, California, U.S.A., pp. 49–54 (2006)
Xia, M., Koehler, G.J., Whinston, A.B.: Pricing combinatorial auctions. European Journal of Operational Research 154(1), 251–270 (2004)
Xia, M., Stallaert, J., Whinston, A.B.: Solving the combinatorial double auction problem. European Journal of Operational Research 164(1), 239–251 (2005)
Yang, J., Yang, S.B., Li, M.S., Fu, Q.F.: An autonomous pricing strategy toward market economy in computational Grids. In: International Conference on Information Technology: Coding and Computing, Las Vegas, Nevada, U.S.A., pp. 793–794 (2005)
Zhao, X.G., Xu, L.T., Wang, B.: A dynamic price model with demand prediction and task classification. In: The Sixth International Conference on Grid and Cooperative Computing, Urumchi, P.R. China, pp. 775–782 (2007)
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
Li, L., Liu, Y., Hausheer, D., Stiller, B. (2009). Design and Evaluation of a Combinatorial Double Auction for Resource Allocations in Grids. In: Reichl, P., Stiller, B., Tuffin, B. (eds) Network Economics for Next Generation Networks. ICQT 2009. Lecture Notes in Computer Science, vol 5539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01796-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-01796-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01795-7
Online ISBN: 978-3-642-01796-4
eBook Packages: Computer ScienceComputer Science (R0)