Design and Implement a Job Assignment Policy in a Globus-Based Grid Computing Environment
Date Issued
2005
Date
2005
Author(s)
Yu, Tsung-Yuan
DOI
en-US
Abstract
Abstract
Globus alliance is a forum discussing how to make Grid environment come true. The purpose is to couple a variety of heterogeneous computational resources, storage systems, databases and other special purpose computing devices and present them as a unified integrated resource. According to the globus architecture, we focus on the Grid Resource Allocation Management (GRAM) Server and research in managing resources and providing fair Grid services. In this thesis, our research objectives are on (1) how to specify diversified computing requirements (2) how to provide fair services among jobs of different workload and (3) how to implement job assignment policy with GRAM on a simple prototype Globus grid computing environment.
In this site, the capabilities of hardware and software are the same. The GRAM function in globus defines jobs’ processing procedures patently, but it doesn’t define how to assign jobs to suitable computing nodes clearly. So we base on the processing procedures in GRAM and extend the ideas of Mor Harchol-Balte to the situation with workload estimation. Then the Resource Management Server (RMS) is designed for the architecture of separating queue management. In this architecture, the feasibility check module is first used, and it determines whether the job requests can be done or not on the foundation of jobs descriptions. Second, the compiler is operated and it estimates workload information. Finally, RMS puts jobs to appropriate queue waiting for processing; the step is based on the amount of workload information.
With job workload estimation available, we design a separating queue policy (SQP) by extending the Extend Task Assignment based on Guessing Size (ETAGS) algorithm. In SQP, we modify the waiting time analysis of ETAGS from sequential to independent analysis among groups and separate jobs in different groups according to different workload levels. We calculate the upper bound service time (threshold) based on known job workload distribution and M/M/c system standing on fairness definition. Simulation results show SQP outperforms ETAGS in shorter job waiting time and more balanced system load.
Finally we implement the SQP in a simple Globus-based GC Environment. The environment is built on Fedora Core 3 TM with Globus toolkit (GT) 4.0 installed on it. We install simple CA function to provide secure and warranting services. We install GRAM and GridFTP functions for transferring data and job processing. We build a client-server program with SQP. According to the SQP, jobs can be handled to suitable computing nodes.
Subjects
格網
網格
工作分配
Globus
Grid
Job Assignment:
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92921004-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):920a3c66cba4e6d359308b92018242c1