Abstract
Our research is focussed on keeping both local and parallel jobs together in a non-dedicated cluster and scheduling them efficiently. In such systems, the overflow of the physical memory into the virtual memory usually causes a severe performance penalty for distributed jobs. This impact can be reduced by means of giving more time slice length to parallel tasks in order better to exploit their memory reference locality. Thus, an algorithm is presented to adjust the length of the time slice dynamically to the necessity of the distributed and local tasks. It is implemented in a Linux cluster and evaluated with PVM jobs.
This work was supported by the MCyT under contract TIC 2001-2592 and partially supported by the Generalitat de Catalunya-Grup de Recerca Consolidat 2001SGR-00218.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Bovet and M. Cesati. “Understanding the Linux Kernel”. O’Reilly, 2001.
D. Burger, R. Hyder, B. Miller and D. Wood. “Paging Tradeoffs in Distributed Shared-Memory Multiprocessors”. Journal of Supercomputing, vol. 10, 1996.
F. Giné, F. Solsona, P. Hernández and E. Luque. ”Coscheduling Under Memory Constraints in a NOW Environment”. 7th Workshop on Job Scheduling Strategies for Parallel Processing, LNCS, Vol. 2221, 2001.
F. Giné, F. Solsona, X. Navarro, P. Hernández and E. Luque. “MemTo: A Memory Monitoring Tool for a Linux Cluster.” EuroPVM/MPI’2001, LNCS, vol. 2131, 2001.
S. Setia, M. S. Squillante and V. K. Naik. “The Impact of Job Memory Requirements on Gang-Scheduling Performance”. In Performance Evaluation Review, 1999.
F. Solsona, F. Giné, P. Hernández and E. Luque. ”Predictive Coscheduling Implementation in a non-dedicated Linux Cluster”. EuroPar’2001, LNCS, vol. 2150, 2001.
F. Solsona, F. Giné, P. Hernández and E. Luque. “Implementing Explicit and Implicit Coscheduling in a PVM Environment”. EuroPar’ 2000, LNCS, vol. 1900, 2000.
A. Yoo and M. Jette. “An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessors Clusters”. LNCS, vol. 2221, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giné, F., Solsona, F., Hernández, P., Luque, E. (2002). Adjusting the Lengths of Time Slices when Scheduling PVM Jobs with High Memory Requirements. In: Kranzlmüller, D., Volkert, J., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2002. Lecture Notes in Computer Science, vol 2474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45825-5_30
Download citation
DOI: https://doi.org/10.1007/3-540-45825-5_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44296-7
Online ISBN: 978-3-540-45825-8
eBook Packages: Springer Book Archive