Resource allocation on computational grids using a utility model and the knapsack problem

• Published in: Future generation computer systems Vol. 25; no. 1; pp. 35 - 50
• Main Authors: Vanderster, Daniel C., Dimopoulos, Nikitas J., Parra-Hernandez, Rafael, Sobie, Randall J.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 2009
• Subjects: Grid computing; Knapsack problem; Metascheduling; Quality of service; Resource allocation; Simulation; Grid computing; Metascheduling; Simulation; Quality of service; Resource allocation; Knapsack problem
• ISSN: 0167-739X; 1872-7115
• DOI: 10.1016/j.future.2008.07.006

This work introduces a utility model (UM) for resource allocation on computational grids and formulates the allocation problem as a variant of the 0–1 multichoice multidimensional knapsack problem. The notion of task-option utility is introduced, and it is used to effect allocation policies. We present a variety of allocation policies, which are expressed as functions of metrics that are both intrinsic and external to the task and resources. An external user-defined credit-value metric is shown to allow users to intervene in the allocation of urgent or low priority tasks. The strategies are evaluated in simulation against random workloads as well as those drawn from real systems. We measure the sensitivity of the UM-derived schedules to variations in the allocation policies and their corresponding utility functions. The UM allocation strategy is shown to optimally allocate resources congruent with the chosen policies.