Abstract
In this paper, we present a framework for exploiting resources in Networks of Workstations (NOWs) and Clusters of Processors (COPs), in order to run multiple parallel adaptive applications. Adaptive model includes parallel applications capable to adapt their parallelism degree dynamically following availability of resources and changes in the underlying environment’s state. Within the framework of the proposed environment, many components are developed. This includes fault tolerance, adaptive application building and scheduling and multi-application scheduling. In this paper, we focus our study on the multi-application scheduling problem. In the proposed multi-application scheduling model, each parallel adaptive application is controlled by its own scheduler, responsible for optimizing resources used by the application. A dynamic multi-application scheduler supervises all the applications and shares resources fairly among them, by means of a combined (time-sharing and space-sharing) scheduling algorithm.
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
J. Ousterhout, D. Scelza, and P. Sindhu. Medusa: An experiment in distributed operating system structure. Communications of the ACM, 23(2):92–105, Feb 1980.
J. Skovira, W. Chan, H. Zhou, and D. Lifka. The easy-LoadLeveler API project. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162. Springer Verlag, 1996.
B.B. Zhou, P. Mackerras, C.W. Johnson, D. Walsh, and R.P. Brent. An efficient resource allocation scheme for gang scheduling. In IEEE International Workshop on Cluster Computing, pages 187–194, Melbourne, Australia, Dec 1999.
K. Al-Saqabi, R. M. Proutty, D. McNamee, S. W. Otto, and J. Walpole. Dynamic load distribution in MIST. In International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, Nevada, USA, Jun 1997.
D. Gelernter, M. Jourdenais, and D. Kaminsky. Piranha scheduling: Strategies and their implementation. Technical Report 983, Department of Computer Science, Yale University, Sep 1993.
P. G. Raverdy. Resource management and load balancing in large scale heterogeneous systems: Application to mobile and parallel environments. PhD thesis, University of Paris 6, 1996.
D. L. Kaminsky. Adaptive Parallelism with Piranha. PhD thesis, Yale University, 1994.
J. Pruyne and M. Livny. Interfacing Condor and PVM to harness the cycles of workstation clusters. Journal on Future Generations of Computer Systems, 12, 1996.
E-G. Talbi, J-M. Geib, Z. Hafidi, and D. Kebbal. High Performance Cluster Computing, volume I: Architectures and Systems, chapter MARS: An adaptive parallel programming environment, pages 722–739. Prentice-Hall, 1999.
D. Kebbal, E-G. Talbi, and J-M. Geib. Building and scheduling parallel adaptive applications in heterogeneous environments. In IEEE International Workshop on Cluster Computing, pages 195–201, Melbourne, Australia, Dec 1999.
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
Kebbal, D., Talbi, EG., Geib, JM. (2002). Multi-application Scheduling in Networks of Workstations and Clusters of Processors. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds) Advanced Environments, Tools, and Applications for Cluster Computing. IWCC 2001. Lecture Notes in Computer Science, vol 2326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47840-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-47840-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43672-0
Online ISBN: 978-3-540-47840-9
eBook Packages: Springer Book Archive