Multidimensional Resource Scheduling in Cloud Data Centers

2014 ◽  
Vol 1008-1009 ◽  
pp. 1513-1516
Author(s):  
Hai Na Song ◽  
Xiao Qing Zhang ◽  
Zhong Tang He

Cloud computing environment is regarded as a kind of multi-tenant computing mode. With virtulization as a support technology, cloud computing realizes the integration of multiple workloads in one server through the package and seperation of virtual machines. Aiming at the contradiction between the heterogeneous applications and uniform shared resource pool, using the idea of bin packing, the multidimensional resource scheduling problem is analyzed in this paper. We carry out some example analysis in one-dimensional resource scheduling, two-dimensional resource schduling and three-dimensional resource scheduling. The results shows that the resource utilization of cloud data centers will be improved greatly when the resource sheduling is conducted after reorganizing rationally the heterogeneous demands.

Author(s):  
Kumaraswamy S ◽  
Mydhili K Nair

<p>Cloud computing has become more commercial and familiar. The Cloud data centers havhuge challenges to maintain QoS and keep the Cloud performance high. The placing of virtual machines among physical machines in Cloud is significant in optimizing Cloud performance. Bin packing based algorithms are most used concept to achieve virtual machine placement(VMP). This paper presents a rigorous survey and comparisons of the bin packing based VMP methods for the Cloud computing environment. Various methods are discussed and the VM placement factors in each methods are analyzed to understand the advantages and drawbacks of each method. The scope of future research and studies are also highlighted.</p>


2018 ◽  
Vol 17 (2) ◽  
pp. 7261-7272 ◽  
Author(s):  
Ishaan Chawla

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 Internet 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.Cloud computing is Internet based development and use of computer technology. It is a style of computing in which dynamically scalable and often virtualized resources are provided as a service over the Internet. Users need not have knowledge of, expertise in, or control over the technology infrastructure "in the cloud" that supports them. Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous computing systems. On cloud computing platform, load balancing of the entire system can be  dynamically handled  by  using  virtualization  technology through which it  becomes  possible  to  remap  virtual  machine  and physical resources  according  to  the  change  in  load. However, in order to improve performance, the virtual machines have to fully utilize its resources and services by adapting to computing environment dynamically.  The  load balancing  with  proper  allocation  of  resources  must  be guaranteed  in  order  to  improve  resource  utility.  Load balancing is a critical aspect that ensures that all the resources and entities are well balanced such that no resource or entity neither is under loaded nor overloaded. The load balancing algorithms can be static or dynamic.  Load balancing in this environment means equal distribution of workload across all the nodes. Load balancing provides a way of achieving the proper utilization of resources and better user satisfaction. Hence, use of an appropriate load balancing algorithm is necessary for selecting the virtual machines or servers. This paper focuses on the load balancing algorithm which distributes the incoming jobs among VMs optimally in cloud data centers. In this paper, we have reviewed several existing load balancing mechanisms and we have tried to address the problems associated with them.


Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 389 ◽  
Author(s):  
Aisha Fatima ◽  
Nadeem Javaid ◽  
Tanzeela Sultana ◽  
Waqar Hussain ◽  
Muhammad Bilal ◽  
...  

With the increasing size of cloud data centers, the number of users and virtual machines (VMs) increases rapidly. The requests of users are entertained by VMs residing on physical servers. The dramatic growth of internet services results in unbalanced network resources. Resource management is an important factor for the performance of a cloud. Various techniques are used to manage the resources of a cloud efficiently. VM-consolidation is an intelligent and efficient strategy to balance the load of cloud data centers. VM-placement is an important subproblem of the VM-consolidation problem that needs to be resolved. The basic objective of VM-placement is to minimize the utilization rate of physical machines (PMs). VM-placement is used to save energy and cost. An enhanced levy-based particle swarm optimization algorithm with variable sized bin packing (PSOLBP) is proposed for solving the VM-placement problem. Moreover, the best-fit strategy is also used with the variable sized bin packing problem (VSBPP). Simulations are done to authenticate the adaptivity of the proposed algorithm. Three algorithms are implemented in Matlab. The given algorithm is compared with simple particle swarm optimization (PSO) and a hybrid of levy flight and particle swarm optimization (LFPSO). The proposed algorithm efficiently minimized the number of running PMs. VM-consolidation is an NP-hard problem, however, the proposed algorithm outperformed the other two algorithms.


Author(s):  
Deepika T. ◽  
Prakash P.

The flourishing development of the cloud computing paradigm provides several services in the industrial business world. Power consumption by cloud data centers is one of the crucial issues for service providers in the domain of cloud computing. Pursuant to the rapid technology enhancements in cloud environments and data centers augmentations, power utilization in data centers is expected to grow unabated. A diverse set of numerous connected devices, engaged with the ubiquitous cloud, results in unprecedented power utilization by the data centers, accompanied by increased carbon footprints. Nearly a million physical machines (PM) are running all over the data centers, along with (5 – 6) million virtual machines (VM). In the next five years, the power needs of this domain are expected to spiral up to 5% of global power production. The virtual machine power consumption reduction impacts the diminishing of the PM’s power, however further changing in power consumption of data center year by year, to aid the cloud vendors using prediction methods. The sudden fluctuation in power utilization will cause power outage in the cloud data centers. This paper aims to forecast the VM power consumption with the help of regressive predictive analysis, one of the Machine Learning (ML) techniques. The potency of this approach to make better predictions of future value, using Multi-layer Perceptron (MLP) regressor which provides 91% of accuracy during the prediction process.


Dynamic resource allocation of cloud data centers is implemented with the use of virtual machine migration. Selected virtual machines (VM) should be migrated on appropriate destination servers. This is a critical step and should be performed according to several criteria. It is proposed to use the criteria of minimum resource wastage and service level agreement violation. The optimization problem of the VM placement according to two criteria is formulated, which is equivalent to the well-known main assignment problem in terms of the structure, necessary conditions, and the nature of variables. It is suggested to use the Hungarian method or to reduce the problem to a closed transport problem. This allows the exact solution to be obtained in real time. Simulation has shown that the proposed approach outperforms widely used bin-packing heuristics in both criteria.


2019 ◽  
Vol 48 (4) ◽  
pp. 545-556
Author(s):  
Sasan Gharehpasha ◽  
Mohammad Masdari ◽  
Ahmad Jafarian

Nowadays cloud computing is progressing very fast and has resulted in advances in other technologies too. Cloud computing provides quite a convenient platform for millions of users to use computing resources through the internet. Cloud computing provides the possibility of only concentrating on business goals instead of expanding hardware resources for users. Using virtualization technology in computing resources results in the efficient use of resources. A challenging work in virtualization technology is the placement of virtual machines under optimal conditions on physical machines in cloud data centers. Optimal placement of virtual machines on physical machines in cloud data centers can lead to the management of resources and prevention of the resources waste. In this paper, a new method is proffered based on the combination of hybrid discrete multi-object sine cosine algorithm and multi-verse optimizer for optimal placement. The first goal of the proposed approach is to decrease the power consumption which is consumed in cloud data centers by reducing active physical machines. The second goal is to cut in resource wastage and managing resources using the optimal placement of virtual machines on physical machines in cloud data centers. With this approach, the increasing rate of virtual migration to physical machines is prevented. Finally, the results gained from our proposed algorithm are compared to some algorithms like the first fit (FF), virtual machine placement ant colony system (VMPACS), modified best fit decreasing (MBFD).


Author(s):  
Leila Helali ◽  
◽  
Mohamed Nazih Omri

Since its emergence, cloud computing has continued to evolve thanks to its ability to present computing as consumable services paid by use, and the possibilities of resource scaling that it offers according to client’s needs. Models and appropriate schemes for resource scaling through consolidation service have been considerably investigated,mainly, at the infrastructure level to optimize costs and energy consumption. Consolidation efforts at the SaaS level remain very restrained mostly when proprietary software are in hand. In order to fill this gap and provide software licenses elastically regarding the economic and energy-aware considerations in the context of distributed cloud computing systems, this work deals with dynamic software consolidation in commercial cloud data centers 𝑫𝑺𝟑𝑪. Our solution is based on heuristic algorithms and allows reallocating software licenses at runtime by determining the optimal amount of resources required for their execution and freed unused machines. Simulation results showed the efficiency of our solution in terms of energy by 68.85% savings and costs by 80.01% savings. It allowed to free up to 75% physical machines and 76.5% virtual machines and proved its scalability in terms of average execution time while varying the number of software and the number of licenses alternately.


2017 ◽  
Vol 16 (3) ◽  
pp. 6247-6253
Author(s):  
Ashima Ashima ◽  
Mrs Navjot Jyoti

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 is a critical aspect that ensures that all the resources and entities are well balanced such that no resource or entity neither is under loaded nor overloaded. The load balancing algorithms can be static or dynamic.  Load balancing in this environment means equal distribution of workload across all the nodes. Load balancing provides a way of achieving the proper utilization of resources and better user satisfaction. Hence, use of an appropriate load balancing algorithm is necessary for selecting the virtual machines or servers. This paper focuses on the load balancing algorithm which distributes the incoming jobs among VMs optimally in cloud data centers. In this paper, we have reviewed several existing load balancing mechanisms and we have tried to address the problems associated with them.


2019 ◽  
Author(s):  
Lin Shi ◽  
Zilong Wang ◽  
Ning Chen ◽  
Jie Chen

Abstract Highly trusted issues will be one of the main obstacles to a new era of highly trusted cloud computing. In the cloud computing environment, because sensitive applications and user data are put into the cloud, they run in virtual machines in the data center. Among them, due to the existence of access vulnerability, virtualization vulnerability, web application vulnerability, etc., high trust issues arise from data control, identity authentication, lack of information and other related issues. The introduction of trust mechanisms can be very facilitate the solution of related issues, achieve highly trusted quantification, analysis, and modeling of cloud data centers, meet high trust requirements, and provide users with a highly trusted cloud computing environment. This article mainly studies the trust measure of data services in cloud environment. In this paper, the optimization scheme is verified through experiments, and the traditional big data processing scheme, the original Sahara and the optimization scheme are compared in six cases. Overall, the optimization scheme has a significant performance improvement. Compared with the default configuration of Sahara, the configuration of the new interface has increased the throughput in DFSIO by 120%. Using the design of the unified cache management service, Tachyon can reach 13 in specific situations. In the execution time of Sort workloads, the optimization scheme generally decreased by about 50% compared to the original Sahara, and the memory utilization increased from 80% to 96% in our experiments, but in the cache isolation and other areas need to be improved. The results are basically in line with expectations, which also confirms the rational thinking and value of this article on BDAaS performance research.


2021 ◽  
Vol 11 (13) ◽  
pp. 5849
Author(s):  
Nimra Malik ◽  
Muhammad Sardaraz ◽  
Muhammad Tahir ◽  
Babar Shah ◽  
Gohar Ali ◽  
...  

Cloud computing is a rapidly growing technology that has been implemented in various fields in recent years, such as business, research, industry, and computing. Cloud computing provides different services over the internet, thus eliminating the need for personalized hardware and other resources. Cloud computing environments face some challenges in terms of resource utilization, energy efficiency, heterogeneous resources, etc. Tasks scheduling and virtual machines (VMs) are used as consolidation techniques in order to tackle these issues. Tasks scheduling has been extensively studied in the literature. The problem has been studied with different parameters and objectives. In this article, we address the problem of energy consumption and efficient resource utilization in virtualized cloud data centers. The proposed algorithm is based on task classification and thresholds for efficient scheduling and better resource utilization. In the first phase, workflow tasks are pre-processed to avoid bottlenecks by placing tasks with more dependencies and long execution times in separate queues. In the next step, tasks are classified based on the intensities of the required resources. Finally, Particle Swarm Optimization (PSO) is used to select the best schedules. Experiments were performed to validate the proposed technique. Comparative results obtained on benchmark datasets are presented. The results show the effectiveness of the proposed algorithm over that of the other algorithms to which it was compared in terms of energy consumption, makespan, and load balancing.


Sign in / Sign up

Export Citation Format

Share Document