Abstract
Among many attempts to design DAG scheduling algorithms that would face grid environment requirements, the strategy of number of eligible jobs maximization seems promising. Therefore, this paper presents the results of thorough analysis and evaluation of this strategy and its implementation called PRIO. We have analysed a large space of random DAGs and various resources parameters to compare results of PRIO algorithm with standard critical path length prioritization, FIFO prioritization as well as with quasi-optimal solution. Results of this comparison, in terms of the makespan and robustness, are supplemented by a theoretical and specific case analysis. We conclude with an assessment of usefulness of the current implementation of eligible jobs maximization strategy.
Chapter PDF
Similar content being viewed by others
References
You, S.Y., Kim, H.Y., Hwang, D.H., Kim, S.C.: Task Scheduling Algorithm in GRID Considering Heterogeneous Environment. In: Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2004, Nevada, USA, June 2004, pp. 240–245 (2004)
Ma, T., Buyya, R.: Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids. In: Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing, Rio de Janeiro, Brazil (October 2005)
Malewicz, G., Rosenberg, A., Yurkewych, M.: Towards a Theory for Scheduling Dags in Internet-Based Computing. IEEE Transactions on Computers 55(6), 757–768 (2006)
Rosenberg, A.L.: On scheduling mesh-structured computations for Internet-based computing. IEEE Trans. Comput. 53, 1176–1186 (2004)
Rosenberg, A.L., Yurkewych, M.: Guidelines for scheduling some common computation-dags for Internet-based computing. IEEE Trans. Comput. 54, 428–438 (2005)
Cordasco, G., Malewicz, G., Rosenberg, A.L.: Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. IEEE TPDS 18(11) (November 2007) ISSN: 1045-9219
Malewicz, G., Foster, I., Rosenberg, A., Wilde, M.: A Tool for Prioritizing DAGMan Jobs and Its Evaluation. In: 15th IEEE International Symposium on High Performance Distributed Computing (HPDC-15), pp. 156–167 (2006)
Dong, F., Akl, S.G.: Scheduling Algorithms for Grid Computing: State of the Art and Open Problems. Technical Report of Queen’s University School of Computing, 2006-504 (January 2006)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE Transactions on Parallel and Distributed Systems 13(3), 260–274 (2002)
Radulescu, A., van Gemund, A.J.C.: On the Complexity of List Scheduling Algorithms for Distributed Memory Systems. In: Proc. of 13th International Conference on Supercomputing, Portland, Oregon, USA, ovember 1999, pp. 68–75 (1999)
Shi, Z., Dongarra, J.J.: Scheduling workflow applications on processors with different capabilities. Future Generation Computer Systems 22(6), 665–675 (2006)
Sakellariou, R., Zhao, H.: A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In: Proc. of 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, New Mexico USA, April 2004, pp. 111–123 (2004)
Zhao, H., Sakellariou, R.: An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 189–194. Springer, Heidelberg (2003)
Dong, F., Akl, S.G.: A Joint Data and Computation Scheduling Algorithm for the Grid. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 587–597. Springer, Heidelberg (2007)
Wordwide LHC Grid Computing. Web page: http://lcg.web.cern.ch/LCG/
Daggen – Synthetic DAG Generation. http://www.loria.fr/~suter/dags.html
Canon., L.C., Jeannot, E.: A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems. In: 6th Int. Workshop on Algorithms, Models and Tools – HeteroPar 2007, Austin (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szepieniec, T., Bubak, M. (2008). Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2008. ICCS 2008. Lecture Notes in Computer Science, vol 5101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69384-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-69384-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69383-3
Online ISBN: 978-3-540-69384-0
eBook Packages: Computer ScienceComputer Science (R0)