Heuristics for Provisioning Services to Workflows in XaaS Clouds

IEEE Transactions on Services Computing

Volumn 9, Issue 2, 2016, Pages 250-263

  Cai, Zhicheng ^a,b   Li, Xiaoping ^a,b   Gupta, Jatinder N D ^c  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

^c Wilson Hall   (United States)

Author keywords

Cloud computing; critical path; service provisioning; workflow scheduling

Indexed keywords

APPLICATION PROGRAMS; BIG DATA; CLOUD COMPUTING; CONFORMAL MAPPING; MAPPING; SOFTWARE AS A SERVICE (SAAS);

CRITICAL PATHS; MEMORY SIZE; MODE MAPPING; SERVICE INSTANCES; SERVICE PROVISIONING; STATE OF THE ART; TASK-PROCESSING; WORKFLOW SCHEDULING;

COSTS;

EID: 84963800003     PISSN: 19391374     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSC.2014.2361320     Document Type: Article

References (26)

1. A. Oprescu and T. Kielmann, "Bag-of-tasks scheduling under budget constraints," in Proc. IEEE 2nd Int. Conf. Cloud Comput. Technol. Sci., 2010, pp. 351-359.
2. M. Mao, J. Li, and M. Humphrey, "Cloud auto-scaling with deadline and budget constraints," in Proc. 11th IEEE/ACM Int. Conf. Grid Comput., 2010, pp. 41-48.
3. R. Van den Bossche, K. Vanmechelen, and J. Broeckhove, "Costoptimal scheduling in hybrid IaaS clouds for deadline constrained workloads," in Proc. IEEE 3rd Int. Conf. Cloud Comput., 2010, pp. 228-235.
4. X. Zuo, G. Zhang, and W. Tan, "Self-adaptive learning PSO-based deadline constrained task scheduling for hybrid IaaS cloud," IEEE Trans. Autom. Sci. Eng., vol. 11, no. 2, pp. 564-573, Aug. 2013.
5. S. Abrishami, M. Naghibzadeh, and D. Epema, "Cost-driven scheduling of grid workflows using partial critical paths," IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 8, pp. 1400-1414, Jun. 2012.
6. S. Abrishami and M. Naghibzadeh, "Deadline-constrained workflow scheduling in software as a service cloud," Scientia Iranica, vol. 19, no. 3, pp. 680-689, 2012.
7. S. Abrishami, M. Naghibzadeh, and D. Epema, "Deadline-constrained workflow scheduling algorithms for IaaS clouds," Future Gen. Comput. Syst., vol. 29, pp. 158-169, 2013.
8. E. Demeulemeester, B. De Reyck, B. Foubert, W. Herroelen, and M. Vanhoucke, "New computational results on the discrete time/ cost trade-off problem in project networks," J. Oper. Res. Soc., vol. 49, pp. 1153-1163, 1998.
9. Y.-K. Kwok and I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors," ACM Comput. Surveys, vol. 31, no. 4, pp. 406-471, 1999.
10. R. Bajaj and D. P. Agrawal, "Improving scheduling of tasks in a heterogeneous environment," IEEE Trans. Parallel Distrib. Syst., vol. 15, no. 2, pp. 107-118, Jun. 2004.
11. P. De, E. Dunne, J. Ghosh, and C. Wells, "Complexity of the discrete time-cost tradeoff problem for project networks," Oper. Res., vol. 45, no. 2, pp. 302-306, 1997.
12. E. Demeulemeester, W. Herroelen, and S. Elmaghraby, "Optimal procedures for the discrete time/cost trade-off problem in project networks," Eur. J. Oper. Res., vol. 88, no. 1, pp. 50-68, 1996.
13. Y. Yuan, X. Li, Q. Wang, and X. Zhu, "Deadline division-based heuristic for cost optimization in workflow scheduling," Inf. Sci., vol. 179, no. 15, pp. 2562-2575, 2009.
14. Z. Cai, X. Li, and J. N. Gupta, "Critical path-based iterative heuristic for workflow scheduling in utility and cloud computing," in Proc. 11th Int. Conf. Service-Oriented Comput., 2013, pp. 207-221.
15. J. Yu, R. Buyya, and C. Tham, "Cost-based scheduling of scientific workflow applications on utility grids," in Proc. 1st Int. Conf. E-Science Grid Comput., 2005, p. 8.
16. E. Hadjiconstantinou and E. Klerides, "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Comput. Manage. Sci., vol. 7, no. 3, pp. 313-336, 2010.
17. Ö. Hazr, M. Haouari, and E. Erel, "Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version," Comput. Oper. Res., vol. 37, no. 4, pp. 649-655, 2010.
18. J. Yu and R. Buyya, "Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms," Sci. Program., vol. 14, no. 3, pp. 217-230, 2006.
19. W. Chen and J. Zhang, "An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 39, no. 1, pp. 29-43, Oct. 2008.
20. Z. Wu, X. Liu, Z. Ni, D. Yuan, and Y. Yang, "A market-oriented hierarchical scheduling strategy in cloud workflow systems," J. Supercomput., vol. 63, no. 1, pp. 256-293, 2013.
21. E.-K. Byun, Y.-S. Kee, J.-S. Kim, E. Deelman, and S. Maeng, "Bts: Resource capacity estimate for time-targeted science workflows," J. Parallel Distrib. Comput., vol. 71, no. 6, pp. 848-862, 2011.
22. J. J. Durillo and R. Prodan, "Multi-objective workflow scheduling in amazon EC2," Cluster Comput., vol. 17, no. 2, pp. 169-189, 2014.
23. E.-K. Byun, Y.-S. Kee, J.-S. Kim, and S. Maeng, "Cost optimized provisioning of elastic resources for application workflows," Future Generation Comput. Syst., vol. 27, no. 8, pp. 1011-1026, 2011.
24. E. Demeulemeester, M. Vanhoucke, and W. Herroelen, "Rangen: A random network generator for activity-on-the-node networks," J. Scheduling, vol. 6, no. 1, pp. 17-38, 2003.
25. C. Akkan, A. Drexl, and A. Kimms, "Network decompositionbased benchmark results for the discrete time-cost tradeoff problem," Eur. J. Oper. Res., vol. 165, no. 2, pp. 339-358, 2005.
26. S. Bharathi, A. Chervenak, E. Deelman, G. Mehta, M.-H. Su, and K. Vahi, "Characterization of scientific workflows," in Proc. 3rd Workshop Workflows Support Large-Scale Sci., 2008, pp. 1-10.