Earticle

초록

영어

Cloud computing is an internet based technology. This computing paradigm has increased the utility of network where the potentiality of one node can be used by Other node, cloud provides services on demand to distributive resources such as Database, servers, software, infrastructure etc. in pay per use basis, load balancing is One of the unique and important issues for distributing a larger processing lode to smaller processing nodes for increasing total performance of system, in load balancing method the workload not only distribute across multiple computers but also other resources over the network links to gain optimum resource utilization, minimum average response time and avoid overload condition. Different load balancing algorithms have been launched in order to manage the resources of service provider efficiently and effectively. The objective of this paper is to propose efficient scheduling algorithm that can maintain the load balancing and provide improved strategies through efficient job scheduling that would decrease the average response time and increase the availability of more VMs to allocate new jobs from requesting nodes.

목차

Abstract
 1. Introduction
  1.1. Related Works
 2. Scheduling Criteria
  2.1. Characteristics
 3. Shortest Job First
 4. Algorithm
 5. Flow Chart
 6. Simulation and Result Analysis
 6. Conclusion and Future Plan
 Acknowledgment
 References

키워드

저자

• Ranjan Kumar Mondal [ Department of Computer Science & Engineering, University of Kalyani, Kalyani, India ]
• Enakshmi Nandi [ Ph.D. Student, Department of Computer Science & Engineering, University of Kalyani, Kalyani, India ]
• Debabrata Sarddar [ Assistant Professor, Department of Computer Science & Engineering, University of Kalyani, Kalyani, India ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605