The Journal of Supercomputing

, Volume 73, Issue 2, pp 756–781 | Cite as

CCA: a deadline-constrained workflow scheduling algorithm for multicore resources on the cloud

  • Arash Deldari
  • Mahmoud NaghibzadehEmail author
  • Saeid Abrishami


Workflows are adopted as a powerful modeling technique to represent diverse applications in different scientific fields as a number of loosely coupled tasks. Given the unique features of cloud technology, the issue of cloud workflow scheduling is a critical research topic. Users can utilize services on the cloud in a pay-as-you-go manner and meet their quality of service (QoS) requirements. In the context of the commercial cloud, execution time and especially execution expenses are considered as two of the most important QoS requirements. On the other hand, the remarkable growth of multicore processor technology has led to the use of these processors by Infrastructure as a Service cloud service providers. Therefore, considering the multicore processing resources on the cloud, in addition to time and cost constraints, makes cloud workflow scheduling even more challenging. In this research, a heuristic workflow scheduling algorithm is proposed that attempts to minimize the execution cost considering a user-defined deadline constraint. The proposed algorithm divides the workflow into a number of clusters and then an extendable and flexible scoring approach chooses the best cluster combinations to achieve the algorithm’s goals. Experimental results demonstrate a great reduction in resource leasing costs while the workflow deadline is met.


Cloud computing Infrastructure as a service Workflow scheduling Multicore processors Clustering Scoring 


  1. 1.
    Abrishami S, Naghibzadeh M, Epema DHJ (2012) Cost-driven scheduling of grid workflows using partial critical paths. Parallel Distrib Syst IEEE Trans 23(8):1400–1414CrossRefGoogle Scholar
  2. 2.
    Bittencourt LF, Madeira ERM (2011) HCOC: a cost optimization algorithm for workflow scheduling in hybrid clouds. J Internet Serv Appl 2(3):207–227CrossRefGoogle Scholar
  3. 3.
    Naghibzadeh M (2016) Modeling and scheduling hybrid workflows of tasks and task interaction graphs on the cloud. Future Gen Comput Syst 65. doi: 10.1016/j.future.2016.05.029
  4. 4.
    Deelman E, Singh G, Su M-H, Blythe J, Gil Y, Kesselman C, Mehta G, Vahi K, Berriman GB, Good J (2005) Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Sci Progr 13(3):219–237Google Scholar
  5. 5.
    Berman F, Casanova H, Chien A, Cooper K, Dail H, Dasgupta A, Deng W, Dongarra J, Johnsson L, Kennedy K (2005) New grid scheduling and rescheduling methods in the GrADS project. Int J Parallel Progr 33(2–3):209–229CrossRefGoogle Scholar
  6. 6.
    Wieczorek M, Prodan R, Fahringer T (2005) Scheduling of scientific workflows in the ASKALON grid environment. ACM SIGMOD Rec 34(3):56–62CrossRefGoogle Scholar
  7. 7.
    Abrishami S, Naghibzadeh M, Epema DHJ (2013) Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Future Gen Comput Syst 29(1):158–169CrossRefGoogle Scholar
  8. 8.
    Abraham A, Buyya R, Nath B (2000) Nature’s heuristics for scheduling jobs on computational grids. In: The 8th IEEE international conference on advanced computing and communications (ADCOM 2000), pp 45–52Google Scholar
  9. 9.
    Aggarwal AK, Kent RD (2005) An adaptive generalized scheduler for grid applications. In: 19th International symposium on, high performance computing systems and applications, HPCS 2005, pp 188–194Google Scholar
  10. 10.
    Chang V (2014) An introductory approach to risk visualization as a service. Open J Cloud Comput 1:1–9CrossRefGoogle Scholar
  11. 11.
    Chang V (2014) The business intelligence as a service in the cloud. Future Gen Comput Syst 37:512–534CrossRefGoogle Scholar
  12. 12.
    Arabnejad H, Barbosa JG (2014) A budget constrained scheduling algorithm for workflow applications. J Grid Comput 12(4):665–679CrossRefGoogle Scholar
  13. 13.
    Dougan A, Özgüner F (2005) Biobjective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems. Comput J 48(3):300–314CrossRefGoogle Scholar
  14. 14.
    Singh G, Kesselman C, Deelman E (2007) A provisioning model and its comparison with best-effort for performance-cost optimization in grids. In: Proceedings of the 16th international symposium on high performance distributed computing, pp 117–126Google Scholar
  15. 15.
    Su S, Li J, Huang Q, Huang X, Shuang K, Wang J (2013) Cost-efficient task scheduling for executing large programs in the cloud. Parallel Comput 39(4):177–188CrossRefGoogle Scholar
  16. 16.
    Szabo C, Kroeger T (2012) Evolving multi-objective strategies for task allocation of scientific workflows on public clouds. In: Evolutionary computation (CEC), IEEE congress on, pp 1–8Google Scholar
  17. 17.
    Maheswaran M, Ali S, Siegal HJ, Hensgen D, Freund RF (1999) Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: 8th Proceedings on, heterogeneous computing workshop (HCW’99), pp 30–44Google Scholar
  18. 18.
    Maheswaran M, Ali S, Siegel HJ, Hensgen D, Freund RF (1999) Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. J Parallel Distrib Comput 59(2):107–131CrossRefGoogle Scholar
  19. 19.
    Wu F, Wu Q, Tan Y (2015) Workflow scheduling in cloud: a survey. J Supercomput 71(9):3373–3418CrossRefGoogle Scholar
  20. 20.
    Topcuoglu H, Hariri S, Wu M (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. Parallel Distrib Syst IEEE Trans 13(3):260–274CrossRefGoogle Scholar
  21. 21.
    Sarkar V (1989) Partitioning and scheduling parallel programs for multiprocessors. Pitman, MA, USA CambridgeGoogle Scholar
  22. 22.
    Bittencourt LF, Madeira ERM (2008) A performance-oriented adaptive scheduler for dependent tasks on grids. Concurr Comput Pract Exp 20(9):1029–1049CrossRefGoogle Scholar
  23. 23.
    Yao G, Ding Y, Jin Y, Hao K (2016) Endocrine-based coevolutionary multi-swarm for multi-objective workflow scheduling in a cloud system. Soft Comput. doi: 10.1007/s00500-016-2063-8
  24. 24.
    Grandinetti L, Pisacane O, Sheikhalishahi M (2013) An approximate \(\epsilon \)-constraint method for a multi-objective job scheduling in the cloud. Future Gen Comput Syst 29(8):1901–1908CrossRefGoogle Scholar
  25. 25.
    Chang W-L, Ren T-T, Feng M (2015) Quantum algorithms and mathematical formulations of biomolecular solutions of the vertex cover problem in the finite-dimensional hilbert space. NanoBiosci IEEE Trans 14(1):121–128CrossRefGoogle Scholar
  26. 26.
    Aggarwal M, Kent RD, Ngom A (2005) Genetic algorithm based scheduler for computational grids. In: 19th International symposium on, high performance computing systems and applications, HPCS 2005, pp 209–215Google Scholar
  27. 27.
    Alhusaini AH, Prasanna VK, Raghavendra CS (1999) A unified resource scheduling framework for heterogeneous computing environments. In: 8th Proceedings on, heterogeneous computing workshop (HCW’99), pp 156–165Google Scholar
  28. 28.
    Bajaj R, Agrawal DP (2004) Improving scheduling of tasks in a heterogeneous environment. Parallel Distrib Syst IEEE Trans 15(2):107–118CrossRefGoogle Scholar
  29. 29.
    Yu J, Ramamohanarao K, Buyya R (2009) Deadline/budget-based scheduling of workflows on utility grids. In: Buyya R, Bubendorfer K (eds) Market-oriented grid and utility computing. Wiley, Hoboken, pp 427–450Google Scholar
  30. 30.
    Zheng W, Sakellariou R (2013) Budget-deadline constrained workflow planning for admission control. J Grid Comput 11(4):633–651CrossRefGoogle Scholar
  31. 31.
    Yang T, Gerasoulis A (1994) DSC: scheduling parallel tasks on an unbounded number of processors. Parallel Distrib Syst IEEE Trans 5(9):951–967CrossRefGoogle Scholar
  32. 32.
    Bittencourt LF, Madeira ERM (2010) Towards the scheduling of multiple workflows on computational grids. J Grid Comput 8(3):419–441CrossRefGoogle Scholar
  33. 33.
    Garg SK, Yeo CS, Anandasivam A, Buyya R (2011) Environment-conscious scheduling of HPC applications on distributed cloud-oriented data centers. J Parallel Distrib Comput 71(6):732–749CrossRefzbMATHGoogle Scholar
  34. 34.
    Beloglazov A, Abawajy J, Buyya R (2012) Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing. Future Gen Comput Syst 28(5):755–768CrossRefGoogle Scholar
  35. 35.
    Younge AJ, Von Laszewski G, Wang L, Lopez-Alarcon S, Carithers W (2010) Efficient resource management for cloud computing environments. In: Green computing conference international, pp 357–364Google Scholar
  36. 36.
    Nathani A, Chaudhary S, Somani G (2012) Policy based resource allocation in IaaS cloud. Future Gen Comput Syst 28(1):94–103CrossRefGoogle Scholar
  37. 37.
    Wang W, Zeng G, Tang D, Yao J (2012) Cloud-DLS: dynamic trusted scheduling for cloud computing. Expert Syst Appl 39(3):2321–2329CrossRefGoogle Scholar
  38. 38.
    Frîncu ME (2014) Scheduling highly available applications on cloud environments. Future Gen Comput Syst 32:138–153CrossRefGoogle Scholar
  39. 39.
    Malawski M, Juve G, Deelman E, Nabrzyski J (2012) Cost-and deadline-constrained provisioning for scientific workflow ensembles in iaas clouds. In: Proceedings of the international conference on high performance computing, storage and analysis, networking, p 22Google Scholar
  40. 40.
    Abrishami S, Naghibzadeh M (2011) Budget constrained scheduling of grid workflows using partial critical paths. In: World congress in computer science, computer engineering, and applied computing (WORLDCOMP’11)Google Scholar
  41. 41.
    Poola D, Garg SK, Buyya R, Yang Y, Ramamohanarao K (2014) Robust scheduling of scientific workflows with deadline and budget constraints in clouds. In: The 28th IEEE international conference on advanced information networking and applications (AINA-2014), pp 1–8Google Scholar
  42. 42.
    Deelman E, Gannon D, Shields M, Taylor I (2009) Workflows and e-Science: an overview of workflow system features and capabilities. Future Gen Comput Syst 25(5):528–540CrossRefGoogle Scholar
  43. 43.
    Yu J, Buyya R (2005) A taxonomy of workflow management systems for grid computing. J Grid Comput 3(3–4):171–200CrossRefGoogle Scholar
  44. 44.
    Bharathi S, Chervenak A, Deelman E, Mehta G, Su M-H, Vahi K (2008) Characterization of scientific workflows. In: Workflows in support of large-scale science, WORKS 2008, 3 Workshop on, pp 1–10Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Arash Deldari
    • 1
  • Mahmoud Naghibzadeh
    • 1
    Email author
  • Saeid Abrishami
    • 1
  1. 1.Department of Computer EngineeringFerdowsi university of MashhadMashhadIran

Personalised recommendations