Skip to main content
Log in

Resource allocation in grid computing

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Grid computing, in which a network of computers is integrated to create a very fast virtual computer, is becoming ever more prevalent. Examples include the TeraGrid and Planet-lab.org, as well as applications on the existing Internet that take advantage of unused computing and storage capacity of idle desktop machines, such as Kazaa, SETI@home, Climateprediction.net, and Einstein@home. Grid computing permits a network of computers to act as a very fast virtual computer. With many alternative computers available, each with varying extra capacity, and each of which may connect or disconnect from the grid at any time, it may make sense to send the same task to more than one computer. The application can then use the output of whichever computer finishes the task first. Thus, the important issue of the dynamic assignment of tasks to individual computers is complicated in grid computing by the option of assigning multiple copies of the same task to different computers.

We show that under fairly mild and often reasonable conditions, maximizing task replication stochastically maximizes the number of task completions by any time. That is, it is better to do the same task on as many computers as possible, rather than assigning different tasks to individual computers. We show maximal task replication is optimal when tasks have identical size and processing times have a NWU (New Worse than Used; defined later) distribution. Computers may be heterogeneous and their speeds may vary randomly, as is the case in grid computing environments. We also show that maximal task replication, along with a c μ rule, stochastically maximizes the successful task completion process when task processing times are exponential and depend on both the task and computer, and tasks have different probabilities of completing successfully.

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

Access this article

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

  • Asmussen, S., & Koole, G. (1993). Marked point processes as limits of Markovian arrival streams. Journal of Applied Probability, 30, 365–372.

    Article  Google Scholar 

  • Borst, S., Boxma, O., Groote, J. F., & Mauw, S. (2003). Task allocation in a multi-server system. Journal of Scheduling, 6, 423–436.

    Article  Google Scholar 

  • Cirne, W. (2002). MyGrid: a user-centric approach for grid computing. Walfredo.dsc.ufcg.edu.br/talks/MyGrid.ppt.

  • Dobber, M., van der Mei, R., & Koole, G. (2006). Statistical properties of task running times in a global-scale grid environment. In Proceedings of the 6th IEEE international symposium on cluster computing and the grid (CCGrid 2006) (pp. 150–153).

  • Foster, L., & Kesselman, C. (Eds.). (1999). The grid: blueprint for a new computing infrastructure. San Francisco: Kaufmann.

    Google Scholar 

  • Liu, Z., & Righter, R. (1997). Optimal scheduling on parallel processors with precedence constraints and general costs. Probability in the Engineering and Informational Sciences, 11, 79–93.

    Article  Google Scholar 

  • Müller, A., & Stoyan, D. (2002). Comparison methods for stochastic models and risks. New York: Wiley.

    Google Scholar 

  • Shaked, M., & Shanthikumar, J. G. (1994). Stochastic orders. New York: Academic Press.

    Google Scholar 

  • Weiss, G., & Pinedo, M. (1980). Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. Journal of Applied Probability, 17, 187–202.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rhonda Righter.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koole, G., Righter, R. Resource allocation in grid computing. J Sched 11, 163–173 (2008). https://doi.org/10.1007/s10951-007-0018-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-007-0018-8

Keywords

Navigation