Performance comparison of process allocation schemes depending upon resource availability on grid computing environment

Authors:
Hiroshi Yamamoto;Kenji Kawahara;Tetsuya Takine;Yuji Oie
Affiliations:
Dept. of Computer Science and Electronics, Kyusyu Institute of Technology, Iizuka, Japan;Dept. of Computer Science and Electronics, Kyusyu Institute of Technology, Iizuka, Japan;Dept. of Applied Mathematics and Physics Graduate School of Informatics, Kyoto University, Kyoto, Japan;Dept. of Computer Science and Electronics, Kyusyu Institute of Technology, Iizuka, Japan
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Year:
2003

Citing 6
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
The network weather service: a distributed resource performance forecasting service for metacomputing

Future Generation Computer Systems - Special issue on metacomputing
The Globus Project: A Status Report

HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Master/Slave Computing on the Grid

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Grid Information Services for Distributed Resource Sharing

HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Improvements in the performance of end-computers and networks have recently made the construction of a grid system over the Internet feasible. A grid environment comprises many computers, each having a set of components and distinct performance, that 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 process schedulers. In the present study, as a preliminary theoretical investigation of the effect of such features on the performance of process schedulers, the average execution time of a long-lived process in the process allocation scheme employed in the decentralized environment is analytically derived using M/G/1-PS queues. The impact of the distribution of CPU utilization on the performance of these schemes is also investigated assuming CPU utilization for each computers in a grid environment follows a probability distribution function.