scholarly journals Implementation Of Hybrid Scheduler In Hadoop

2018 ◽  
Vol 7 (2.7) ◽  
pp. 868
Author(s):  
B Thirumala Rao ◽  
M Susmitha ◽  
T Swathi ◽  
G Akhil
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Priority Scheduling

The paper focusses on priority based round robin scheduling algorithm for scheduling jobs in Hadoop environment. By Using this Proposed Scheduling Algorithm it reduces the starvation of jobs. And the advantage of priority scheduling is that the process with the highest priority will be executed first. Combining the both strategies of round robin and priority scheduling algorithm a optimized algorithm is to be implemented. Which works more efficiently even after considering all the parameters of scheduling algorithm. This proposed algorithm is also compared with existing round robin and priority scheduling algorithms.  

scholarly journals Priority based round robin (PBRR) CPU scheduling algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 190
Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa
Keyword(s):  
Operating System ◽  
Real Time ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
New Approach ◽  
Real Time Operating System ◽  
Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

scholarly journals An approach for dynamically load balanced flow scheduling(DLBS) in cloud

2018 ◽  
Vol 7 (3.3) ◽  
pp. 600 ◽  
Author(s):  
Mrs. A. Sheela ◽  
Mrs. J. Ranjani
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Huge Amount ◽  
Flow Network ◽  
Open Flow ◽  
Heuristic Scheduling ◽  
Multiple Servers ◽  
Balanced Flow ◽  
Load Balanced

The Paper based on load balanced flow scheduling algorithm. This algorithm is used in which huge amount of data send to multiple servers frequently without a few traffic, isolation in open flow network. In existing load balanced algorithm based on huge amount of data send to several server but it suffers from that that algorithm is not support to other open flow networks model and transmission pattern. In this proposed load balanced scheduled algorithm with Round Robin deals with maximizing the network throughput dynamically. The (Dynamically Load Balanced Flow Scheduling) DLBS problem is formulated , considerably a efficient heuristic scheduling algorithms was developed for the two typical Open Flow network model, they have data flow from time slot. The outcome represents load-balanced scheduling algorithms Round Robin and LOBUS with effective improvement in DLBS move toward will carry to the data centers. Plenty of researchers pay large number of attention on software-defined networking.    

A Research on Dynamic Scheduling Algorithm of Real-Time Operating Systems on Uniprocessor

2011 ◽  
Vol 219-220 ◽  
pp. 40-44
Author(s):  
Kun Shang ◽  
Huan Ding
Keyword(s):  
Real Time ◽  
Operating Systems ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Priority Scheduling ◽  
The Real ◽  
Dynamic Priority ◽  
Important Measure

Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of real-time operating systems become an important measure to determine the real-time capability of a system. In this paper, we discuss the dynamic priority scheduling algorithm –Priority Inheritance Scheduling Algorithm. Then we analyze the algorithm from two aspects: description and schedulability.

scholarly journals Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique

2020 ◽  
Vol 10 (15) ◽  
pp. 5134
Author(s):  
Samih M. Mostafa ◽  
Hirofumi Amano
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
Time Cost ◽  
Cpu Scheduling ◽  
Scheduling Policy ◽  
Service Period

Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results.

Performance Evaluation of Crossbar Switch Fabrics in Core Routers

2003 ◽  
Vol 04 (02) ◽  
pp. 163-177 ◽  
Author(s):  
Wenjie Li ◽  
Yiping Gong ◽  
Bin Liu
Keyword(s):  
Performance Evaluation ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Bursty Traffic ◽  
Input Output ◽  
Traffic Models ◽  
Switch Fabrics ◽  
Design And Implementation ◽  
Simulation Results

Many researchers have pointed out that using complex scheduling algorithms in input queuing switches with virtual output queuing (VOQ) scheme can achieve 100% throughput. But these algorithms are too complex to be implemented in hardware. In this paper, based on combined input/output queuing (CIOQ) switch fabrics, we propose a simple scheduling algorithm named outlet priority round robin (OPRR). For synthetic workloads we consider, including uniform and bursty traffic models, the performance of OPRR in VOQ mode and single queue mode is evaluated respectively. Through the simulation results we show that 1) OPRR algorithm, coupled with the speedup of 2, can lead to performance very close to output queuing switches, and 2) under the same condition, OPRR algorithm in single queue mode behaves almost identically to VOQ mode. These results are very useful to direct the design and implementation of switch fabrics in core routers.

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Sign in / Sign up

Export Citation Format

Share Document