Abstract
In this paper, we investigate the use of application-specific hints when scheduling jobs on a Computational Grid, as these jobs can expose widely differing characteristics regarding CPU and I/O requirements. Specifically, we consider hints that specify the relative importance of network and computational resources w.r.t. their influence on the associated application’s performance. Using our ns-2 based Grid Simulator (NSGrid), we compare schedules that were produced by taking application-specific hints into account to schedules produced by applying the same strategy for all jobs. The results show that better schedules can be obtained when using these scheduling hints intelligently.
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
Buyya, R., Murshed, M.: GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing. The Journal of Concurrency and Computation: Practice and Experience (CCPE), Wiley Press (2002)
Legrand, A., Marchal, L., Casanova, H.: Scheduling Distributed Applications: the SimGrid Simulation Framework. In: Proc. of CCGrid 2003, pp. 138–145 (2003)
Volckaert, B., Thysebaert, P., De Turck, F., Dhoedt, B., Demeester, P.: Evaluation of Grid Scheduling Strategies through a Network-aware Grid Simulator. In: Proc. of PDPTA 2003, pp. 30–35 (2003)
The Network Simulator - NS2. website, http://www.isi.edu/nsnam/ns
Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and Practice in Parallel Job Scheduling, Job Scheduling Strategies for Parallel Processing, pp. 1–34 (1997)
Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to Minimize Average Completion Time: Off-line and On-line Approximation Algorithms. Mathematics of Operations Research 22(3), 513–544 (1997)
Ranganathan, K., Foster, I.: Simulation Studies of Computation and Data Scheduling Algorithms for Data Grids. Journal of Grid Computing 1(1), 53–62 (2003)
Gehring, J., Reinfeld, A.: Mars - a framework for minimizing the job execution time in a metacomputing environment. In: Proc. of Future General Computer Systems 1996 (1996)
Berman, F., Wolski, R., Figueira, S., Schopf, J., Shao, G.: Application-Level Scheduling on Distributed Heterogeneous Networks. In: Proc. of SuperComputing 1996 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Volckaert, B., Thysebaert, P., De Turck, F., Dhoedt, B., Demeester, P. (2004). Application-Specific Hints in Reconfigurable Grid Scheduling Algorithms. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24688-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-24688-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22116-6
Online ISBN: 978-3-540-24688-6
eBook Packages: Springer Book Archive