Dynamic Computation of Threshold Value for Classifying Jobs in Cloud Computing for Efficient Resource Utilization

2020 ◽  
Vol 17 (9) ◽  
pp. 4458-4461
Author(s):  
B. K. Dhanalakshmi ◽  
K. C. Srikantaiah ◽  
K. R. Venugopal

Cloud computing is an instant use of resources and it is a trending technology in the field of computer science. Here, many jobs will be arriving continuously with different job size, at that point of time, allocating of resources for suitable virtual machines without allowing virtual machine to starving is a hindrance job. So, to avoid this hindrance, an algorithm Dynamic Computation of Threshold Value is proposed (DCTV) and based on the threshold value the jobs are classified in the initial stage, so this classification leads to allocation of resources precisely and efficient resource utilization. The experimental result shows that by using dynamic computation of threshold value the allocation of resource time is reduced and classification accuracy is improved compared to manual computation of threshold value.

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Xin Xu ◽  
Huiqun Yu

On-demand resource management is a key characteristic of cloud computing. Cloud providers should support the computational resource sharing in a fair way to ensure that no user gets much better resources than others. Another goal is to improve the resource utilization by minimizing the resource fragmentation when mapping virtual machines to physical servers. The focus of this paper is the proposal of a game theoretic resources allocation algorithm that considers the fairness among users and the resources utilization for both. The experiments with an FUGA implementation on an 8-node server cluster show the optimality of this algorithm in keeping fairness by comparing with the evaluation of the Hadoop scheduler. The simulations based on Google workload trace demonstrate that the algorithm is able to reduce resource wastage and achieve a better resource utilization rate than other allocation mechanisms.


Author(s):  
Vaidehi M ◽  
T. R. Gopalakrishnan

<p>Scheduling is one of the essential enabling technique for Cloud computing which facilitates efficient resource utilization among the jobs scheduled for processing. However, it experiences performance overheads due to the inappropriate provisioning of resources to requesting jobs. It is very much essential that the performance of Cloud is accomplished through intelligent scheduling and allocation of resources. In this paper, we propose the application of Gaussian window where jobs of heterogeneous in nature are scheduled in the round-robin fashion on different Cloud clusters. The clusters are heterogeneous in nature having datacenters with varying sever capacity. Performance evaluation results show that the proposed algorithm has enhanced the QoS of the computing model. Allocation of Jobs to specific Clusters has improved the system throughput and has reduced the latency.</p>


2018 ◽  
Vol 6 (5) ◽  
pp. 340-345
Author(s):  
Rajat Pugaliya ◽  
Madhu B R

Cloud Computing is an emerging field in the IT industry. Cloud computing provides computing services over the Internet. Cloud Computing demand increasing drastically, which has enforced cloud service provider to ensure proper resource utilization with less cost and less energy consumption. In recent time various consolidation problems found in cloud computing like the task, VM, and server consolidation. These consolidation problems become challenging for resource utilization in cloud computing. We found in the literature review that there is a high level of coupling in resource utilization, cost, and energy consumption. The main challenge for cloud service provider is to maximize the resource utilization, reduce the cost and minimize the energy consumption. The dynamic task consolidation of virtual machines can be a way to solve the problem. This paper presents the comparative study of various task consolidation algorithms.


2017 ◽  
Vol 10 (13) ◽  
pp. 162
Author(s):  
Amey Rivankar ◽  
Anusooya G

Cloud computing is the latest trend in large-scale distributed computing. It provides diverse services on demand to distributive resources such asservers, software, and databases. One of the challenging problems in cloud data centers is to manage the load of different reconfigurable virtual machines over one another. Thus, in the near future of cloud computing field, providing a mechanism for efficient resource management will be very significant. Many load balancing algorithms have been already implemented and executed to manage the resources efficiently and adequately. The objective of this paper is to analyze shortcomings of existing algorithms and implement a new algorithm which will give optimized load balancingresult.


2020 ◽  
Vol 17 (6) ◽  
pp. 2430-2434
Author(s):  
R. S. Rajput ◽  
Dinesh Goyal ◽  
Rashid Hussain ◽  
Pratham Singh

The cloud computing environment is accomplishing cloud workload by distributing between several nodes or shift to the higher resource so that no computing resource will be overloaded. However, several techniques are used for the management of computing workload in the cloud environment, but still, it is an exciting domain of investigation and research. Control of the workload and scaling of cloud resources are some essential aspects of the cloud computing environment. A well-organized load balancing plan ensures adequate resource utilization. The auto-scaling is a technique to include or terminate additional computing resources based on the scaling policies without involving humans efforts. In the present paper, we developed a method for optimal use of cloud resources by the implementation of a modified auto-scaling feature. We also incorporated an auto-scaling controller for the optimal use of cloud resources.


2015 ◽  
Vol 15 (4) ◽  
pp. 138-148 ◽  
Author(s):  
B. Mallikarjuna ◽  
P. Venkata Krishna

Abstract Load balancing is treated as one of the important mechanisms for efficient resource allocation in cloud computing. In future there will appear a necessity of fully autonomic distributed systems to address the load balancing issues. With reference to this, we proposed a load balancing mechanism called Osmosis Load Balancing (OLB). OLB works on the principle of osmosis to reschedule the tasks in virtual machines. The solution is based on the Distributed Hash Table (DHT) with a chord overlay mechanism. The Chord overlay is used for managing bio inspired agents and status of the cloud. By simulation analysis, the proposed algorithm has shown better performance in different scenarios, both in heterogeneous and homogeneous clouds.


Author(s):  
Weena Janratchakool ◽  
Sirapat Boonkrong ◽  
Sucha Smanchat

<p>The objective of using threshold cryptography on cloud environment is to protect the keys, which are the most important elements in cryptographic systems. Threshold cryptography works by dividing the private key to a number of shares, according to the number of virtual machines, then distributing them each share to each virtual machine. In order to generate the key back, not all the shares are needed. Howerver, the problem is that there has been no research attemping to find a suitable threshold value for key reconstruction. Therefore, this paper presented a guildline designed and implemented that can assist to choose such value. The experiment was setup using CloudSim to simulate cloud environment and collecting time taken in key distribution and key reconstruction process to achieve the optimal threshold value.</p>


Sign in / Sign up

Export Citation Format

Share Document