Resource Management and Knapsack Formulations on the Grid

Authors:
R. Parra-Hernandez;D. Vanderster;N. J. Dimopoulos
Affiliations:
University of Victoria, Canada;University of Victoria, Canada;University of Victoria, Canada
Venue:
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Year:
2004

Citing 6
Cited 5

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Efficient approximation algorithms for scheduling malleable tasks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
The ANL/IBM SP Scheduling System

IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Simgrid: A Toolkit for the Simulation of Application Scheduling

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Guest Editors' Introduction: The Grid Grows Up

IEEE Internet Computing
A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem

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

Sensitivity analysis of knapsack-based task scheduling on the grid

Proceedings of the 20th annual international conference on Supercomputing
Efficient task replication and management for adaptive fault tolerance in mobile Grid environments

Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Metascheduling Multiple Resource Types using the MMKP

GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
A tenant-based resource allocation model for scaling Software-as-a-Service applications over cloud computing infrastructures

Future Generation Computer Systems
Exploiting task temperature profiling in temperature-aware task scheduling for computational clusters

ACSAC'07 Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work formulates the resource allocation problem on grids as a knapsack problem. The notion of utility is introduced, and it is used to effect allocation policies. Simulation results using a variety of allocation policies are presented and show that knapsack formulations optimally allocate resources congruent with the chosen policies.