Abstract
When computing the makespan of a DAG, it is typically assumed that the tasks scheduled on the same computing node run in sequence. In reality, however, the tasks may be run in the time sharing manner. Our studies show that the discrepancy between the assumption of sequential execution and the reality of time sharing execution may lead to inaccurate calculation of the DAG makespan. In this paper, we first investigate the impact of the time sharing execution on the DAG makespan, and propose the method to model and determine the makespan with the time-sharing execution. Based on this model, we further develop the scheduling strategies for DAG jobs running in time-sharing. Extensive experiments have been conducted to verify the effectiveness of the proposed methods. The experimental results show that by taking time sharing into account, our DAG scheduling strategy can reduce the makespan significantly, comparing with its counterpart in sequential execution.
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
References
Zhang, X., Tune, E., Hagmann, R., Jnagal, R., Gokhale, V., Wilkes, J.: CPI2: CPU performance isolation for shared compute clusters, New York, NY, USA, pp. 379–391 (2013)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman, New York (2002)
Liao, Q., Jiang, S., Hei, Q., Li, T., Yang, Y.: Scheduling stochastic tasks with precedence constrain on cluster systems with heterogenous communication architecture. In: Wang, G., Zomaya, A., Perez, G.M., Li, K. (eds.) ICA3PP 2015. LNCS, vol. 9532, pp. 85–99. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27161-3_8
Wang, L., et al.: Energy-aware parallel task scheduling in a cluster. Future Gener. Comput. Syst. 29(7), 1661–1670 (2013). https://doi.org/10.1016/j.future.2013.02.010. ISSN: 0167-739X
Li, X., Zhao, Y., Li, Y., Ju, L., Jia, Z.: An improved energy-efficient scheduling for precedence constrained tasks in multiprocessor clusters. In: Sun, X., et al. (eds.) ICA3PP 2014. LNCS, vol. 8630, pp. 323–337. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11197-1_25
Liu, L., Zhang, M., Buyya, R., Fan, Q.: Deadline-constrained coevolutionary genetic algorithm for scientific workflow scheduling in cloud computing. Concurrency Comput. Pract. Exp. 29(5), e3942 (2017). https://doi.org/10.1002/cpe.3942
Maheshwari, K., Jung, E.S., Meng, J., Morozov, V., Vishwanath, V., Kettimuthu, R.: Workflow performance improvement using model-based scheduling over multiple clusters and clouds. Future Gener. Comput. Syst. 54, 206–218 (2016). https://doi.org/10.1016/j.future.2015.03.017. ISSN: 0167–739X
Chen, W., Xie, G., Li, R., Bai, Y., Fan, C., Li, K.: Efficient task scheduling for budget constrained parallel applications on heterogeneous cloud computing systems. Future Gener. Comput. Syst. 74, 1–11 (2017). https://doi.org/10.1016/j.future.2017.03.008. ISSN: 0167–739X
Hu, Y., Liu, C., Li, K., Chen, X., Li, K.: Slack allocation algorithm for energy minimization in cluster systems. Future Gener. Comput. Syst. 74, 119–131 (2017). https://doi.org/10.1016/j.future.2016.08.022. ISSN: 0167–739X
Canon, L.C., Philippe, L.: On the heterogeneity bias of cost matrices for assessing scheduling algorithms. IEEE Trans. Parallel Distrib. Syst. 28(6), 1675–1688 (2017). https://doi.org/10.1109/TPDS.2016.2629503
Wu, H., Hua, X., Li, Z., Ren, S.: Resource and instance hour minimization for deadline constrained DAG applications using computer clouds. IEEE Trans. Parallel Distrib. Syst. 27(3), 885–899 (2016). https://doi.org/10.1109/TPDS.2015.2411257
Xie, G., Xiao, X., Li, R., Li, K.: Schedule length minimization of parallel applications with energy consumption constraints using heuristics on heterogeneous distributed systems. Concurrency Comput. Pract. Exp. 29, e4024 (2016). https://doi.org/10.1002/cpe.4024
Oxley, M.A., et al.: Makespan and energy robust stochastic static resource allocation of a bag-of-tasks to a heterogeneous computing system. IEEE Trans. Parallel Distrib. Syst. 26(10), 2791–2805 (2015). https://doi.org/10.1109/TPDS.2014.2362921
Li, D., Chen, C., Guan, J., Zhang, Y., Zhu, J., Yu, R.: DCloud: deadline-aware resource allocation for cloud computing jobs. IEEE Trans. Parallel Distrib. Syst. 27(8), 2248–2260 (2016). https://doi.org/10.1109/TPDS.2015.2489646
https://confluence.pegasus.isi.edu/display/pegasus/CyberShake
https://confluence.pegasus.isi.edu/display/pegasus/Epigenomics
https://confluence.pegasus.isi.edu/display/pegasus/LIGO+Inspiral
Juve, G., Chervenak, A., Deelman, E., Bharathi, S., Mehta, G., Vahi, K.: Characterizing and profiling scientific workflows. Future Gener. Comput. Syst. 29(3), 682–692 (2013). https://doi.org/10.1016/j.future.2012.08.015. ISSN: 0167–739X
Bharathi, S., Chervenak, A., Deelman, E., et al.: Characterization of scientific workflows. In: Third Workshop on Workflows in Support of Large-Scale Science, WORKS 2008, pp. 1–10. IEEE (2008)
Rasley, J., Karanasos, K., Kandula, S., Fonseca, R., Vojnovic, M., Rao, S.: Efficient queue management for cluster scheduling. In: Proceedings of the Eleventh European Conference on Computer Systems (EuroSys 2016), New York, NY, USA, Article 36, 15 p. ACM (2016)
Boutin, E., et al.: Apollo: scalable and coordinated scheduling for cloud-scale computing. In: OSDI (2014)
Karanasos, K., et al.: Mercury: hybrid centralized and distributed scheduling in large shared clusters. In: USENIX. ATC (2015)
Ousterhout, K., Wendell, P., Zaharia, M., Stoica, I.: Sparrow: distributed, low latency scheduling. In: SOSP (2013)
Vavilapalli, V.K., et al.: Apache hadoop YARN: yet another resource negotiator. In: SoCC (2013)
Verma, A., Pedrosa, L., Korupolu, M., Oppenheimer, D., Tune, E., Wilkes, J.: Large-scale cluster management at Google with Borg. In: EuroSys (2015)
Chen, C., He, L., Chen, H., Sun, J., Gao, B., Jarvis, S.A.: Developing communication-aware service placement frameworks in the cloud economy. In: 2013 IEEE International Conference on Cluster Computing (CLUSTER), Indianapolis, IN, pp. 1–8 (2013). https://doi.org/10.1109/CLUSTER.2013.6702668
Acknowledgement
This work is supported by China Scholarship Council.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Ren, S., He, L., Li, J., Chen, C., Gu, Z., Chen, Z. (2018). Scheduling DAG Applications for Time Sharing Systems. In: Vaidya, J., Li, J. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2018. Lecture Notes in Computer Science(), vol 11335. Springer, Cham. https://doi.org/10.1007/978-3-030-05054-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-05054-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05053-5
Online ISBN: 978-3-030-05054-2
eBook Packages: Computer ScienceComputer Science (R0)