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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Foster and C. Kesselman, The GRID Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers, 1998.
I. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid”, International Journal of Supercomputer Applications, Vol. 15, Num. 3, 2001.
I. Foster and C. Kesselman, “The Globus Project: A Status Report”, Proc. of IPPS/SPDP’ 98 Heterogeneous Computing Workshop, pp. 4–18, 1998.
The Globus Project, http://www.globus.org/.
K. Czajkowski, S. Fitzgerald, I. Foster, and C. Kesselman, “Grid Information Services for Distributed Resource Sharing”, Proc. of the Tenth IEEE International Symposium on High-Performance Distributed Computing (HPDC-10), IEEE Press, August 2001.
E. Heymann, M. A. Senar, E. Luque, and M. Livny, “Adaptive Scheduling for Master-Worker Applications on the Computational Grid”, Proc. of the First International Workshop on Grid Computing (GRID 2000), Bangalore, India, December 2000.
G. Shao, F. Berman, and R. Wolski, “Master/Slave Computing on the Grid”, Proc. of 9th Heterogeneous Computing Workshop, Cancun, Mexico, pp. 3–16, May 2000.
R. Wolski, N. T. Spring, and J. Hayes, “The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing”, Journal of Future Generation Computing Systems, Vol. 15, Num. 5–6, pp. 757–768, October 1999.
S. Gullapalli, K. Czajkowski, C. Kesselman, and S. Fitzgerald, “Grid Notification Framework (VB0.1)”, Grid Forum Working Draft GWD-GIS-019, http://www.gridforum.org, June 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, H., Kawahara, K., Takine, T., Oie, Y. (2003). Performance Comparison of Process Allocation Schemes Depending upon Resource Availability on Grid Computing Environment. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44862-4_27
Download citation
DOI: https://doi.org/10.1007/3-540-44862-4_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40195-7
Online ISBN: 978-3-540-44862-4
eBook Packages: Springer Book Archive