The Feasible Job Scheduling Algorithm for Efficient Resource allocation Process in Cloud Environment

Author(s):  
J. Praveenchandar ◽  
A. Tamilarasi

2011 ◽  
Vol 42 (7) ◽  
pp. 419-425 ◽  
Author(s):  
Baomin Xu ◽  
Chunyan Zhao ◽  
Enzhao Hu ◽  
Bin Hu


Author(s):  
Johann Max Hofmann Magalhães ◽  
Saulo Henrique da Mata ◽  
Paulo Roberto Guardieiro

The design of a scheduling algorithm for LTE networks is a complex task, and it has proven to be one of the main challenges for LTE systems. There are many issues to be addressed in order to obtain a high spectral efficiency and to meet the application's QoS requirements. In this context, this chapter presents a study of the resource allocation process in LTE networks. This study starts with an overview of the main concepts involved in the LTE resource allocation, and brings two new proposals of scheduling algorithms for downlink and uplink, respectively. Simulations are used to compare the performance of these proposals with other scheduler proposals widely known and explored in the literature.



2015 ◽  
Vol 7 (3) ◽  
pp. 111 ◽  
Author(s):  
Aswin Kanagasabai ◽  
Amiya Nayak

In the past two decades, there has been a drastic increase in the mobile traffic, which is caused by the improved user experience with smart phones and its applications. In LTE system, the packet scheduler plays a vital role in the effective utilization of the resources. This field is not standardized and has immense scope of improvement, allowing vendor-specific implementation. LTE scheduling can be categorized into two extremes, namely, Opportunistic scheduling and Fairness scheduling. The Best Channel Quality Indicator (BCQI) algorithm falls under the former category while Proportional Fairness (PF) algorithm under the later. BCQI algorithm provides high system throughput than PF algorithm, however, unlike BCQI algorithm, PF algorithm considers users with poor channel condition for allocation process. In this work, a new scheduling algorithm called as Opportunistic Dual Metric (ODM) Scheduling Algorithm is proposed for LTE uplink and downlink.The objective of the algorithm is to prioritize the users with good channel condition for resource allocation, at the same time not to starve the users with poor channel conditions. The proposed algorithm has two resource allocation matrices, one being throughput-centric and the other being is fairness-centric. The uplink algorithm uses the two resource allocation matrices to allocate the resources to the users and to ensure contiguous resource allocation. The downlink algorithm is an extension of the proposed uplink algorithm avoiding uplink constraints. The downlink algorithm employs the two resource distribution matrices to provide an efficient resource allocation by expanding the allocation for the users considering intermittent resources. The performance of ODM is measured in terms of throughput, fairness. Additionally, the uplink algorithm is analyzed in terms of transmit power. From the results it is observed that the proposed algorithm has better trade-off in terms of all the performance parameters than PF scheduler and BCQI scheduler.



Author(s):  
Hongbo Yu ◽  
Yihua Lan ◽  
Xingang Zhang ◽  
Zhidu Liu ◽  
Chao Yin ◽  
...  


In real-time multimedia usage the resource allocation for the modern communication is very much needed in-order to overcome certain problems or degradation happening in the communication channels. The quality of the communication is reduced due to the TVWS (Television White Space), variable BER signal requires variable channel allocation procedures and Qos depends on the various applications. These problems in the OFDM should be corrected continuously by keeping track of channel situation so that to provide a long term video streaming in good QoS. The energy distribution for the video is high the application requirement is higher also the occurrence of multiple BER will leads to the challenging environment to control. The main objective of this paper is to enhance a Game theory based algorithm incorporated with demand optimization algorithm and scheduling algorithm for machine learning to take decision in nonlinear space, which results in a system with good channel awareness and an adaptive resource allocation process. The effect of interference due to this procedure is checked and accordingly allocations are done



2014 ◽  
Vol 1046 ◽  
pp. 359-362
Author(s):  
Xue Ying Jiang ◽  
Yao Wang ◽  
Yan Yan Meng

Job scheduling and resource allocation problems relate to the overall performance and resource utilization of Hadoop platform. This paper proposes a dynamic adaptive job scheduling algorithm based on Hadoop platform. This algorithm monitors the change of each computing resource nodes in real time. And through the feedback mechanism pass this information to the control node. It implements the purpose of assign the optimal resource for each of tasks.



Sign in / Sign up

Export Citation Format

Share Document