scholarly journals A NOVEL APPROACH OF JOB ALLOCATION USING MULTIPLE PARAMETERS IN IN CLOUD ENVIRONMENT

2018 ◽  
Vol 17 (1) ◽  
pp. 7103-7110
Author(s):  
Ashima Ashima ◽  
Vikramjit Singh
Keyword(s):  
Load Balancing ◽  
Virtual Machines ◽  
Complete Solution ◽  
Research Work ◽  
Cloud Service ◽  
Threshold Value ◽  
Work Load ◽  
Cloud Environment ◽  
Multiple Parameters ◽  
Load Balancing Algorithm

Cloud computing is Internet ("cloud") based development and use of computer technology ("computing"). It is a style of computing in which dynamically scalable and often virtualized resources are provided as a service over the Internet. This research deals with the balancing of work load in cloud environment. Load balancing is one of the essential factors to enhance the working performance of the cloud service provider. Grid computing utilizes the distributed heterogeneous resources in order to support complicated computing problems. Grid can be classified into two types: computing grid and data grid. We propose an improved load balancing algorithm for job scheduling in the Grid environment.  Hence, in this research work, a multi-objective load balancing algorithm has been proposed to avoid deadlocks and to provide proper utilization of all the virtual machines (VMs) while processing the requests received from the users by VM classification. The capacity of virtual machine is computed based on multiple parameters like MIPS, RAM and bandwidth. Heterogeneous virtual machines of different MIPS and processing power in multiple data centers with different hosts have been created in cloud simulator. The VM’s are divided into 2 clusters using K-Means clustering mechanism in terms of processor MIPS, memory and bandwidth. The cloudlets are divided into two categories like High QOS and Low QOS based on the instruction size. The cloudlet whose task size is greater than the threshold value will enter into High QOS and cloudlet whose task size is lesser than the threshold value will enter into Low QOS. Submit the job of the user to the datacenter broker. The job of the user is submitted to the broker and it will first find the suitable VM according to the requirements of the cloudlet and will match VM depending upon its availability. Multiple parameters have been evaluated like waiting time, turnaround time, execution time and processing cost. This modified algorithm has an edge over the original approach in which each cloudlet build their own individual result set and it is later on built into a complete solution.

scholarly journals ALLOCATION OF HETEROGENOUS CLOUDLETS ON PRIORITY BASIS IN CLOUD ENVIRONMENT

2017 ◽  
Vol 16 (3) ◽  
pp. 6240-6246
Author(s):  
Sumanpreet Kaur ◽  
Mr. Navtej Singh Ghumman
Keyword(s):  
Load Balancing ◽  
Job Scheduling ◽  
Virtual Machines ◽  
Research Work ◽  
Turnaround Time ◽  
Single Node ◽  
Multiple Parameters ◽  
Class A ◽  
Class B ◽  
Load Balancing Algorithm

Load balancing is one of the main challenges in cloud computing which is required to distribute the dynamic workload across multiple nodes to ensure that no single node is overwhelmed. It helps in optimal utilization of resources and hence in enhancing the performance of the system. In the natural environment, the cloudlets will be processed in the FIFO (First in First Out approach). We propose an improved load balancing algorithm for job scheduling in the Grid environment.  Hence, in this research work, various types of leases have been assigned to the cloudlets like cancellable, suspendable and non-preemtable. The leases have been assigned on the basis of cost assigned to them and the requirement specified by the user. The datacenter broker will receive the list of all the virtual machines and will categorize them into two classes i.e. Class A and Class B. Class A will have high end virtual machines and will process the non-preemptable cloudlets. Class B will contain the low end virtual machines and will process the suspendable and cancellable cloudlets. The machines in each class will be further sorted in descending order according to their MIPS. Multiple parameters have been evaluated like waiting time, turnaround time, execution time and processing cost.  Further, this research also provides the anticipated results with the implementation of the proposed algorithm. In the cloud storage, load balancing is a key issue. It would consume a lot of cost to maintain load information, since the system is too huge to timely disperse load. The main contributions of the research work are to balance the entire system load while trying to minimize the make span of a given set of jobs. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.

scholarly journals ENHANCED DYNAMIC RESOURCE ALLOCATION SCHEME BASED ON PACKAGE LEVEL ACCESS IN CLOUD COMPUTING

2017 ◽  
Vol 16 (5) ◽  
pp. 6903-6912
Author(s):  
Manpreet Kaur ◽  
Dr. Rajinder Singh
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machine ◽  
Job Scheduling ◽  
Research Work ◽  
Cloud Service ◽  
Current Status ◽  
Cloud Environment ◽  
Single Node ◽  
Load Balancing Algorithm

Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. This research work deals with the balancing of work load in cloud environment. Load balancing is one of the essential factors to enhance the working performance of the cloud service provider. It would consume a lot of cost to maintain load information, since the system is too huge to timely disperse load. Load balancing is one of the main challenges in cloud computing which is required to distribute the dynamic workload across multiple nodes to ensure that no single node is overwhelmed. It helps in optimal utilization of resources and hence in enhancing the performance of the system. We propose an improved load balancing algorithm for job scheduling in the cloud environment using load distribution table in which the current status, current package, VM Capacity and the number of cloudlets submitted to each and every virtual machine will be stored. Submit the job of the user to the datacenter broker. Data center broker will first find the suitable Vm according to the requirements of the cloudlet and will match and find the most suitable Vm according to its availability or the machine with least load in the distribution table. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. The main contributions of the research work is to balance the entire system load while trying to minimize the make span of a given set of jobs. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.

A Two-Phase Load Balancing Algorithm for Cloud Environment

2021 ◽  
Vol 13 (1) ◽  
pp. 38-55
Author(s):  
Archana Singh ◽  
Rakesh Kumar
Keyword(s):  
Load Balancing ◽  
Data Center ◽  
Virtual Machines ◽  
Second Phase ◽  
Cloud Environment ◽  
Cloud Platform ◽  
Efficient Utilization ◽  
Two Phase ◽  
Excessive Load ◽  
Load Balancing Algorithm

Load balancing is the phenomenon of distributing workload over various computing resources efficiently. It offers enterprises to efficiently manage different application or workload demands by allocating available resources among different servers, computers, and networks. These services can be accessed and utilized either for home use or for business purposes. Due to the excessive load on the cloud, sometimes it is not feasible to offer all these services to different users efficiently. To solve this excessive load issue, an efficient load balancing technique is used to offer satisfactory services to users as per their expectations also leading to efficient utilization of resources and applications on the cloud platform. This paper presents an enhanced load balancing algorithm named as a two-phase load balancing algorithm. It uses a two-phase checking load balancing approach where the first phase is to divide all virtual machines into two different tables based on their state, that is, available or busy while in the second phase, it equally distributes the loads. The various parameters used to measure the performance of the proposed algorithm are cost, data center processing time, and response time. Cloud analyst simulation tool is used to simulate the algorithm. Simulation results demonstrate superiority of the algorithm with existing ones.

A Proficient Approach for Load Balancing in Cloud Computing-Join Minimum Loaded Queue

2020 ◽  
Vol 11 (1) ◽  
pp. 12-36
Author(s):  
Minakshi Sharma ◽  
Rajneesh Kumar ◽  
Anurag Jain
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Response Time ◽  
Resource Utilization ◽  
Cloud Service ◽  
Cloud Environment ◽  
Cloud Service Provider ◽  
Qos Parameters ◽  
Load Balancing Algorithm

Cloud load balancing is done to persist the services in the cloud environment along with quality of service (QoS) parameters. An efficient load balancing algorithm should be based on better optimization of these QoS parameters which results in efficient scheduling. Most of the load balancing algorithms which exist consider response time or resource utilization constraints but an efficient algorithm must consider both perspectives from the user side and cloud service provider side. This article presents a load balancing strategy that efficiently allocates tasks to virtualized resources to get maximum resource utilization in minimum response time. The proposed approach, join minimum loaded queue (JMLQ), is based on the existing join idle queue (JIQ) model that has been modified by replacing idle servers in the I-queues with servers having one task in execution list. The results of simulation in CloudSim verify that the proposed approach efficiently maximizes resource utilization by reducing the response time in comparison to its other variants.

scholarly journals A NOVEL APPROACH OF OPTIMIZING PERFORMANCE USING K-MEANS CLUSTERING IN CLOUD COMPUTING

2016 ◽  
Vol 15 (14) ◽  
pp. 7435-7443 ◽  
Author(s):  
Sheenam Kamboj ◽  
Mr. Navtej Singh Ghumman
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machine ◽  
Job Scheduling ◽  
Virtual Machines ◽  
Turnaround Time ◽  
Cloud Environment ◽  
Single Node ◽  
Novel Approach ◽  
Load Balancing Algorithm

Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results. 

scholarly journals AN IMPROVED RESOURCE ALLOCATION STRATEGY BASED ON PACKAGE LEVEL ACCESS IN CLOUD ENVIRONMENT

2017 ◽  
Vol 16 (7) ◽  
pp. 7021-7030
Author(s):  
Rajveer Kaur ◽  
Mr. Navtej Singh Ghumman
Keyword(s):  
Load Balancing ◽  
Job Scheduling ◽  
Virtual Machines ◽  
Research Work ◽  
Turnaround Time ◽  
Basic Medium ◽  
Heterogeneous Services ◽  
Resource Allocation Strategy ◽  
Load Balancing Algorithm ◽  
And Storage

Cloud computing is an emerging field of computer science, where heterogeneous services such as applications, servers and storage are delivered to an individual or organization's computer and devices through the Internet. In the proposed research work, a load balancing algorithm is designed, to provide proper utilization of all resources while processing the requests received from the users. We have implemented the ‘package’ level access at the Virtual Machines. We have proposed three types of packages like basic, medium and premium according to the requirements of the Cloudlets. In the basic package, we have the Virtual Machines with low capacity and in the premium package we are having the Virtual Machines with higher capacity, whereas the medium is of intermediate capacity of MIPS and RAM. In the proposed approach, the capacity, status and current load of every Virtual Machine is computed before allocating the new request of the user. Different parameters like waiting time, execution time and turnaround time of the Cloudlets are computed and analyzed. The proposed research provides the anticipated results with the implementation of the proposed algorithm. Compared with the other job scheduling algorithms, the proposed load balancing algorithm can outperform them in circumstances where the load and Virtual Machines are heterogeneous.

scholarly journals AN ENHANCED TASK ALLOCATION STRATEGY IN CLOUD ENVIRONMENT

2017 ◽  
Vol 16 (6) ◽  
pp. 6953-6961
Author(s):  
Kavita Redishettywar ◽  
Prof. Rafik Juber Thekiya
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Virtual Machine ◽  
Data Centers ◽  
Job Scheduling ◽  
Virtual Machines ◽  
Cloud Environment ◽  
Cloud Data ◽  
Cloud Data Centers ◽  
Load Balancing Algorithm

Cloud computing is a vigorous technology by which a user can get software, application, operating system and hardware as a service without actually possessing it and paying only according to the usage. Cloud Computing is a hot topic of research for the researchers these days. With the rapid growth of Interne technology cloud computing have become main source of computing for small as well big IT companies. In the cloud computing milieu the cloud data centers and the users of the cloud-computing are globally situated, therefore it is a big challenge for cloud data centers to efficiently handle the requests which are coming from millions of users and service them in an efficient manner. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

scholarly journals Addressing Semantics Standards for Cloud Portability and Interoperability in Multi Cloud Environment

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 317
Author(s):  
Chithambaramani Ramalingam ◽  
Prakash Mohan
Keyword(s):  
Service Providers ◽  
Research Work ◽  
Cloud Service ◽  
Cloud Services ◽  
Cloud Environment ◽  
Cloud Service Providers ◽  
Application Programming ◽  
Increasing Demand ◽  
Programming Interfaces ◽  
Multi Cloud

The increasing demand for cloud computing has shifted business toward a huge demand for cloud services, which offer platform, software, and infrastructure for the day-to-day use of cloud consumers. Numerous new cloud service providers have been introduced to the market with unique features that assist service developers collaborate and migrate services among multiple cloud service providers to address the varying requirements of cloud consumers. Many interfaces and proprietary application programming interfaces (API) are available for migration and collaboration services among cloud providers, but lack standardization efforts. The target of the research work was to summarize the issues involved in semantic cloud portability and interoperability in the multi-cloud environment and define the standardization effort imminently needed for migrating and collaborating services in the multi-cloud environment.

Sign in / Sign up

Export Citation Format

Share Document