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

Authors:
Daniel C. Vanderster;Nikitas J. Dimopoulos;Rafael Parra-Hernandez;Randall J. Sobie
Affiliations:
CERN, Geneva, Switzerland;Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada;Enquisite Software Inc., Victoria, BC, Canada;Department of Physics and Astronomy, University of Victoria, Victoria, BC, Canada and Institute of Particle Physics of Canada, Canada
Venue:
Future Generation Computer Systems
Year:
2009

Citing 18
Cited 5

Efficient approximation algorithms for scheduling malleable tasks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems

Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
A computational economy for grid computing and its implementation in the Nimrod-G resource broker

Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
Simgrid: A Toolkit for the Simulation of Application Scheduling

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Matchmaking: Distributed Resource Management for High Throughput Computing

HPDC '98 Proceedings of the 7th IEEE International Symposium on High Performance Distributed Computing
A Metascheduler For The Grid

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Condor-G: A Computation Management Agent for Multi-Institutional Grids

HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Xen and the art of virtualization

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Optimal quality of service routing and admission control using the utility model

Future Generation Computer Systems - Selected papers on theoretical and computational aspects of structural dynamical systems in linear algebra and control
The Grid 2: Blueprint for a New Computing Infrastructure

The Grid 2: Blueprint for a New Computing Infrastructure
A grid service broker for scheduling distributed data-oriented applications on global grids

MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
Metascheduling Multiple Resource Types using the MMKP

GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
A deadline and budget constrained scheduling algorithm for escience applications on data grids

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

An integrated security-aware job scheduling strategy for large-scale computational grids

Future Generation Computer Systems
Active rule learning using decision tree for resource management in Grid computing

Future Generation Computer Systems
A tenant-based resource allocation model for scaling Software-as-a-Service applications over cloud computing infrastructures

Future Generation Computer Systems
A P2P computing system for overlay networks

Future Generation Computer Systems
Behavioral modeling and formal verification of a resource discovery approach in Grid computing

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.