Performance Comparison of Task Allocation Schemes Depending upon Resource Availability in a Grid Computing Environment

Hiroshi YAMAMOTO  Kenji KAWAHARA  Tetsuya TAKINE  Yuji OIE  

IEICE TRANSACTIONS on Information and Systems   Vol.E89-D   No.2   pp.459-468
Publication Date: 2006/02/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.2.459
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking)
Category: Performance Evaluation
grid computing,  distributed resource management,  task allocation scheme,  M/G/1-PS queue,  uneven resource utilization,  

Full Text: PDF(818KB)>>
Buy this Article

Recent improvements in the performance of end-computers and networks have made it feasible to construct a grid system over the Internet. A grid environment consists of many computers, each having a set of components and a distinct performance. These computers are shared among many users and managed in a distributed manner. Thus, it is important to focus on a situation in which the computers are used unevenly due to decentralized management by different task schedulers. In this study, which is a preliminary investigation of the performance of task allocation schemes employed in a decentralized environment, the average execution time of a long-lived task is analytically derived using the M/G/1-PS queue. Furthermore, assuming a more realistic condition, we evaluate the performance of some task allocation schemes adopted in the analysis, and clarify which scheme is applicable to a realistic grid environment.