Abstract
As Grid and P2P computing become more and more popular, many schedule algorithms based on economics rather than traditional pure computing theory have been proposed. Such algorithms mainly concern balancing resource supply and resource demand via economic measures. As we know, fairness and efficiency are two conflicting goals. In this paper, we argue that overbooking resources can greatly improve usage rates of resources and simultaneously reduce responsive time of tasks by shortening schedule time especially under extreme overload, while maintaining schedule principles. This is accomplished by scheduling more eligible tasks above resource capacity in advance, therefore overbooking the resource. We verify our claim on Grid Market[1].
This project is supported by the National Natural Science Foundation of China under Grant No. 60373004, No. 60373005, and No. 60273007, and by the National High Technology Development Program of China under Grant No. 2002AA104580
Chapter PDF
Similar content being viewed by others
References
Chen, M., Yang, G., Liu, X.: Gridmarket: A Practical, Efficient Market Balancing Resource for Grid and P2P Computing. In: Grid and Cooperative Computing 2003, Shanghai (2003)
Hogg, Huberman, B., Kephart, J., Stornetta, W.: Spawn: A Distributed Computational Economy. IEEE Transactions on Software Engineering (February 1992)
Vickrey, W.: Counter-speculation, auctions, and competitive sealed tenders. Journal of Finance 16(1), 9–37 (1961)
Chun, B., Culler, D.: Market-based proportional resource sharing for clusters, Technical Report CSD-1092, University of California, Berkeley, USA (January 2000)
Lalis, S., Karipidis, A.: An Open Market-Based Framework for Distributed Computing over the Internet. In: Buyya, R., Baker, M. (eds.) GRID 2000. LNCS, vol. 1971, pp. 36–46. Springer, Heidelberg (2000)
Hock, N.C.: Queuing Modelling Fundamentals. John Wiley & Sons Ltd., Chichester (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chen, M., Wu, Y., Yang, G., Liu, X. (2004). Efficiently Rationing Resources for Grid and P2P Computing. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive