Dependence undertaking line will contain the assignments which depends upon

Dependence undertaking line will contain the

This preview shows page 6 - 7 out of 7 pages.

after tyke endeavors are executed. Dependence undertaking line will contain the assignments, which depends upon interchange errands show in the VMs. At the point when all the child endeavors appear in this line completed its execution the parent errand will be taken for the execution by designating it to the VM, however free task line contains self-governing assignments. Self-sufficient errand line and dependence task are commitment to the scheduler. The scheduler picks the fitting VM in perspective of IWRR figuring. This scheduler assembles the benefits information from the Resource manager. Conclusion: This Assignmenr is an earnest effort to unveil the concept of load balancing and its type’s, especially dynamic load balancing and its importance. But, still there are miles to go. As cloud computing is yet in its infancy and there are many more open issues like security, resource utilization, etc. that need to be explored References: 6
Image of page 6
CIS549 - Cloud Computing Environments A.T. Velte, T.J. Veltey and R. Elsenpeter, Cloud Computing: A Practical Approach (Tata McGraw-Hill Education Private Limited, New Delhi, Edition 2010) F.B. Shaikh and S. Haider, “Security Threats in Cloud Computing”, Internet Technology and Secured Transactions,2011, 214-219 S. Ray and A.D. Sarkar, “Execution Analysis of Load Balancing Algorithms in Cloud Computing Environment”,International Journal on Cloud Computing Services and Architecture, 2(5), October 2012. Basker R., Rhymend Uthariaraj V., Chitra Devi D. An enhanced scheduling in weighted round robin for the cloud infrastructure services. International Journal of Recent Advance in Engineering & Technology. 2014;2(3):81–86. Yu Z., Menng F., Chen H. An efficient list scheduling algorithm of dependent task in grid. Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT '10); July 2010; Chengdu, China. IEEE Calheiros R. N., Buyya R. Meeting deadlines of scientific workflows in public clouds with tasks replication. IEEE Transactions on Parallel and Distributed Systems. 2014;25(7):1787–1796. doi: 10.1109/tpds.2013.238 Ijaz S., Munir E. U., Anwar W., Nasir W. Efficient scheduling strategy for task graphs in heterogeneous computing environment. The International Arab Journal of Information Technology. 2013;10 Mondal B., Dasgupta K., Dutta P. Load balancing in cloud computing using stochastic hill climbing-a soft computing approach. Procedia Technology. 2012;4:783–789 7
Image of page 7

You've reached the end of your free preview.

Want to read all 7 pages?

  • Summer '17
  • ALBERT DOMINIC
  • ........., Scheduling algorithm

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes