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

• YAMAMOTO Hiroshi

  Department of Computer Science and Electronics, Kyushu Institute of Technology

• KAWAHARA Kenji

  Department of Computer Science and Electronics, Kyushu Institute of Technology

• TAKINE Tetsuya

  Department of Communication Engineering, Graduate School of Engineering, Osaka University

• OIE Yuji

  Department of Computer Science and Electronics, Kyushu Institute of Technology

Abstract

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.

Journal

• IEICE transactions on information and systems

  IEICE transactions on information and systems 89 (2), 459-467, 2006-02-01

  The Institute of Electronics, Information and Communication Engineers

Keywords

• grid computing
• distributed resource management
• task allocation scheme
• M
• G
• I-PS queue
• uneven resource utilization

Details

• CRID: 1571417126911899776
• NII Article ID: 110004719311
• NII Book ID: AA10826272
• ISSN: 09168532
• Text Lang: en
• Data Source:
  • CiNii Articles