Abstract
Cloud computing systems provide different options to customers to compute the tasks’ based on their choice. Cloud systems provide services to customers as a utility. The customers are focused on the availability of service at low cost and minimum execution time. The performance of cloud systems depends on scheduling of tasks. The groups of tasks which are interdependent are referred as workflows. Workflow tasks scheduling plays an important role to estimate cloud system performance. If we want to reduce the execution time (make span), the cost involved in it will increase. Here, we proposed a novel method which minimizes the cost and time to schedule tasks of workflows. This algorithm schedules the tasks of a workflow to complete the execution in shortest feasible time so as to minimize the price for the services provided to customers. The experimental results show that proposed scheduling algorithm minimizes the make span and cost of workflows when compared with other existing algorithms.
Similar content being viewed by others
References
Buyya. R, Pandey, S. and Vecchiola, C. (2009) ‘Cloudbus toolkit for market-oriented cloud computing’, CloudCom’09: Proceedings of the 1st International Conference on Cloud Computing, December 2009, Vol. 5931 of LNCS, Springer, Germany, pp. 24–44.
Pandey, S., Wu, L., Guru, S. and Buyya, R. (2011) ‘Workflow engine for clouds, Cloud computing: Principles and Paradigms’, February 2011, pp 321–344, Buya, R., Broberg, ISBN-13:978-0470887998, Wiley Press, New York, USA.
Yu, J and Buyya, R ‘A taxonomy of workflow management systems for grid computing’’, Journal of Grid Computing, September, Vol. 3 Nos 3–4 (2005), pp 171–200, Springer B.V New York, USA.
Yu.J, and Buyya R, (2006) ‘A budget-constrained scheduling of workflow applications on utility grids using genetic algorithms’, Workshop on Workflows in Support of Large-Scale Science, Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC 2006, IEEE CS Press, Los Alamitos, CA, USA), 19–23 June, Paris, France.
Plale, B. et al ‘CASA and LEAD: adaptive cyberinfracture for real-time multiscale weather forecasting’, IEEE Computer, Vol. 39, No.11 (2006), pp:56–64.
Cao, Q., Wei, Z-B. and Gong, W-M. (2009) ‘An optimized algorithm for task scheduling based on activity based costing in cloud computing’, 3rd International Conference on Bioinformatics and Biomedical Engineering, 2009, ICBBE 2009, 11–13 June, pp. 1–3.
Li, J., Qiu, M., Niu, J., Gao, W., Zong, Z. and Qin, X. (2010) ‘Feedback dynamic algorithms for preemptable job scheduling in cloud systems’, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), 31 August 2010 to September 3, pp. 561–564.
Yuan, Y., Li, X. and Wang, Q. (2006) ‘Time-cost tradeoff dynamic scheduling algorithm for workflows in grids’, CSCWD’06, 10th International Conference on Computer Supported Cooperative Work in Design, 2006, 3–5 May, pp. 1–6.
Yu, J., Buyya, R. and Ramanohanarao, K. (2008) Metaheuristics for Scheduling in Distributed Computing Environments, Springer, Berlin, Germany.
Dong, F., and Akl, S.G. (2006) Scheduling Algorithms for Grid Computing: State of the Art and Open Problems, January, Tech. rep., School of Computing, Queen’s University, Kingston, Ontario.
Byun, E-K.,Kee, Y-S., Deelman, E., Vahi. K. Mehta, G. and Kim, J-S. ‘Estimating resource needs for time-constrained workflows’, 2008 Proceedings of the 4th IEEE International Conference on e-Science.
Sudarsanam, A., Srinivasan, M., and Panchanathan, S. ‘Resource estimation and Task Scheduling for Multithreaded Reconfigurable Architecture’, Proceedings of the 10 th International Conference on Parallel and Distributed Systems (2004).
Wieczorek, M., Podlipnig, S., Prodan, R. and Fahringer, T. ‘Bi-Criteria Scheduling of scientific workflows for the grid’, Proceedings of the 8th ACM/IEEE International Symposium on Cluster Computing and the Grid -2008.
Huang, R., Casanova, H. and Chien, A.A. ‘Automatic resource specification generation for resource selection’, Proceedings of the 20th ACM/IEEE International Conference on High-Performance Computing and Communication, 2007.
Hou, E.S.H., Ansari, N. and Ren, H. ‘A genetic algorithm for multiprocessor scheduling’, IEEE Trans. Parallel and Distributed Systems, Vol. 5, No. 2, pp. 113–120, February-1994.
Qu, Y., Soininen, J. and Nurmi, J. ‘Static scheduling techniques for dependent tasks on dynamically reconfigurable devices’, Journal of Systems Architecture, Vol. 53, No. 11, pp. 861–876, 2007.
Calheiros, R.N., Ranjan, R., De Rose, C.A.F. and Buyya, R., ‘CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms’, Software: Practice and Experience, Vol. 41, No. 1, pp. 23–50. 2011.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Narendrababu Reddy, G., Phani Kumar, S. (2018). Time- and Cost-Aware Scheduling Method for Workflows in Cloud Computing Systems. In: Chaki, N., Cortesi, A., Devarakonda, N. (eds) Proceedings of International Conference on Computational Intelligence and Data Engineering. Lecture Notes on Data Engineering and Communications Technologies, vol 9. Springer, Singapore. https://doi.org/10.1007/978-981-10-6319-0_19
Download citation
DOI: https://doi.org/10.1007/978-981-10-6319-0_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6318-3
Online ISBN: 978-981-10-6319-0
eBook Packages: EngineeringEngineering (R0)