Modelling robust resource allocation for grid computing

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

With the increase in size, complexity, and heterogeneity of grid computing environments, we argue that, in addition to performance metrics, the resource allocation algorithms should be designed for robustness. That is, they should have the ability to maintain performance under a wide variety of operating conditions. Although robustness is easy to define, there are no widely used metrics for this property. We introduce the concept of robustness and present an analysis technique to determine the robustness of a resource allocation. As the main contributions of the paper, we present a mathematical description of a metric for the robustness of a resource allocation with respect to a specific disturbance. Simulation results prove the efficiency and applicability of our algorithms. © 2006 IEEE.

Cite

CITATION STYLE

APA

Tian, Z., Yang, Y., & Zhai, Z. (2006). Modelling robust resource allocation for grid computing. In Proceedings - Fifth International Conference on Grid and Cooperative Computing, GCC 2006 (pp. 32–37). https://doi.org/10.1109/GCC.2006.63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free