Cloud Task Scheduling Based on Organizational Authorization

Chiranjeevi B, Sundus Hasan, Dhanush K V, Dona Mercy B, A Ajil


Change of imperativeness capability in distributed computing is an essential research subject nowadays. The reducing of operational costs made warmth and condition impact are a segment of the reasons behind this. A 2011 report by Greenpeace found that if worldwide cloud computing was a nation; it would utilize the fifth most power on the planet. It is possible to improve data viability in server cultivates by running diverse virtual machines on a single physical machine. At that point, task scheduling is expected to for better productiveness. Appropriate task scheduling can help in using the accessible resources ideally, subsequently limiting the resource usage and CPU utilization also. Additionally, present day cloud computing situations need to give high QoS to their customers (clients) bringing about the need to manage control execution exchange off. The objective of this wander is to develop a Cloud errand planning calculation using a subterranean insect settlement streamlining methodology to support QoS for clients in Heterogeneous Environment. The fundamental objective of this calculation is to limit the makespan of a given errands list. The proposed calculation considers the trade off between essentialness use and execution and most extreme usage of asset information and CPU restrict factor to achieve the objectives. The proposed calculation has been executed and evaluated by using JCloud test framework which has been used by most experts to related to asset planning for distributed computing.


Distributed Computing, Task Scheduling, Makespan, Insect Colony Optimization.

Full Text:



Florence, A.P. and Shanthi, V., Intelligent Dynamic Load Balancing Approach for Computational Cloud. International Journal of Computer Applications: pp.15-18, (2013). [2] Sharma, T. and Banga, V.K., Efficient and Enhanced Algorithm in Cloud Computing. International Journal of Soft Computing and Engineering (IJSCE),(March 2013). [3] R. Brown et al., “Report to congress on server and data center energy efficiency: Public law 109431,” Lawrence Berkeley National Laboratory, 2008.

Zhang, Q., Cheng, L., and Boutaba, R., Cloud computing: state-of-the-art and research challenges. Journal of Internet Services and Applications, pp. 718,(2010). [5] Singh, A., Gupta, S., and Bedi, R., Comparative Analysis of Proposed Algorithm With Existing Load Balancing Scheduling Algorithms In Cloud Computing. International Journal of Emerging Trends &Technology in Computer Science (IJETTCS), pp. 197-200, (2014). [6] Tiwari, M., Gautam, K., and Katare, K., Analysis of Public Cloud Load Balancing using Partitioning Method and Game Theory. International Journal of Advanced Research in Computer Science and Software Engineering, pp. 807-812, (2014). [7] Ratan, M. and Anant, J., Ant colony Optimization: A Solution of Load Balancing in Cloud. International Journal of Web & Semantic Technology(IJWesT), (2012). [8] Elina Pacini, Cristian Mateos, and Carlos García Garino. Balancing throughput and response time in online scientific Clouds via Ant Colony Optimization.Adv. Eng. Softw. 84, C (June 2015), 31-47. [9] Reena Panwar, A Comparative Study of Various Load Balancing Techniques in Cloud Computing. International Journal of Engineering Research & Technology (ijert), Vol. 3 - Issue 9 (September - 2014). [10] Martin Randles, David Lamb, A. TalebBendiab, A Comparative Study into Distributed Load Balancing Algorithms for Cloud Computing, 2010 IEEE 24thInternational Conference on Advanced Information Networking and Applications Workshops. [11] Kaleeswari and Juliet, N., Dynamic Resource Allocation by Using Elastic Compute Cloud Service. International Journal of Innovative Research in Science, Engineering and Technology (IJIRSET), pp. 12375, 2014.



  • There are currently no refbacks.

Copyright (c) 2018 International Journal of Advanced Research in Computer Science