scholarly journals Minimizing Resource Waste in Heterogeneous Resource Allocation for Data Stream Processing on Clouds

2020 ◽  
Vol 11 (1) ◽  
pp. 149
Author(s):  
Wu-Chun Chung ◽  
Tsung-Lin Wu ◽  
Yi-Hsuan Lee ◽  
Kuo-Chan Huang ◽  
Hung-Chang Hsiao ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Data Stream ◽  
Limited Attention ◽  
Heterogeneous Servers ◽  
Resource Allocation Algorithm ◽  
System Utilization ◽  
Allocation Algorithms ◽  
Considerable Resource ◽  
Heterogeneous Resources

Resource allocation is vital for improving system performance in big data processing. The resource demand for various applications can be heterogeneous in cloud computing. Therefore, a resource gap occurs while some resource capacities are exhausted and other resource capacities on the same server are still available. This phenomenon is more apparent when the computing resources are more heterogeneous. Previous resource-allocation algorithms paid limited attention to this situation. When such an algorithm is applied to a server with heterogeneous resources, resource allocation may result in considerable resource wastage for the available but unused resources. To reduce resource wastage, a resource-allocation algorithm, called the minimizing resource gap (MRG) algorithm, for heterogeneous resources is proposed in this study. In MRG, the gap between resource usages for each server in cloud computing and the resource demands among various applications are considered. When an application is launched, MRG calculates resource usage and allocates resources to the server with the minimized usage gap to reduce the amount of available but unused resources. To demonstrate MRG performance, the MRG algorithm was implemented in Apache Spark. CPU- and memory-intensive applications were applied as benchmarks with different resource demands. Experimental results proved the superiority of the proposed MRG approach for improving the system utilization to reduce the overall completion time by up to 24.7% for heterogeneous servers in cloud computing.

scholarly journals Optimized Resource Allocation Algorithm for Crowd-Creation Space Computing Based on Cloud Computing Environment

2021 ◽  
pp. 08-25
Author(s):  
Mustafa El .. ◽  
◽  
◽  
Aaras Y Y.Kraidi
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Simulated Annealing ◽  
Task Allocation ◽  
Ant Colony Algorithm ◽  
Simulated Annealing Algorithm ◽  
Ant Colony ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
Resource Allocation Algorithm

The crowd-creation space is a manifestation of the development of innovation theory to a certain stage. With the creation of the crowd-creation space, the problem of optimizing the resource allocation of the crowd-creation space has become a research hotspot. The emergence of cloud computing provides a new idea for solving the problem of resource allocation. Common cloud computing resource allocation algorithms include genetic algorithms, simulated annealing algorithms, and ant colony algorithms. These algorithms have their obvious shortcomings, which are not conducive to solving the problem of optimal resource allocation for crowd-creation space computing. Based on this, this paper proposes an In the cloud computing environment, the algorithm for optimizing resource allocation for crowd-creation space computing adopts a combination of genetic algorithm and ant colony algorithm and optimizes it by citing some mechanisms of simulated annealing algorithm. The algorithm in this paper is an improved genetic ant colony algorithm (HGAACO). In this paper, the feasibility of the algorithm is verified through experiments. The experimental results show that with 20 tasks, the ant colony algorithm task allocation time is 93ms, the genetic ant colony algorithm time is 90ms, and the improved algorithm task allocation time proposed in this paper is 74ms, obviously superior. The algorithm proposed in this paper has a certain reference value for solving the creative space computing optimization resource allocation.

An Optimal Resource Allocation Algorithm in Cloud Computing Environment

2015 ◽  
Vol 733 ◽  
pp. 779-783 ◽  
Author(s):  
Lu Dai ◽  
Jian Hua Li
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Energy Optimization ◽  
Scientific Basis ◽  
Computing Environment ◽  
Cloud Computing Environment ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm ◽  
Optimal Resource ◽  
And Performance

Resource allocation is a key technology of cloud computing. At present, the most of studies on resource allocation mainly focus on improving the overall performance by balancing the load of data center. This paper will design the experimental platform of resource allocation algorithm, energy optimization and performance analysis, obtain original achievements in scientific research ,for the resource allocation method based on immune algorithm and energy optimization in cloud computing to provide innovative ideas and scientific basis. This research has important significance for further study on resource allocation and energy optimization in cloud computing environment.

Novel resource allocation algorithms to performance and energy efficiency in cloud computing

2014 ◽  
Vol 69 (3) ◽  
pp. 1445-1461 ◽  
Author(s):  
Abbas Horri ◽  
Mohammad Sadegh Mozafari ◽  
Gholamhossein Dastghaibyfard
Keyword(s):  
Resource Allocation ◽  
Energy Efficiency ◽  
Cloud Computing ◽  
Allocation Algorithms

scholarly journals Cross-Cycled Uplink Resource Allocation over NB-IoT

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7948
Author(s):  
Ya-Ju Yu ◽  
Yu-Hsiang Huang ◽  
Yuan-Yao Shih
Keyword(s):  
Resource Allocation ◽  
Low Cost ◽  
Search Space ◽  
Resource Allocation Algorithm ◽  
Search Spaces ◽  
Half Duplex ◽  
Shared Channel ◽  
Radio Resources ◽  
The Cross ◽  
Allocation Algorithms

Before each user equipment (UE) can send data using the narrowband physical uplink shared channel (NPUSCH), each UE should periodically monitor a search space in the narrowband physical downlink control channel (NPDCCH) to decode a downlink control indicator (DCI) over narrowband Internet of Things (NB-IoT). This monitoring period, called the NPDCCH period in NB-IoT, can be flexibly adjusted for UEs with different channel qualities. However, because low-cost NB-IoT UEs operate in the half-duplex mode, they cannot monitor search spaces in NPDCCHs and transmit data in the NPUSCH simultaneously. Thus, as we observed, a percentage of uplink subframes will be wasted when UEs monitor search spaces in NPDCCHs, and the wasted percentage is higher when the monitored period is shorter. In this paper, to address this issue, we formulate the cross-cycled resource allocation problem to reduce the consumed subframes while satisfying the uplink data requirement of each UE. We then propose a cross-cycled uplink resource allocation algorithm to efficiently use the originally unusable NPUSCH subframes to increase resource utilization. Compared with the two resource allocation algorithms, the simulation results verify our motivation of using the cross-cycled radio resources to achieve massive connections over NB-IoT, especially for UEs with high channel qualities. The results also showcase the efficiency of the proposed algorithm, which can be flexibly applied for more different NPDCCH periods.

scholarly journals A new dynamic and enhanced resource allocation algorithm in cloud computing

2019 ◽  
Vol 1228 ◽  
pp. 012033
Author(s):  
T Satya Nagamani ◽  
K N V S K Vijaya Lakshmi ◽  
B Lalitha Bhavani
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm
Sign in / Sign up

Export Citation Format

Share Document