Skip to main content

Advertisement

Log in

Grid Scheduling Considering Energy Consumption Management and Quality of Service

  • Published:
Journal of Grid Computing Aims and scope Submit manuscript

Abstract

In this research, the grid scheduling problem has been investigated in order to maximize profit considering the dynamic voltage and frequency scaling technique, customer-centric quality of service and time-dependent energy pricing. Mixed-integer linear programming, constraint programming, a greedy heuristic algorithm along with a hybrid method of genetic algorithm and constraint programming are developed. Some techniques are proposed to improve the efficiency of the presented constraint programming model, and their effectiveness is investigated using a full factorial experiment. Parameters of the proposed hybrid algorithm have been set by Taguchi test. The hybrid meta-heuristic algorithm, with a short execution time, generates solutions of about 18% and 88% better than the best solution of the constraint programming model for large-scale problem instances. The results show that the final profit will be reduced by about 22% if the electricity prices are wrongly considered with a flat rate during the scheduling process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data Availability

All data generated or analysed during this study are included in this published article.

References

  1. Tang, Z., Qi, L., Cheng, Z., Li, K., Khan, U.S.: An energy-efficient task scheduling algorithm in DVFS-enabled cloud environment. J. Grid. Comput. 4(1), 55–74 (2016). https://doi.org/10.1007/s10723-015-9334-y

    Article  Google Scholar 

  2. Geetha, P., Robin, R.: A novel approach of resource scheduling algorithm to improve QoS in green cloud computing. In: Jeena Jacob, I., Kolandapalayam Shanmugam, S., Piramuthu, S., Falkowski-Gilski, P. (eds). Data Intelligence and Cognitive Informatics, pp. 207–221. Springer, Singapore (2021)

  3. Sohaib Ajmal, M., Iqbal, Z., Zeeshan Khan, F., Bilal, M., Majid Mehmood, R.: Cost-based energy efficient scheduling technique for dynamic voltage and frequency scaling system in cloud computing. Sustain. Energy Technol. Assess. 45, 101210 (2021). https://doi.org/10.1016/j.seta.2021.101210

    Article  Google Scholar 

  4. Abdel-Basset, M., El-Shahat, D., Deb, K., Abouhawwash, M.: Energy-aware whale optimization algorithm for real-time task scheduling in multiprocessor systems. Appl. Soft Comput. 93, 106349 (2020). https://doi.org/10.1016/j.asoc.2020.106349

    Article  Google Scholar 

  5. Hassan, H.A., Salem, S.A., Saad, E.M.: A smart energy and reliability aware scheduling algorithm for workflow execution in DVFS-enabled cloud environment. Futur. Gener. Comput. Syst. 112, 431–448 (2020). https://doi.org/10.1016/j.future.2020.05.040

    Article  Google Scholar 

  6. Nejat, M., Manivannan, M., Pericàs, M., Stenström, P.: Coordinated management of DVFS and cache partitioning under QoS constraints to save energy in multi-core systems. J. Parallel Distrib. Comput. 144, 246–259 (2020). https://doi.org/10.1016/j.jpdc.2020.05.006

    Article  Google Scholar 

  7. Yue, S., Ma, Y., Chen, L., Wang, Y., Song, W.: Dynamic DAG scheduling for many-task computing of distributed eco-hydrological model. J. Supercomput. (2017). https://doi.org/10.1007/s11227-017-2047-1

  8. Kalra, M., Singh, S.: Multi-criteria workflow scheduling on clouds under deadline and budget constraints. Concurr. Comput. Pract. Exp. 31(17), e5193 (2019)

    Article  Google Scholar 

  9. Chunlin, L., Jianhang, T., Youlong, L.: Hybrid cloud adaptive scheduling strategy for heterogeneous workloads. J. Grid Comput. 17(4), 1–28 (2019)

    Google Scholar 

  10. Younis, M.T., Yang, S.: Hybrid meta-heuristic algorithms for independent job scheduling in grid computing. Appl. Soft Comput. 72, 498–517 (2018)

    Article  Google Scholar 

  11. Grange, L., Da Costa, G., Stolf, P.: Green IT scheduling for data center powered with renewable energy. Futur. Gener. Comput. Syst. 86, 99–120 (2018)

    Article  Google Scholar 

  12. Zhang, Y., Cheng, X., Chen, L., Shen, H.: Energy-efficient tasks scheduling heuristics with multi-constraints in virtualized clouds. J. Grid Comput. 16(3), 459–475 (2018)

    Article  Google Scholar 

  13. Safari, M., Khorsand, R.: Energy-aware scheduling algorithm for time-constrained workflow tasks in DVFS-enabled cloud environment. Simul. Model. Pract. Theory. 87, 311–326 (2018)

    Article  Google Scholar 

  14. Shu, T., Wu, C.Q.: Energy-efficient mapping of large-scale workflows under deadline constraints in big data computing systems. Futur. Gener. Comput. Syst. 110, 515–530 (2020)

    Article  Google Scholar 

  15. Sanjeevi, P., Viswanathan, P.: NUTS scheduling approach for cloud data centers to optimize energy consumption. Computing. 99(12), 1179–1205 (2017). https://doi.org/10.1007/s00607-017-0559-4

    Article  Google Scholar 

  16. Zhang, L., Li, K., Li, C., Li, K.: Bi-objective workflow scheduling of the energy consumption and reliability in heterogeneous computing systems. Inf. Sci. 379, 241–256 (2017). https://doi.org/10.1016/j.ins.2016.08.003

    Article  Google Scholar 

  17. Xiao, P., Hao, Z.: Improving energy-efficiency of large-scale workflows in heterogeneous systems. Int. J. Comput. Sci. Eng. 13(3), 258–267 (2016)

    Google Scholar 

  18. Garg, R., Singh, A.K.: Energy-aware workflow scheduling in grid under QoS constraints. Arab. J. Sci. Eng. 41(2), 495–511 (2016). https://doi.org/10.1007/s13369-015-1705-y

    Article  Google Scholar 

  19. Kaushik, A., Vidyarthi, D.P.: An energy-efficient reliable grid scheduling model using NSGA-II. Eng. Comput. 32(3), 355–376 (2016). https://doi.org/10.1007/s00366-015-0419-9

    Article  Google Scholar 

  20. Su, S., Huang, Q., Li, J., Cheng, X., Xu, P., Shuang, K.: Enhanced energy-efficient scheduling for parallel tasks using partial optimal slacking. Comput. J. 58(2), 246–257 (2014). https://doi.org/10.1093/comjnl/bxu002

    Article  Google Scholar 

  21. Kaushik, A., Vidyarthi, D.P.: A green energy model for resource allocation in computational grid. Comput. J. 58(7), 1530–1547 (2014). https://doi.org/10.1093/comjnl/bxu074

    Article  Google Scholar 

  22. Singh, S., Chana, I.: QRSF:QoS-aware resource scheduling framework in cloud computing. J. Supercomput. 71(1), 241–292 (2015). https://doi.org/10.1007/s11227-014-1295-6

    Article  Google Scholar 

  23. Kianfar, K., Moslehi, G., Yahyapour, R.: A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems. J. Supercomput. 71(3), 1143–1162 (2015). https://doi.org/10.1007/s11227-014-1358-8

    Article  Google Scholar 

  24. Nesmachnow, S., Dorronsoro, B., Pecero, E.J., Bouvry, P.: Energy-aware scheduling on multicore heterogeneous grid computing systems. J. Grid Comput. 11(4), 653–680 (2013). https://doi.org/10.1007/s10723-013-9258-3

    Article  Google Scholar 

  25. Yassa, S., Chelouah, R., Kadima, H., Granado, B.: Multi-objective approach for energy-aware workflow scheduling in cloud computing environments. Sci.World J. 2013, (2013). https://doi.org/10.1155/2013/350934

  26. Jiang, J., Lin, Y., Xie, G., Fu, L., Yang, J.: Time and energy optimization algorithms for the static scheduling of multiple workflows in heterogeneous computing system. J. Grid Comput. 15(4), 435–456 (2017). https://doi.org/10.1007/s10723-017-9391-5

    Article  Google Scholar 

  27. Copyright © 2022 Minitab, L.A.r.R.: Taguchi designs. https://support.minitab.com/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kamran Kianfar.

Ethics declarations

Conflict of Interest

The authors declare that they have no conflict of interest.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix 1: Proof of the Lemma

Appendix 1: Proof of the Lemma

Assume that for the set of accepted tasksIaccepted, the value of the objective function is \({objective}^{I^{accepted}}\). Suppose task i is out of the set of accepted tasks and the other tasks are performed on their former resource, VF level and time. Define the value of the objective function as \({objective}^{I^{accepted\backslash \left\{i\right\}}}\) in this case. Here, the revenue from performing task i, which is equal to \(\min \left\{{B}_i,{B}_i-{U}_i\left({t}_i+{ETT}_{i,{r}_i,{k}_i}-{D}_i\right)\right\}\), is deducted from the objective function, and the revenue from performing other tasks does not change. The power consumption of resource ri in interval \(\left[{t}_i,{t}_i+{ETT}_{i,{r}_i,{k}_i}-1\right]\) source changes from \({P}_{r_i,{k}_i}\) to \({P}_{r_i}^{sleep}\). So, the power consumption cost of this resource is reduced by \(\sum_{s={t}_i}^{t_i+{ETT}_{i,{k}_i}-1}{C}_s\times \left({P}_{r_i,{k}_i}-{P}_{r_i}^{sleep}\right)\). The power consumption of other resources does not change and the related cost does not change as well. According to this, eq. (59) is established between \({objective}^{I^{accepted}}\) and \({objective}^{I^{accepted\backslash \left\{i\right\}}}\).

$${objective}^{I^{accepted}}-{objective}^{I^{accepted\backslash \left\{{i}_1\right\}}}=\min \left\{{B}_{i_1},{B}_{i_1}-{U}_{i_1}\left({t}_{i_1}+{ETT}_{i_1,{r}_{i_1},{k}_{i_1}}-{D}_i\right)\right\}-\sum_{s={t}_{i_1}}^{t_{i_1}+{ETT}_{i_1,{r}_{i_1},{k}_{i_1}}-1}{C}_s\left({P}_{r_{i_1},{k}_{i_1}}-{P}_{r_{i_1}}^{sleep}\right)={Profit}_{i_1,{r}_{i_1},{k}_{i_1},{t}_{i_1}}$$
(59)

According to (59), it can be easily seen that the following equation holds.

$$\left\{\begin{array}{c}{objective}^{I^{accepted}}-{objective}^{I^{accepted\backslash \left\{{i}_1\right\}}}={Profit}_{i_1,{r}_{i_1},{k}_{i_1},{t}_{i_1}}\kern4.75em \\ {}{objective}^{I^{accepted\backslash \left\{{i}_1\right\}}}-{objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2\right\}}}={Profit}_{i_2,{r}_{i_2},{k}_{i_2},{t}_{i_2}}\kern2.5em \\ {}{objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2\right\}}}-{objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2,{i}_3\right\}}}={Profit}_{i_3,{r}_{i_3},{k}_{i_3},{t}_{i_3}}\kern1em \\ {}\vdots \\ {}{objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2,\dots, {i}_{n-1}\right\}}}-{objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2,\dots, {i}_{n-1},{i}_n\right\}}}\kern5.5em \\ {}\kern23.25em ={Profit}_{i_n,{r}_{i_n},{k}_{i_n},{t}_{i_n}}\end{array}\right.$$
(60)

By adding the expressions in (60), the following equation will be obtained.

$${objective}^{I^{accepted}}-{objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2,\dots, {i}_{n-1},{i}_n\right\}}}=\sum_{i\in {I}^{accepted}}{Profit}_{i,{r}_i,{k}_i,{t}_i}$$
(61)

Note that \({objective}^{I^{accepted\backslash \left\{{i}_1,{i}_2,\dots, {i}_{n-1},{i}_n\right\}}}={objective}^{\varnothing }\) where objective is the value of the objective function in the mode of not accepting any tasks. Since no task is accepted in objective, all resources will be idle, and the value of objective can be expressed as the following equation.

$${objective}^{\varnothing }=-\sum_{r\in R}{cost}_r^{idle}$$
(62)

By combining (61) and (62), Eq. (52) is proved.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Esmaili, S., Kianfar, K. Grid Scheduling Considering Energy Consumption Management and Quality of Service. J Grid Computing 20, 30 (2022). https://doi.org/10.1007/s10723-022-09620-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10723-022-09620-3

Keywords

Navigation