Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
An Online Scheduling Algorithm for Assigning Jobs in the Computational Grid Chuliang WENG Minglu LI Xinda LU Publication IEICE TRANSACTIONS on Information and Systems Vol.E89-D No.2 pp.597-604 Publication Date: 2006/02/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e89-d.2.597 Print ISSN: 0916-8532 Type of Manuscript: Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking) Category: Grid Computing Keyword: computational grid, scheduling algorithm, online scheduling, cost-based method, simulation, Full Text: PDF(697.7KB)>>
Summary: The computational grid provides a promising platform for the deployment of various high-performance computing applications. Problem in implementing computational grid environments is how to effectively use various resources in the system, such as CPU cycle, memory, communication network, and data storage. There are many effective heuristic algorithms for scheduling in the computational grid, however most scheduling strategies have no theoretical guarantee at all. In this paper, a cost-based online scheduling algorithm is presented for job assignment in the grid environment with theoretical guarantee. Firstly, a scheduling framework is described, where the grid environment is characterized, and the online job model is defined. Secondly, the cost-based online scheduling algorithm is presented where costs of resources are exponential functions of their loads, and the performance of this algorithm is theoretically analyzed against the performance of the optimal offline algorithm. Finally, we implement the algorithm in the grid simulation environment, and compare the performance of the presented algorithm with the other three algorithms, and experimental results indicate that the cost-based online scheduling algorithm can outperform the other three online algorithms. | ||||||||||
| ||||||||||