Cloud Workflow Arrangement with Deadline and Point Period Accessibility

Authors(1) :-Aravind

Nowadays much attention has been paid on workflow scheduling in service computing environments (cloud computing, grid computing, Web services, etc). Resources are generally provided in the form of services, especially in cloud computing. Allocating service capacities in cloud computing is based on the idea that they're unlimited and may be used atany time. However, available service capacities change with workload and can't satisfy usersí requests at any time from the cloudproviderís perspective because cloud services are shared by multiple tasks. Cloud service suppliers provide available time slots for new userís requests based on available capacities. during this paper, we tend to consider workflow scheduling with deadline and time slot availability in cloud computing. An iterated heuristic framework is given for the problem under study that mainly consists ofinitial solution construction, improvement, and perturbation. 3 initial solution construction methods, 2 greedy- and fair-based improvement methods and a perturbation strategy are proposed. Totally different methods within the 3 phases end in many heuristics. Experimental results show that different initial solution and improvement strategies have different effects on solution qualities.

Authors and Affiliations

MCA, Sri Padmavathi College Of Computer Sciences & Technology, Tiruchanoor, Andhra Pradesh, India

Workflow, Scheduling, Time slots, Cloud Computing

  1. R. Buyya, C. S. Yeo, and S. Venugopal, “Market-oriented cloud computing: Vision, hype, and reality for delivering it services as computing utilities,” in High Performance Computing and Communications, 2008. HPCC’08. 10th IEEE International Conference on. IEEE, 2008, pp. 5–13.
  2. E. L. Demeulemeester, W. S. Herroelen, and S. E. Elmaghraby, “Optimal procedures for the discrete time/cost trade-off problem in project networks,” European Journal of Operational Research, vol. 88, no. 1, pp. 50–68, 1996.
  3. X. Zhang, L. Yang, C. Liu, and J. Chen, “A scalable two-phase top-down specialization approach for data anonymization using map reduce on cloud,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 2, pp. 363–373, 2014.
  4. M. Menzel, R. Ranjan, L. Wang, S. Khan, and J. Chen, “Cloud genius: A hybrid decision support method for automating the migration of web application clusters to public clouds,” IEEE Transactions on Computers, vol. 64, no. 5, pp. 1336–1348, 2015.
  5. W. Dou, X. Zhang, J. Liu, and J. Chen, “Hire some-ii: Towards privacy aware cross-cloud service composition for big data applications,” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 2, pp. 455–466, 2015.
  6. C. Liu, R. Ranjan, C. Yang, X. Zhang, L. Wang, and J. Chen, “Mur-dpa: Top-down levelled multi-replica merkle hash tree based secure public auditing for dynamic big data storage on cloud,” IEEE Transactions on Computers, vol. 64, no. 9, pp. 2609–2622, 2015.
  7. A. Verma and S. Kaushal, “Deadline constraint heuristic–based genetic algorithm for workflow scheduling in cloud,” International Journal of Grid and Utility Computing, vol. 5, no. 2, pp. 96–106, 2014.
  8. S. Abrishami, M. Naghibzadeh, and D. H. Epema, “Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds,” Future Generation Computer Systems, vol. 29, no. 1, pp. 158–169, 2013.
  9. 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.
  10. A. G. Delavar and Y. Aryan, “Hsga: a hybrid heuristic algorithm for workflow scheduling in cloud systems,” Cluster computing, vol. 17, no. 1, pp. 129–137, 2014.
  11. C. Akkan, A. Drexl, and A. Kimms, “Network decomposition-based benchmark results for the discrete time–cost tradeoff problem,” European Journal of Operational Research, vol. 165, no. 2, pp. 339–358, 2005.
  12. P. De, E. J. Dunne, J. B. Ghosh, and C. E. Wells, “Complexity of the discrete time-cost tradeoff problem for project networks,” Operations Research, vol. 45, no. 2, pp. 302–306, 1997.
  13. T. J. Hindelang and J. F. Muth, “A dynamic programming algorithm for decision CPM networks,” Operations Research, vol. 27, no. 2, pp. 225–241, 1979.
  14. J. Yu, R. Buyya, and C. K. Tham, “Cost-based scheduling of scientific workflow applications on utility grids,” in e-Science and Grid Computing, 2005. First International Conference on. IEEE, 2005, pp. 8–pp.
  15. Y. Yuan, X. Li, Q. Wang, and X. Zhu, “Deadline division-based heuristic for cost optimization in workflow scheduling,” Information Sciences, vol. 179, no. 15, pp. 2562–2575, 2009.

Publication Details

Published in : Volume 3 | Issue 4 | March-April 2018
Date of Publication : 2018-04-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 1080-1083
Manuscript Number : CSEIT1833529
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Aravind, "Cloud Workflow Arrangement with Deadline and Point Period Accessibility", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 4, pp.1080-1083, March-April-2018.
Journal URL :

Article Preview