Effective Reformulation for Resource Allocation in Computational Grid. (2009)

• Record Type: Journal Article
• Authors: Dong Dong, Xiaoshe Xiaoshe; Mei Mei, Yiduo Yiduo; Ma Ma, Siyuan Siyuan; Gong Gong, Guannan Guannan; Zhu Zhu, Zhengdong Zhengdong
• Is Part Of: International journal of distributed sensor networks. Volume 5:Number 1(2009)
• Page Start: 90
• Page End: 90
• Publication Date: 2009
• Subjects: Sensor networks -- Periodicals; Intelligent agents (Computer software) -- Periodicals; Multisensor data fusion -- Periodicals; 681.2
• DOI: 10.1080/15501320802575070
• Languages: English
• ISSNs: 1550-1329

Abstract

Abstract : Grid enables resource sharing and dynamic allocation of computational resources. It is a great challenge to make numerous resources available on-demand to guarantee the Quality-of-Service for jobs. This paper presents a two-stage optimization model for resource allocation in grid. Job constraints are classified into mandatory constraints and negotiated constraints. In the first stage, a preprocessing procedure such as resource discovery deals with the mandatory constraints. This has been fulfilled as our previous work. In the second stage, negotiated constraints are treated as Knapsack Problem-based optimization problem. Centralized scheduling and decentralized scheduling have been considered in this paper. This work is fulfilled as part of the Constellation Model for grid resource management. We formulate centralized scheduling as Multi-Constraint Multiple Knapsack Problem (MCMKP). In centralized scheduling, jobs are submitted to a global job queue. A global scheduler assigns each job to a proper grid site according to the scheduling strategy. The scheduling is done periodically (e.g. daily or weekly). We formulate decentralized scheduling as Multi-Dimensional Knapsack Problem (MDKP). In decentralized scheduling, jobs are submitted to local job queues. Allocation decisions are made by local schedulers individually. Jobs that can not be executed immediately are sent to a global waiting queue. When local scheduling is initialized, a local scheduler can select jobs from both the local job queue and the global waiting queue. Objectives of both centralized scheduling and decentralized scheduling are to optimize the utility defined by a grid economy approach. The defined utility makes the trade-offs between user-concerned metrics and system-concerned metrics. Heuristic algorithms such as Very Large-Scale Neighborhood Search proposed by R. K. Ahuja and C. B. Cunha [2005] can be used to solve the combinatorial optimization problem. We implemented a prototype of the Constellation Model. Genetic algorithms for constrained optimization which is proposed by S. Venkatraman and G. G. Yen [2005] have been implemented to solve the above optimization problems. Experimental results show that, performance metrics such as gained utility, response rate, and resource utilization are improved and resources are allocated in an optimal way.