Advertisement

Bandwidth-Constrained Allocation in Grid Computing

  • Anshul Kothari
  • Subhash Suri
  • Yunhong Zhou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

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.

Keywords

Allocation Problem Knapsack Problem Resource Allocation Problem Resource Unit Bandwidth Resource 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Chapin, S., Karpovich, J., Grimshaw, A.: The legion resource management system. In: Workshop on Job Scheduling Strategies for Parallel Processing (1999)Google Scholar
  3. 3.
    Chekuri, C., Khanna, S.: A ptas for the multiple knapsack problem. In: Proc. of 11th Annual Symposium on Discrete Algorithms, pp. 213–222 (2000)Google Scholar
  4. 4.
    Chun, B., Culler, D.E.: Market-based proportional resource sharing clusters. Technical report, UC Berkeley, Computer Science (2000) Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)zbMATHGoogle Scholar
  8. 8.
    Litzkow, M., Ivny, M., Mutka, M.: Condor—a hunter of idle workstations. In: Proc. of 8th International Conference on Distributed Computing (1988)Google Scholar
  9. 9.
    Waldspurger, C., Hogg, T., Huberman, B., Kephart, J., Stornetta, W.: Spawn—a distributed computational economy. IEEE Trans. on Software Engineering (1992)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
  12. 12.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Anshul Kothari
    • 1
  • Subhash Suri
    • 1
  • Yunhong Zhou
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA
  2. 2.Hewlett-Packard LaboratoriesPalo AltoUSA

Personalised recommendations