A SURVEY OF VARIANTS OF ROUND ROBIN CPU SCHEDULING ALGORITHMS

2021 ◽  
Vol 4 (4) ◽  
pp. 526-546
Author(s):  
Sunday Samuel Olofintuyi ◽  
Temidayo Oluwatosin Omotehinwa ◽  
Joshua Segun Owotogbe
Keyword(s):  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
Reference Source ◽  
The Past ◽  
Research Areas ◽  
Quantum Time ◽  
Cpu Utilization ◽  
Future Work

Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.

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.

scholarly journals Computer Music research at FEEC/Unicamp: a snapshot of 2019

2019 ◽  
Author(s):  
Tiago Tavares ◽  
Bruno Masiero
Keyword(s):  
Computer Music ◽  
Research Work ◽  
Lessons Learned ◽  
Computer Engineering ◽  
The Past ◽  
The People ◽  
Music Research ◽  
State Of Affairs ◽  
The University ◽  
Future Work

This is a lab report paper about the state of affairs in the computer music research group at the School of Electrical and Computer Engineering of the University of Campinas (FEEC/Unicamp). This report discusses the people involved in the group, the efforts in teaching and the current research work performed. Last, it provides some discussions on the lessons learned from the past few years and some pointers for future work.

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 A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems

2019 ◽  
Vol 17 (1) ◽  
pp. 90-98 ◽  
Author(s):  
Uferah Shafi ◽  
Munam Shah ◽  
Abdul Wahid ◽  
Kamran Abbasi ◽  
Qaisar Javaid ◽  
...  
Keyword(s):  
Operating System ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Processing Unit ◽  
Cpu Scheduling ◽  
Central Processing ◽  
Quantum Time ◽  
Simulation Results ◽  
Burst Time

Central Processing Unit (CPU) is the most significant resource and its scheduling is one of the main functions of an operating system. In timeshared systems, Round Robin (RR) is most widely used scheduling algorithm. The efficiency of RR algorithm is influenced by the quantum time, if quantum is small, there will be overheads of more context switches and if quantum time is large, then given algorithm will perform as First Come First Served (FCFS) in which there is more risk of starvation. In this paper, a new CPU scheduling algorithm is proposed named as Amended Dynamic Round Robin (ADRR) based on CPU burst time. The primary goal of ADRR is to improve the conventional RR scheduling algorithm using the active quantum time notion. Quantum time is cyclically adjusted based on CPU burst time. We evaluate and compare the performance of our proposed ADRR algorithm based on certain parameters such as, waiting time, turnaround time etc. and compare the performance of our proposed algorithm. Our numerical analysis and simulation results in MATLAB reveals that ADRR outperforms other well-known algorithms such as conventional Round Robin, Improved Round Robin (IRR), Optimum Multilevel Dynamic Round Robin (OMDRR) and Priority Based Round Robin (PRR)

scholarly journals MicroRNAs: Novel Players in Cancer Diagnosis and Therapies

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Aaron L. Oom ◽  
Brock A. Humphries ◽  
Chengfeng Yang
Keyword(s):  
Cancer Diagnosis ◽  
Research Finding ◽  
Research Work ◽  
Future Research ◽  
Cancer Therapies ◽  
The Past ◽  
Research Areas ◽  
Cancer Initiation ◽  
Tumor Growth And Metastasis ◽  
Potential Use

First discovered in 1993, microRNAs (miRNAs) have been one of the hottest research areas over the past two decades. Oftentimes, miRNAs levels are found to be dysregulated in cancer patients. The potential use of miRNAs in cancer therapies is an emerging and promising field, with research finding miRNAs to play a role in cancer initiation, tumor growth, and metastasis. Therefore, miRNAs could become an integral part from cancer diagnosis to treatment in future. This review aims to examine current novel research work on the potential roles of miRNAs in cancer therapies, while also discussing several current challenges and needed future research.

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.

Integrated FAHP-VIKOR model for green supplier selection in a Nickle coating SME

2020 ◽  
pp. 133-139
Author(s):  
Sanatan Ratna ◽  
B Kumar
Keyword(s):  
Staff Training ◽  
Supplier Selection ◽  
Fuzzy Ahp ◽  
Research Work ◽  
Supplier Evaluation ◽  
Green Supplier Selection ◽  
The Past ◽  
Coating Industry ◽  
Sustainability Issue ◽  
Selection Of

In the past few decades, there has been lot of focus on the issue of sustainability. This has occurred due to the growing concerns related to climate change and the growing awareness about environmental concerns. Also, the competition at global level has led to the search for the most sustainable route in the industries. The current research work deals with the selection of green supplier in a Nickle coating industry based on certain weighted green attributes. For this purpose, a hybrid tool comprising of Fuzzy AHP (Fuzzy Analytical Hierarchy) and VIKOR (VlseKriterijumska Optimizacija I Kompromisno Resenje) is used. The Fuzzy AHP is used for assigning proper weights to the selected criteria for supplier evaluation, while VIKOR is used for final supplier selection based on the weighted criteria. The three criterions for green supplier selection are, Ecological packaging, Corporate socio-environmental responsibility and Staff Training. The outcome of the integrated model may serve as a steppingstone to other SMEs in different sectors for selecting the most suitable supplier for addressing the sustainability issue.

Interrogating the Constitutionality of Federal Character Principle in Nigeria

2018 ◽  
Vol 9 (07) ◽  
pp. 20492-20498
Author(s):  
Aborisade Olasunkanmi ◽  
Christopher Agulanna
Keyword(s):  
Ethnic Groups ◽  
Research Work ◽  
National Unity ◽  
The Past ◽  
The North ◽  
Inhibiting Factors

This work interrogates federal character principle (FCP) in Nigeria. The FCP was designed to fundamentally address the striking features of Nigeria politics of intense struggles for power among the different ethnic groups in the country between the elites from the North and their Southern counterparts and the various segments, but the practice of FCP in Nigeria so far raises curiosity and doubts. Given the outcome of the interrogation, this research work discovered and conclude that federal character has not indeed achieve its objective in the Nigeria, the study finds that Ethnocentrism, Elitism, Mediocrity, Mutual suspicion amongst others accounts for some inhibiting factors of the FCP in Nigeria. Like many other provisions of the Constitution, the Federal Character principle was meant to correct some imbalances experienced in the past, but it has created more problems than it has attempted to solve. Rather than promote national unity, it has disunited Nigerians. There is an urgent need to use more of professionals and result oriented Nigerians to carry out national tasks, than to use unprogressive people due to this "Federal character" issue. Nigeria should be a place where one's track records and qualifications are far greater than just "where they come from" or their lineage if Nigerian truly want to progress.

Temporal Focus

2020 ◽  
Author(s):  
Abbie J. Shipp
Keyword(s):  
Well Being ◽  
Psychology Research ◽  
The Past ◽  
Research Areas ◽  
The Future ◽  
Behavior Based ◽  
The Individual ◽  
And Behavior ◽  
Temporal Focus

Temporal focus is the individual tendency to characteristically think more or less about the past, present, and future. Although originally rooted in early work from psychology, research on temporal focus has been steadily growing in a number of research areas, particularly since Zimbardo and Boyd’s (1999) influential article on the topic. This chapter will review temporal focus research from the past to the present, including how temporal focus has been conceptualized and measured, and which correlates and outcomes have been tested in terms of well-being and behavior. Based on this review, an agenda for research is created to direct temporal focus research in the future.

Sign in / Sign up

Export Citation Format

Share Document