Resource management and knapsack formulations on the grid

被引：1

作者：

Parra-Hernandez, R ^{[1
]}

Vanderster, D ^{[1
]}

Dimopoulos, NJ ^{[1
]}

机构：

[1] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC V8W 3P6, Canada

来源：

FIFTH IEEE/ACM INTERNATIONAL WORKSHOP ON GRID COMPUTING, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/GRID.2004.54

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：94 / 101

页数：8

共 12 条

[1]

[Anonymous], 1998, GRID BLUEPRINT NEW C

[2]

[Anonymous], 1995, LECT NOTES COMPUTER

[3]

CASANOVA H, 2001, P IEEE S CLUST COMP

[4] The grid grows up [J].

Douglis, F ;

Foster, I .

IEEE INTERNET COMPUTING, 2003, 7 (04) :24-26

[5]

GOMOLUCH J, 2003, MIDDL 2003 WORKSH RI, P211

[6] NEW GREEDY-LIKE HEURISTICS FOR THE MULTIDIMENSIONAL 0-1 KNAPSACK-PROBLEM [J].

LOULOU, R ;

MICHAELIDES, E .

OPERATIONS RESEARCH, 1979, 27 (06) :1101-1114

[7]

MOUNIE G, P 11 ANN ACM S PAR A, P23

[8]

Ousterhout J. K., 1982, Proceedings of the 3rd International Conference on Distributed Computing Systems, P22

[9]

PARRAHERNANDEZ R, IN PRESS IEEE T SYST

[10]

PARRAHERNANDEZ R, 2002, WSEAS T SYSTEMS, P248

← 1 2 →