machine allocation
Recently Published Documents


TOTAL DOCUMENTS

196
(FIVE YEARS 67)

H-INDEX

17
(FIVE YEARS 4)

Author(s):  
Lin Yang ◽  
Ali Zeynali ◽  
Mohammad H. Hajiesmaili ◽  
Ramesh K. Sitaraman ◽  
Don Towsley

In this paper, we study the online multidimensional knapsack problem (called OMdKP) in which there is a knapsack whose capacity is represented in m dimensions, each dimension could have a different capacity. Then, n items with different scalar profit values and m-dimensional weights arrive in an online manner and the goal is to admit or decline items upon their arrival such that the total profit obtained by admitted items is maximized and the capacity of knapsack across all dimensions is respected. This is a natural generalization of the classic single-dimension knapsack problem and finds several relevant applications such as in virtual machine allocation, job scheduling, and all-or-nothing flow maximization over a graph. We develop two algorithms for OMdKP that use linear and exponential reservation functions to make online admission decisions. Our competitive analysis shows that the linear and exponential algorithms achieve the competitive ratios of O(θα ) and O(łogł(θα)), respectively, where α is the ratio between the aggregate knapsack capacity and the minimum capacity over a single dimension and θ is the ratio between the maximum and minimum item unit values. We also characterize a lower bound for the competitive ratio of any online algorithm solving OMdKP and show that the competitive ratio of our algorithm with exponential reservation function matches the lower bound up to a constant factor.


2021 ◽  
Vol 2070 (1) ◽  
pp. 012129
Author(s):  
M. Shabina Ghafir ◽  
Afshar Alam ◽  
Farheen Siddiqui ◽  
Sameena Naaz

Abstract This paper focuses on the VM allocation policies for load balancing in cloud computing environment. Intermittent nature of balancing the load scheme into the cloud computing becomes a challenging job and it also affects the load balancing of the cloud. The suggested proposed model generates and step-up the VM allocation policies but also transforms the generated cloud workload. Furthermore, to improve the workload distribution of workload and stability of the overall cloud computing environment the load balancing algorithm is most important for load balancing. The work of load balancing is equally effective in the cloud computing environment and it is most essential one for load balancing algorithms to take care of all issues at the time of the work load. The researchers studied different algorithms to solve the problems of load balancing that generate problems during the distribution of workloads. The analysis VM allocation policies are tested on CloudSim environment and the results, and discussion is about to which one VM allocation policy is superior.


2021 ◽  
Vol 11 (21) ◽  
pp. 9940
Author(s):  
Jack Marquez ◽  
Oscar H. Mondragon ◽  
Juan D. Gonzalez

Cloud computing systems are rapidly evolving toward multicloud architectures supported on heterogeneous hardware. Cloud service providers are widely offering different types of storage infrastructures and multi-NUMA architecture servers. Existing cloud resource allocation solutions do not comprehensively consider this heterogeneous infrastructure. In this study, we present a novel approach comprised of a hierarchical framework based on genetic programming to solve problems related to data placement and virtual machine allocation for analytics applications running on heterogeneous hardware with a variety of storage types and nonuniform memory access. Our approach optimizes data placement using the Hadoop File System on heterogeneous storage devices on multicloud systems. It guarantees the efficient allocation of virtual machines on physical machines with multiple NUMA (nonuniform memory access) domains by minimizing contention between workloads. We prove that our solutions for data placement and virtual machine allocation outperform other state-of-the-art approaches.


Author(s):  
Fatin Hamadah Rahman ◽  
S.H. Shah Newaz ◽  
Thien-Wan Au ◽  
Wida Susanty Suhaili ◽  
M.A. Parvez Mahmud ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Jitendra Kumar Samriya ◽  
Subhash Chandra Patel ◽  
Manju Khurana ◽  
Pradeep Kumar Tiwari ◽  
Omar Cheikhrouhou

Cloud computing is the most prominent established framework; it offers access to resources and services based on large-scale distributed processing. An intensive management system is required for the cloud environment, and it should gather information about all phases of task processing and ensuring fair resource provisioning through the levels of Quality of Service (QoS). Virtual machine allocation is a major issue in the cloud environment that contributes to energy consumption and asset utilization in distributed cloud computing. Subsequently, in this paper, a multiobjective Emperor Penguin Optimization (EPO) algorithm is proposed to allocate the virtual machines with power utilization in a heterogeneous cloud environment. The proposed method is analyzed to make it suitable for virtual machines in the data center through Binary Gravity Search Algorithm (BGSA), Ant Colony Optimization (ACO), and Particle Swarm Optimization (PSO). To compare with other strategies, EPO is energy-efficient and there are significant differences. The results of the proposed system have been evaluated through the JAVA simulation platform. The exploratory outcome presents that the proposed EPO-based system is very effective in limiting energy consumption, SLA violation (SLAV), and enlarging QoS requirements for giving capable cloud service.


Author(s):  
Madhusudan Naik ◽  
Lalbihari Barik ◽  
Meenakshi Kandpal ◽  
Sudhansu Shekhar Patra ◽  
Sudarson Jena ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document