Skip to main content
SpringerLink
Log in

Bandwidth-Constrained Allocation in Grid Computing

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can “draw” resources from this reservoir 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2), 331–352 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chapin, S., Karpovich, J., Grimshaw, A.: The legion resource management system. In: Workshop on Job Scheduling Strategies for Parallel Processing. Lecture Notes in Computer Science, vol. 1659, pp. 162–178. Springer, Berlin (1999)

    Chapter  Google Scholar 

  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)

  4. Chun, B., Culler, D.E.: Market-based proportional resource sharing clusters. Technical report, UC Berkeley, Comput. Sci. (2000)

  5. Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval scheduling problem and related scheduling problems. In: Proc. FOCS, pp. 348–356 (2001)

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  7. 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. Lecture Notes in Computer Science, vol. 1459, pp. 62–82. Springer, Berlin (1998)

    Chapter  Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  9. HP Adaptive Enterprise: A Dynamic Enterprise Needs Dynamic IT (HP white paper) (2003)

  10. IBM On-demand Computing: http://www-1.ibm.com/servers/eserver/iseries/ondemand/

  11. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)

    MATH  Google Scholar 

  12. Litzkow, M., Ivny, M., Mutka, M.: Condor—a hunter of idle workstations. In: Proc. of 8th International Conference on Distributed Computing Systems, pp. 104–111 (1988)

  13. SETI@home: http://setiathome.ssl.berkeley.edu

  14. Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Math. Program. A 62, 461–474 (1993)

    Article  MathSciNet  Google Scholar 

  15. Sun N1: http://www.sun.com/software/solutions/n1/

  16. Waldspurger, C., Hogg, T., Huberman, B., Kephart, J., Stornetta, W.: Spawn—a distributed computational economy. IEEE Trans. Softw. Eng. 18(2), 103–117 (1992)

    Article  Google Scholar 

  17. Wolski, R., Plank, J., Brevik, J., Bryan, T.: Analyzing market-based resource allocation strategies for the computational grid. Int. J. High Perform. Comput. Appl. 15(3), 258–281 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Anshul Kothari & Subhash Suri

  2. HP Labs, 1501 Page Mill Road, Palo Alto, CA, 94304, USA

    Yunhong Zhou

Authors
  1. Anshul Kothari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subhash Suri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yunhong Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yunhong Zhou.

Additional information

A preliminary version of this paper was presented at the 2003 Workshop on Algorithms and Data Structures, Ottawa. The work of Anshul Kothari and Subhash Suri was supported in part by National Science Foundation grants IIS-0121562 and CCR-9901958.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kothari, A., Suri, S. & Zhou, Y. Bandwidth-Constrained Allocation in Grid Computing. Algorithmica 52, 487–501 (2008). https://doi.org/10.1007/s00453-007-9085-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9085-7

Keywords

Search

Navigation