Abstract
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can “draw” resources using a pay-as-you-go model, commonly used for utilities (electricity and water). We model such a system as a capacitated graph, and study a basic allocation problem: given a set of jobs, each demanding computing and bandwidth resources and yielding a profit, determine which feasible subset of jobs yields the maximum total profit.
Anshul Kothari and Subhash Suri are supported in part by National Science Foundation grants IIS-0121562 and CCR-9901958.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. In: Proc. of the 31st ACM Symp. on Theory of Computing, pp. 622–631 (1999)
Chapin, S., Karpovich, J., Grimshaw, A.: The legion resource management system. In: Workshop on Job Scheduling Strategies for Parallel Processing (1999)
Chekuri, C., Khanna, S.: A ptas for the multiple knapsack problem. In: Proc. of 11th Annual Symposium on Discrete Algorithms, pp. 213–222 (2000)
Chun, B., Culler, D.E.: Market-based proportional resource sharing clusters. Technical report, UC Berkeley, Computer Science (2000)
Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval scheduling problem and realted scheduling problems. In: Proc. of 42nd Annual Symposium on Foundation of Computer Science, pp. 348–356 (2001)
Czajkowski, K., Foster, I., Karonis, N., Kesselman, C., Martin, S., Smith, W., Tuecke, S.: A resource management architecture for metacomputing systems. In: Workshop on Job Scheduling Strategies for Parallel Processing (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)
Litzkow, M., Ivny, M., Mutka, M.: Condor—a hunter of idle workstations. In: Proc. of 8th International Conference on Distributed Computing (1988)
Waldspurger, C., Hogg, T., Huberman, B., Kephart, J., Stornetta, W.: Spawn—a distributed computational economy. IEEE Trans. on Software Engineering (1992)
Wolski, R., Plank, J., Brevik, J., Bryan, T.: Analyzing market-based resource allocation strategies for the computational grid. Int. Journal of High Performance Computing Applications (2001)
Seti@home, http://setiathome.ssl.berkeley.edu
Extended Version, http://www.cs.ucsb.edu/~suri/pubs.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kothari, A., Suri, S., Zhou, Y. (2003). Bandwidth-Constrained Allocation in Grid Computing. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-45078-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40545-0
Online ISBN: 978-3-540-45078-8
eBook Packages: Springer Book Archive