Efficient Resource Allocation Mechanism for Federated Clouds

Author(s):  
Chien-Yu Liu ◽  
Kuo-Chan Huang ◽  
Yi-Hsuan Lee ◽  
Kuan-Chou Lai

This study proposes a novel efficient resource allocation mechanism for federated clouds, which takes the communication overhead into consideration, to improve system throughput and reduce resource repacking overhead in the auto-scaling mechanism. In general, when the amount of service requests increases, more and more resources are allocated to satisfy these requests. However, single cloud cannot provide unlimited services with limited physical resources; therefore, the federation of multiple clouds may be one possible solution. In the federated cloud environment, when the workload changes, the resource allocation mechanism could adopt vertical/horizontal scaling fashions to repack the required resource into virtual machines. In the vertical scaling approach, the resource allocation mechanism allocates more resources into virtual machines for improving virtual machine's capability. In the horizontal scaling approach, the resource allocation mechanism allocates more virtual machines for enhancing the virtual cluster's capability. However, frequent resource repacking may reduce the system performance. Therefore, in order to improve system throughput and reduce repacking overhead, the proposed mechanism captures the execution pattern of applications by the profiling system and the resource status by the monitoring system, and then allocates resources for configuring the virtual cluster. Performance for NAS Parallel Benchmarks is evaluated. Experimental results show that the authors' approach could reduce repacking overhead and improve system throughput by comparing two previous works.

2013 ◽  
Vol 22 (3) ◽  
pp. 437-461 ◽  
Author(s):  
Chathurika Ranaweera ◽  
Elaine Wong ◽  
Christina Lim ◽  
Ampalavanapillai Nirmalathas ◽  
Chamil Jayasundara

2014 ◽  
Vol 4 (4) ◽  
pp. 1-6 ◽  
Author(s):  
Manisha Malhotra ◽  
Rahul Malhotra

As cloud based services becomes more assorted, resource provisioning becomes more challenges. This is an important issue that how resource may be allocated. The cloud environment offered distinct types of virtual machines and cloud provider distribute those services. This is necessary to adjust the allocation of services with the demand of user. This paper presents an adaptive resource allocation mechanism for efficient parallel processing based on cloud. Using this mechanism the provider's job becomes easier and having the least chance for the wastage of resources and time.


Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3194 ◽  
Author(s):  
Jingzhao Li ◽  
Xiaoming Zhang ◽  
Yuan Feng ◽  
Kuan-Ching Li

Device-to-device (D2D) communication is a promising technique for direct communication to enhance the performance of cellular networks. In order to improve the system throughput and utilization of spectrum resource, a resource allocation mechanism for D2D underlaid communication is proposed in this paper where D2D pairs reuse the resource blocks (RBs) of cellular uplink users, adopting a matching matrix to disclose the results of resource allocation. Details of the proposed resource allocation mechanism focused are listed as: the transmit power of D2D pairs are determined by themselves with the distributed power control method, and D2D pairs are assigned to different clusters that are the intended user sets of RBs, according to the threshold of the signal-to-interference-plus-noise ratio (SINR). The weighted efficiency interference-aware (WE-I-A) algorithm is proposed and applied subsequently to promote the system throughput by optimizing the matching of D2D pairs and RBs, where each D2D pair is weighted based on the SINR to compete for the priority of RBs fairly. Simulation results demonstrate that the proposed algorithm contributes to a good performance on the system throughput even if the uplink state is limited.


2016 ◽  
Vol 2016 ◽  
pp. 1-13
Author(s):  
Bunjamin Memishi ◽  
María S. Pérez ◽  
Gabriel Antoniu

Containers are considered an optimized fine-grain alternative to virtual machines in cloud-based systems. Some of the approaches which have adopted the use of containers are the MapReduce frameworks. This paper makes an analysis of the use of containers in MapReduce-based systems, concluding that the resource utilization of these systems in terms of containers is suboptimal. In order to solve this, the paper describes AdaptCont, a proposal for optimizing the containers allocation in MapReduce systems. AdaptCont is based on the foundations of feedback systems. Two different selection approaches, Dynamic AdaptCont and Pool AdaptCont, are defined. Whereas Dynamic AdaptCont calculates the exact amount of resources per each container, Pool AdaptCont chooses a predefined container from a pool of available configurations. AdaptCont is evaluated for a particular case, the application master container of Hadoop YARN. As we can see in the evaluation, AdaptCont behaves much better than the default resource allocation mechanism of Hadoop YARN.


Sign in / Sign up

Export Citation Format

Share Document