程春田

个人信息Personal Information

教授

博士生导师

硕士生导师

性别:男

毕业院校:大连理工大学

学位:博士

所在单位:水利工程系

学科:水文学及水资源. 水利水电工程. 电力系统及其自动化. 计算机应用技术

联系方式:ctcheng@dlut.edu.cn

电子邮箱:ctcheng@dlut.edu.cn

扫描关注

论文成果

当前位置: 中文主页 >> 科学研究 >> 论文成果

Utility-driven solution for optimal resource allocation in computational grid

点击次数:

论文类型:期刊论文

发表时间:2009-12-01

发表刊物:COMPUTER LANGUAGES SYSTEMS & STRUCTURES

收录刊物:SCIE、EI、Scopus

卷号:35

期号:4

页面范围:406-421

ISSN号:1477-8424

关键字:Resource allocation; Utility function; Computational grid; GridSim

摘要:Optimal resource allocation is a complex undertaking due to large-scale heterogeneity present in computational grid. Traditionally, the decision based on certain cost functions has been used in allocating grid resource as a standard method that does not take resource access cost into consideration. In this paper, the utility function is presented as a promising method for grid resource allocation. To tackle the issue of heterogeneous demand, the user's preference is represented by utility function, which is driven by a user-centric scheme rather than system-centric parameters adopted by cost functions. The goal of each grid user is to maximize its own utility under different constraints. In order to allocate a common resource to multiple bidding users. the optimal solution is achieved by searching the equilibrium point of resource price such that the total demand fora resource exactly equals the total amount available to generate a set of optimal user bids. The experiments run on a Java-based discrete-event grid simulation toolkit called GridSim are made to study characteristics of the utility-driven resource allocation strategy under different constraints. Results show that utility optimization under budget constraint outperforms deadline constraint in terms of time spent, whereas deadline constraint outperforms budget constraint in terms of cost spent. The conclusion indicates that the utility-driven method is a very potential candidate for the optimal resource allocation in computational grid. (C) 2008 Elsevier Ltd. All rights reserved.