Abstract
Our research is focused on keeping both local and parallel jobs together in a non-dedicated cluster or NOW (Network of Workstations) and efficiently scheduling them by means of coscheduling mechanisms. The performance of a good coscheduling policy can decrease drastically if memory requirements are not kept in mind. The overflow of the physical memory into the virtual memory usually provokes a severe performance penalty. A real implementation of a coscheduling technique for reducing the number of page faults across a non-dedicated Linux cluster is presented in this article. Our technique is based on knowledge of events obtained during execution, such as communication activity, page faults and memory size of every task. Its performance is analyzed and compared with other coscheduling algorithms. Topics: Cluster and Grid Computing, Distributed Computing
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
S. Setia, M. S. Squillante and V.K. Naik. “The Impact of Job Memory Requirements on Gang-Scheduling Performance”. In Performance Evaluation Review, 1999. 594
D. Burger, R. Hyder, B. Miller and D. Wood. “Paging Tradeoffs in Distributed Shared-Memory Multiprocessors”. Journal of Supercomputing, vol. 10, 1996. 594, 596
T. Anderson, D. Culler, D. Patterson and the Now team.“ A case for NOW (Networks of Workstations)”. IEEE Micro, 1995. 593
M. Litzkow, M. Livny and M. Mutka.“ Condor-A Hunter of Idle Workstations”. 8th Int’l Conference of Distributed Computing Systems, 1988. 593
R.H. Arpaci, A. C. Dusseau, A.M. Vahdat, L. T. Liu, T. E. Anderson and D.A. Patterson. “The Interaction of Parallel and Sequential Workloads on a Network of Workstations”. ACM SIGMETRICS’95, 1995. 593
J.K. Ousterhout. “Scheduling Techniques for Concurrent Systems.” In 3rd. Intl. Conf. Distributed Computing Systems, pp.22–30, 1982. 594
P.G. Sobalvarro and W.E. Weihl. “Demand-based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors”. IPPS’95 Workshop on Job Scheduling Strategies for Parallel Processing, 1995. 593, 594, 598
P.G. Sobalvarro, S. Pakin, W.E. Weihl and A.A. Chien. “Dynamic Coscheduling on Workstation Clusters”. IPPS’98 Workshop on Job Scheduling Strategies for Parallel Processing, 1998. 594, 597
F. Solsona, F. Giné, P. Hernández and E. Luque. “Implementing Explicit and Implicit Coscheduling in a PVM Environment”. 6th International Euro-Par Conference’ 2000, Lecture Notes in Computer Science, vol. 1900, 2000. 594
A. Batat and D.G. Feitelson. “Gang Scheduling with Memory Considerations”. Intl. Parallel and Distributed Processing Symposium, pp. 109–114, 2000. 594, 596
A.C. Arpaci-Dusseau, D.E. Culler and A.M. Mainwaring.“Scheduling with Implicit Information in Distributed Systems”. ACM SIGMETRICS’98, 1998. 594
D. Bovet and M. Cesati. “Understanding the Linux Kernel”. O'Reilly, 2001. 598
K.Y. Wang and D.C. Marinescu. “Correlation of the Paging Activity of Individual Node Programs in the SPMD Execution Model”. In 28th Hawaii Intl. Conf. System Sciences, vol. I, 1995. 594, 602
Parkbench Committee. Parkbench 2.0. http://www.netlib.org/parkbench, 1996. 601
F. Solsona, F. Giné, P. Hernández and E. Luque. “Predictive Coscheduling Implementation in a non-dedicated Linux Cluster”. 7th International Euro-Par Conference’2001, Lecture Notes in Computer Science, Vol. 2150, 2001. 594, 596, 598, 602
F. Giné, F. Solsona, P. Hernández and E. Luque. “Coscheduling Under Memory Constraints in a NOWEnvironment”. 7th Workshop on Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, Vol. 2221, 2001. 598
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
Giné, F., Solsona, F., Hernández, P., Luque, E. (2003). Minimizing Paging Tradeoffs Applying Coscheduling Techniques in a Linux Cluster. In: Palma, J.M.L.M., Sousa, A.A., Dongarra, J., Hernández, V. (eds) High Performance Computing for Computational Science — VECPAR 2002. VECPAR 2002. Lecture Notes in Computer Science, vol 2565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36569-9_40
Download citation
DOI: https://doi.org/10.1007/3-540-36569-9_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00852-1
Online ISBN: 978-3-540-36569-3
eBook Packages: Springer Book Archive