Utility driven dynamic resource allocation using competitive markets in computational grid

被引:12
|
作者
Li, CL [1 ]
Li, LY
Lu, ZD
机构
[1] Wuhan Univ Technol, Dept Commun & Neurosci, Wuhan 430063, Peoples R China
[2] Huazhong Univ Sci & Technol, Dept Comp Sci, Wuhan 430074, Peoples R China
关键词
grid resource allocation; heterogeneity; utility function; market;
D O I
10.1016/j.advengsoft.2004.11.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a utility-based market mechanism for dynamic resource allocation in computational grid. The proposed competitive market economy is described. It consists of three different types of agents: grid request agent, grid resource agents, grid task agents; and a grid market that regulates the prices based on the observed aggregate excess demand. In order to solve the problem of heterogeneous demand in the grid, grid users' preferences are summarized by means of their utility functions. We consider budget and complete times as constraints of optimization problem. The objective of the optimization problem is to determine the amount of resources under different constraints to maximize the users' utilities. This paper proves the existence of a solution of the optimization problem, it also specify an iterative algorithm that is used by the grid market to update the prices, and it leads to an allocation that is close to a solution of the optimization problem in a finite number of iterations. The experiments are made to study characteristics of the utility directed allocation algorithm under budget constraint and under completed time constraint in terms of completion time and resource allocation efficiency. (c) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:425 / 434
页数:10
相关论文
共 50 条
  • [1] Utility-driven solution for optimal resource allocation in computational grid
    Li, Zhi-jie
    Cheng, Chun-tian
    Huang, Fei-xue
    [J]. COMPUTER LANGUAGES SYSTEMS & STRUCTURES, 2009, 35 (04) : 406 - 421
  • [2] Competitive proportional resource allocation policy for computational grid
    Li, CL
    Li, LY
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2004, 20 (06): : 1041 - 1054
  • [3] Pricing and resource allocation in computational grid with utility functions
    Li, CL
    Li, LY
    [J]. ITCC 2005: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, 2005, : 175 - 180
  • [4] Price driven market mechanism for computational grid resource allocation
    Li, CL
    Lu, ZD
    Li, LY
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 4, 2004, 3046 : 117 - 126
  • [5] Dynamic resource allocation for joint grid user and provider optimisation in computational grid
    Li Chunlin
    Li Layuan
    [J]. INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2006, 26 (04) : 242 - 250
  • [6] A green energy model for resource allocation in computational grid using dynamic threshold and GA
    Kaushik, Achal
    Vidyarthi, Deo Prakash
    [J]. SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS, 2016, 9 : 42 - 56
  • [7] A distributed decomposition policy for computational grid resource allocation optimization based on utility functions
    Li, CL
    Li, LY
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2005, 29 (06) : 261 - 272
  • [8] A fault-tolerant hybrid resource allocation model for dynamic computational grid
    Sheikh, Sophiya
    Nagaraju, A.
    Shahid, Mohammad
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2021, 48
  • [9] Effective Reformulation for Resource Allocation in Computational Grid
    Dong, Xiaoshe
    Mei, Yiduo
    Ma, Siyuan
    Gong, Guannan
    Zhu, Zhengdong
    [J]. INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2009, 5 (01) : 90 - 90
  • [10] Effective reformulation for resource allocation in computational grid
    Dong, Xiaoshe
    Mei, Yiduo
    Ma, Siyuan
    Gong, Guannan
    Zhu, Zhengdong
    [J]. INTERNATIONAL SYMPOSIUM ON ADVANCES IN COMPUTER AND SENSOR NETWORKS AND SYSTEMS, PROCEEDINGS: IN CELEBRATION OF 60TH BIRTHDAY OF PROF. S. SITHARAMA IYENGAR FOR HIS CONTRIBUTIONS TO THE SCIENCE OF COMPUTING, 2008, : 242 - 249