Abstract
Clusters and computational grids are opened environments on which a great number of different users can submit computational requests. Some privileged users may have strong Quality of Service requirements whereas others may be less demanding. Common mapping algorithms are not well suited to guarantee a defined quality of service, they propose at best priority systems in order to favour some applications without any guaranty. We propose a new mapping algorithm, dealing with the notion of quality of service for scheduling applications over clusters and grids over different classes of service.
This algorithm uses information on the application to map, all the unfinished applications previously mapped, the state of the execution support, and the processor access model (round robin model) to suggest a mapping which guarantees all the expressed constraints. The mapping decision is taken on-line based on the release date of all applications and the memory space used. To finish, the validation of the algorithm is performed with real log files entries simulated with Simgrid.
Chapter PDF
Similar content being viewed by others
References
Smith, W., Foster, I., Taylor Scheduling, V.: with advanced reservations. In: Proceeding of the IPDPS Conference (May 2000)
Feitelson, D.G., Jette, M.A.: Improved utilization and responsiveness with gang scheduling. In: Proceeding JSSPP 1997,Job scheduling strategies for parallel processing, IPPS 1997 workshop, Geneva, Switerlang, pp. 238–261 (1997)
Zotkin, D., Keleher Job-length, P.J.: Estimation and performance in backfilling schedulers. In: 8th Intl Symp. High Performance Distributed Comput (August 1999)
Bacquet, P., Brun, O., Garcia, J.M., Monteil, T., Pascal, P., Richard, S.: Telecommunication network modeling and planning tool on ASP clusters. In: Proceedings of the International Conference on Computational Science (ICCS 2003) Melbourne, Australia, June 2-4 (2003)
Takefusa, A., Matsuoka, S., Casanova, H., Berman, F.: A study of deadline scheduling for client-server systems on the computational grid. In: Proceedings of the Tenth IEEE Symposium on High Performance Distributed Computing (HPDC10) San Francisco, California, August 7-9 (2001)
Buyya, R.: Economic-based distributed resource management and scheduling for grid computing. Thesis (April 2002)
Casavant, T.L., Kuhl, J.G.: Effects of Response and Stability on scheduling in distributed computing systems. IEEE Transactions on software engineering 14(11), 1578–1588 (1988)
Chow, Y.C., Kohler, W.H.: Models for dynamic load balancing in a heterogeneous multiple processor system. IEEE Transactions on computers c-28(5), 354–361 (1979)
Lee, C.Y.: Parallel machines scheduling with non simultaneous machine available time. Discrete Applied Mathematic North-Holland 30, 53–61 (1991)
Bonomi, F., Kumar, A.: Adaptative optimal load balancing in a non homogeneous multiserver system with a central job scheduler. IEEE Transactions on computers 39(10), 1232–1250 (1990)
Casanova, H., Legrand, A.: L. Marchal Scheduling Distributed Applications: the SimGrid Simulation Framework. In: Proceedings of the third IEEE International Symposium on Cluster Computing and the Grid (CCGrid (2003)
Pascal, P., Monteil, T.: Influence of Deterministic Customers in Time Sharing Scheduler. ACM Operating Systems Review 37(1), 34–45 (2003)
http://www.cs.huji.ac.il/labs/parallel/workload/logs.htmlsdscsp2
Kingsbury, B.: The network queuing system , May 16 (1998), http://pom.ucsf.edu/srp/batch/sterling/READMEFIRST.txt
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pascal, P., Richard, S., Miegemolle, B., Monteil, T. (2005). Tasks Mapping with Quality of Service for Coarse Grain Parallel Applications. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_33
Download citation
DOI: https://doi.org/10.1007/11549468_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)