Log in

Relevant bibliographies by topics / Round Robin Algorithm

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Academic literature on the topic 'Round Robin Algorithm'

Author: Grafiati

Published: 5 June 2025

Last updated: 24 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Round Robin Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Round Robin Algorithm"

1

Purnomo, Rakhmat, and Tri Dharma Putra. "Comparison Between Simple Round Robin and Improved Round Robin Algorithms." JATISI (Jurnal Teknik Informatika dan Sistem Informasi) 9, no. 3 (2022): 2205–21. http://dx.doi.org/10.35957/jatisi.v9i3.2547.

Full text

Abstract:

The objective of this journal is to compare the efficiency between these two algorithms, the simple round robin and improved round robin algorithms. In real time systems algorithm, round robin plays a significant role to be used in embedded systems. Here we compare the average turn around time and average waiting time, also number of context switching between these two algorithms. Improved round robin algorithm, is an algorithm where if the remaining burst time is less than the allocated time quantum then the running process is executed. Then remove the currently running process from ready queue and put it in the tail of the ready queue while in simple round robin algorithm the remaining burst time will be executed until finish as scheduled. This comparison proves that improved round robin algorithm is more efficient, with lower average turn around time and lower average waiting time, lower context switching. There by this increases the system throughput.

APA, Harvard, Vancouver, ISO, and other styles

2

Putra, Tri Dharma, and Rakhmat Purnomo. "Comparison Between Simple Round Robin and Improved Round Robin Algorithms." JATISI (Jurnal Teknik Informatika dan Sistem Informasi) 10, no. 1 (2023): 266–72. http://dx.doi.org/10.35957/jatisi.v10i1.4824.

Full text

Abstract:

The objective of this journal is to compare the efficiency between these two algorithms, the simple round robin and improved round robin algorithms. In real time systems algorithm, round robin plays a significant role to be used in embedded systems. Here we compare the average turn around time and average waiting time, also number of context switching between these two algorithms. Improved round robin algorithm, is an algorithm where if the remaining burst time is less than the allocated time quantum then the running process is executed. Then remove the currently running process from ready queue and put it in the tail of the ready queue while in simple round robin algorithm the remaining burst time will be executed until finish as scheduled. This comparison proves that improved round robin algorithm is more efficient, with lower average turn around time and lower average waiting time, lower context switching. There by this increases the system throughput.

APA, Harvard, Vancouver, ISO, and other styles

3

Supreeth, S., and Biradar Shobha. "Scheduling Virtual Machines for Load balancing in Cloud Computing Platform." International Journal of Science and Research (IJSR) 2, no. 6, June 2013 (2013): 437–41. https://doi.org/10.5281/zenodo.6423763.

Full text

Abstract:

Cloud computing enables developers to automatically deploy applications during task allocation and storage distribution by using distributed computing technologies in numerous servers. To gain the maximum benefit from cloud computing, developers must design mechanisms that optimize the use of architectural and deployment paradigms. The role of Virtual Machine’s (VMs) has emerged as an important issue because, through virtualization technology, it makes cloud computing infrastructures to be scalable. Therefore developing on optimal scheduling of virtual machines is an important issue. In this paper a analysis of different existing Virtual Machine’s (VM’s) scheduling algorithms are done and proposed a weighted Round Robin algorithm over Round Robin algorithm in Virtual Machine environment of cloud computing in order to achieve better overall response time and processing time. The simulation results show the weighted round robin algorithm shows better improvements over Round-Robin algorithm. Then Comparison between Round Robin and Weighted Round Robin algorithm shows there is a improvement in Weighted Round Robin algorithm.

APA, Harvard, Vancouver, ISO, and other styles

4

Zouaoui, Sonia, Lotfi Boussaid, and Abdellatif Mtibaa. "Priority based round robin (PBRR) CPU scheduling algorithm." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 1 (2019): 190–202. https://doi.org/10.11591/ijece.v9i1.pp190-202.

Full text

Abstract:

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, and 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.

APA, Harvard, Vancouver, ISO, and other styles

5

Zouaoui, Sonia, Lotfi Boussaid, and Abdellatif Mtibaa. "Priority based round robin (PBRR) CPU scheduling algorithm." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 1 (2019): 190. http://dx.doi.org/10.11591/ijece.v9i1.pp190-202.

Full text

Abstract:

<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>

APA, Harvard, Vancouver, ISO, and other styles

6

Santika, Monica, and Seng Hansun. "Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang." Jurnal ULTIMATICS 6, no. 2 (2014): 94–99. http://dx.doi.org/10.31937/ti.v6i2.336.

Full text

Abstract:

Delivery of goods will normally be conducted in accordance with the queuing time of booking. Sometimes, it is inefficient and results in a delay on the delivery of goods. Therefore, to make a better scheduling system, the Shortest Job First and Round Robin algorithms been implemented. From the results of experiments, Shortest Job First and Round Robin algorithms successfully applied to the scheduling delivery application. Shortest Job First algorithm is better than Round Robin scheduling in the case of delivery of goods, because the algorithm execution process which takes small time will be moved before the process which takes much time, so it needs smaller time than using Round Robin algorithm. Index Terms - Round Robin, Scheduling, Shipping, Shortest Job First

APA, Harvard, Vancouver, ISO, and other styles

7

Et. al., D. Gritto,. "Enhanced Time Quantum based Round Robin Algorithm for Cloudlet Scheduling in Cloud Environment." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 10 (2021): 5629–38. http://dx.doi.org/10.17762/turcomat.v12i10.5374.

Full text

Abstract:

The contemporary organization integrates most of the required resources into their business environment by adopting or leasing the cloud resources that are offered by many of the remote cloud service providers. The cloud computing renders hassle free installation, deployment and maintenance of the resources. The cloud resources and services are observed to be pervasive in nature and therefore efficient technologies are to be adopted in order ensure the effective resource utilization and optimal service delivery to the cloud users. Generally virtualization, optimal scheduling techniques like cloudlet scheduling, virtual machine scheduling and load balancing strategies maximize the resource utilization and service delivery. This paper outlines the foundation concepts of cloud computing and proposes an algorithm named Enhanced Time Quantum based Round Robin Algorithm (ETQRRA). The ETQRRA is proposed to reduce the response time, waiting time, turnaround time and the number of context switching. The result of ETQRRA algorithm is compared with various versions of the existing Round Robin algorithms like Classic Round Robin Algorithm (CRR), Improved Shortest Remaining Burst Round Robin (ISRBRR), Half Life Variable Quantum Time Round Robin (HLVQTRR), Improved Round Robin Varying Quantum (IRRVQ) and Dynamic Time Quantum Round Robin (DTQRR) algorithms to prove the efficiency of ETQRRA. The comparative study shows the performance of ETQRRA outdo the other algorithms taken for the comparison.

APA, Harvard, Vancouver, ISO, and other styles

8

Putra, Tri Dharma, and Rakhmat Purnomo. "Average Max Round Robin Algorithm: A Case Study." sinkron 8, no. 4 (2023): 2662–69. http://dx.doi.org/10.33395/sinkron.v8i4.12051.

Full text

Abstract:

Round Robin Algorithm is one wellknown algorithm in real time system. Several variants of round robin algorithms are in the fields. Average max round robin algorithm is a breakthrough to optimize context switching or also called quantum. Context switching is one big problem in round robin algorithm. To optimize high context switching is the key solution. This will make this algorithm efficient. There should be a way to optimize this context switching. Then the average max round robin algorithm is one solution to this problem. The average max algorithm is defined by finding the average of burst time then add the maximum burst time to the average burst time. Then calculate again the average of the two. The calculation will be iterated in the next round robin cycle. Here, in this journal, three case studies are discussed. Each with different burst times to understand this average max round robin algorithm more clearly. In the first case study we get turn around time 34 ms, and average waiting time 20.6 ms. In the second case study, we get average turn around time 21.8 ms, and the average waiting time 13 ms. And in the last case study, the third one, we get turn around time 12.2 ms, and the average waiting time 6.6 ms. There is no calculation for the second iteration for all case studies. Since the left burst time is only in one process. Optimizing the context switching, minimizing average turnaround time, and average waiting time is the key solution to round robin algorithm.

APA, Harvard, Vancouver, ISO, and other styles

9

Putra, Tri Dharma, and Rakhmat Purnomo. "Average Max Round Robin Algorithm: A Case Study." Sinkron 8, no. 3 (2023): 1230–37. http://dx.doi.org/10.33395/sinkron.v8i3.12051.

Full text

Abstract:

Round Robin Algorithm is one wellknown algorithm in real time system. Several variants of round robin algorithms are in the fields. Average max round robin algorithm is a breakthrough to optimize context switching or also called quantum. Context switching is one big problem in round robin algorithm. To optimize high context switching is the key solution. This will make this algorithm efficient. There should be a way to optimize this context switching. Then the average max round robin algorithm is one solution to this problem. The average max algorithm is defined by finding the average of burst time then add the maximum burst time to the average burst time. Then calculate again the average of the two. The calculation will be iterated in the next round robin cycle. Here, in this journal, three case studies are discussed. Each with different burst times to understand this average max round robin algorithm more clearly. In the first case study we get turn around time 34 ms, and average waiting time 20.6 ms. In the second case study, we get average turn around time 21.8 ms, and the average waiting time 13 ms. And in the last case study, the third one, we get turn around time 12.2 ms, and the average waiting time 6.6 ms. There is no calculation for the second iteration for all case studies. Since the left burst time is only in one process. Optimizing the context switching, minimizing average turnaround time, and average waiting time is the key solution to round robin algorithm.

APA, Harvard, Vancouver, ISO, and other styles

10

Putra, Muhammad Taufik Dwi, Haryanto Hidayat, Naziva Septian, and Tiara Afriani. "Analisis Perbandingan Algoritma Penjadwalan CPU First Come First Serve (FCFS) Dan Round Robin." Building of Informatics, Technology and Science (BITS) 3, no. 3 (2021): 207–12. http://dx.doi.org/10.47065/bits.v3i3.1047.

Full text

Abstract:

CPU scheduling is important in multitasking and multiprocessing an operating system because of the many processes that need to be run in a computer. This causes the operating system to need to divide resources for running processes. CPU scheduling has several algorithms in it such as First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR) algorithms. The writing of this study is intended to compare the First Come First Serve and Round Robin algorithms with four specified parameters namely Average Turn Around Time, Waiting Time, Throughput, and CPU Utilization. The experiment was conducted with the First Come First Serve algorithm and the Round Robin of three different Quantum Times. These calculations at different quantum times aim to find out if the differences affect the advantages of the Round Robin algorithm over the First Come First Serve algorithm. The conclusion is that the First Come First Serve (FCFS) algorithm is superior to the Round Robin (RR) algorithm. This is indicated by the average turn around time, waiting time, and throughput values of the First Come First Serve algorithm more effective in running the process

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Round Robin Algorithm"

1

Manisekaran, Pradheep [Verfasser]. "A Novel Approach To Enhance The Performance Of Cloud Computing File System Using Load Balancing Algorithm : A Model To Enhance The Performance Of Cloud Computing File System Using Round Robin Algorithm / Pradheep Manisekaran." München : GRIN Verlag, 2015. http://d-nb.info/1184037043/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Pun, Kong Hong. "Static round-robin scheduling algorithms for scalable switches /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20PUN.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.<br>Includes bibliographical references (leaves 47-48). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

3

Grenier, Mathieu. "Optimisation de l'ordonnancement sous contrainte de faisabilité." Phd thesis, Institut National Polytechnique de Lorraine - INPL, 2007. http://tel.archives-ouvertes.fr/tel-00192466.

Full text

Abstract:

Notre objectif est la conception d'algorithmes d'ordonnancement temps réel en-ligne faisables (i.e., garantissant le respect des contraintes temporelles imposées au systèmes) optimisant 1) l'utilisation de la plate-forme d'exécution (i.e., utiliser au mieux le potentiel de la plate-forme d'exécution tout en garantissant le respect des contraintes temporelles imposées au système) et/ou 2) optimisant des critères de performances<br />propres à l'application.<br /> <br />Deux cas ont été analysés : le cas de tâches indépendantes périodiques s'exécutant sur un processeur et le cas de flux de messages indépendants périodiques sur un réseau de terrain avec accès au médium priorisé.<br /><br />Nous avons donc proposé pour traiter les deux problèmatiques abordées :<br />1) des méthodes de configurations permettant d'optimiser l'utilisation de la plate-forme d'exécution en fixant d'une manière appropriée les paramètres : des politiques ou des activités du système considéré. Deux études ont été conduites dans ce cadre~: l'allocation des ``offsets'' dans les systèmes ``offset free'' et l'allocation de priorités, de politiques et de quantum dans<br />les systèmes conformes au standard Posix~1003.1b,<br />2) une nouvelle classe de politiques d'ordonnancement permettant<br />d'optimiser des critères de performances propres à l'application.

APA, Harvard, Vancouver, ISO, and other styles

4

Grenier, Mathieu. "Optimisation de l'ordonnancement sous contrainte de faisabilité." Electronic Thesis or Diss., Vandoeuvre-les-Nancy, INPL, 2007. http://www.theses.fr/2007INPL076N.

Full text

Abstract:

L’objectif que nous nous sommes fixés dans ce travail est la conception d’algorithmes d’ordonnancement temps réel en-ligne faisables optimisant l’utilisation de la plate-forme d’exécution et/ou des critères applicatifs de qualité de service propres à l’application. Nous avons en particulier étudié l’ordonnancement d’activités sur une ressource unique. Deux cas ont été analysés : le cas de tâches indépendantes périodiques s’exécutant sur un processeur et le cas de flux de messages indépendants périodiques sur un réseau de terrain avec accès au médium priorisé. Nos contributions reposent sur le “modèle classique” de l’ordonnancement temps réel où le système est représenté par un ensemble d’activités périodiques indépendantes et deux problématiques ont été abordées : • optimisation de l’utilisation de la plate-forme d’exécution : utiliser au mieux le potentiel de la plate-forme d’exécution tout en garantissant le respect des contraintes temporelles imposées au système ; ceci optimise le nombre de configurations faisables, • optimisation des critères applicatifs de qualité de service propres à l’application (i.e., pris en compte des performances de l’application autre que la faisabilité) : garantir les contraintes de temps tout en optimisant les performances de l’application. Nous avons donc proposé : • des méthodes de configurations permettant d’optimiser l’utilisation de la plate-forme d’exécution (i.e., maximiser faisabilité) en fixant les paramètres des politiques ou des systèmes considérés d’une manière appropriée. Deux études ont été conduites dans ce cadre : • allocation des “offsets” dans les systèmes “offset free”, • allocation de priorités, de politiques et de quantum dans les systèmes conformes au standard Posix 1003.1b, • une nouvelle classe de politiques d’ordonnancement permettant d’optimiser des critères de performances propres à l’application. De plus, une analyse d’ordonnancement générique pour cette classe a été proposée<br>Our goal is to come up with feasible (i.e., all required time constraints are met) on-line real-time scheduling algorithms. These algorithms have to optimise 1) the utilisation of the execution platform (i.e., meet time constraints and use platform at its fullest potential) and/or 2) optimise the application dependent performance criteria. We study two cases : the case of independent periodic tasks scheduled on a processor and the case of periodic traffic streams scheduled on a priority bus. To deal with these two problems, we propose : • Configuration methods to allow to optmlise the utilisation rate of the execution platform by setting the parameters of the policies or of the activities of the considered system. We perform two studies : the allocation of offsets in "Offset free" systems (I.E., offsets can be chosen off-line) and the priorities, policies and quantum allocations in systems compliant to the standard Posix 1003.1B, • A new class of scheduling policies to allow optimising application performance dependent criteria

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Shih-Hao, and 劉士豪. "Hierarchical Deficit Round-Robin Packet Scheduling Algorithm." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/60137723094365177749.

Full text

Abstract:

碩士<br>國立東華大學<br>資訊工程學系<br>101<br>In the paper, we propose Hierarchical Deficit Round-Robin (HDRR) packet scheduling algorithm for multiple classes of service to provide a fair share of residual bandwidth with lower computation complexity. We design HDRR based on the Deficit Round-Robin packet scheduling algorithm, and can distribute bandwidth in proportion to weights of flows sharing the bandwidth, and share the unused bandwidth to backlogged flows according to the hierarchical architecture. In order to realize the performance differences be-tween the proposed scheduling algorithm and the other related scheduling algorithms, we implement the pro-posed scheduling algorithm in our simulation. The simulation results show that the proposed algorithm provides well QoS guarantees while fully utilizing the system bandwidth and low computation complexity.

APA, Harvard, Vancouver, ISO, and other styles

6

UPADHYAY, ANURAG. "OPTIMIZATION IN ROUND ROBIN PROCESS SCHEDULING ALGORITHM." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14872.

Full text

Abstract:

One of the most important tasks of an operating system is to share and schedule resources among various competing processes. This task is achieved through various process scheduling algorithms. In this regard, Round Robin (RR) algorithm certainly is one of the most popular algorithms. In this algorithm, a static time quantum is given to each process. However it suffers from certain problems which are mainly related to the size of time quantum. Larger the time quantum, larger is the response and waiting time of processes. Similarly if the time quantum is too small then the overhead of CPU increases because CPU has to perform greater number of context switches. This thesis focuses on the optimization techniques in Round Robin algorithm. Several algorithms have been proposed which use a dynamic time quantum, rather than a static one. The concept of mean, median, dispersion and others are used to calculate time quantum for processes in ready queue based on their remaining burst time. An approach based on multiple time quanta has also been proposed. Finally it has been shown through implementation and results that these algorithms are able to solve the problems of conventional Round Robin algorithm. A better turnaround time, response time and waiting time has been achieved through the implementation of these algorithms.

APA, Harvard, Vancouver, ISO, and other styles

7

Lin, Kun-Xuan, and 林琨絢. "Low Complexity Packet Scheduling Algorithm: Adaptive Fair Queuing with Round-Robin." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/58810698448679516700.

Full text

Abstract:

碩士<br>國立雲林科技大學<br>電子與資訊工程研究所<br>94<br>The rapid growths of Internet bandwidth and Internet user have increased the complexity of network management. At the same time the contents of transmission in Internet trends to be pluralistic. It is not enough of only relying on the original best-effort IP protocol to support the required quality of service (QoS) for each application. In order to offer steady communication environment and QoS, the moderately bandwidth management is considered in network design. In general, the network bandwidth management can be classified into two parts of packet buffer management and packet scheduling. In this thesis, we target on the design of packet scheduling for the network bandwidth management and propose an Adaptive Fair Queuing with Round Robin (AFQRR) scheme. Based on Round Robin technique, the AFQRR has the properties of lower complexity and higher accuracy. According to the assigning weight of flows, the AFQRR can fairly to allocate the corresponding bandwidth for each flow. In the part of complexity, the computation of both the amount of allowing transmission for each flow and the next transmission flow selection are all of O(1). With the NS2 simulation tool, the simulation results reveal that the AFQRR scheduling algorithm has a better performance in the part of fair bandwidth allocation and of packet delay.

APA, Harvard, Vancouver, ISO, and other styles

8

Chen, Wei-Ming, and 陳偉民. "Dynamic Bandwidth Allocation Using Enhanced Deficit Round Robin Algorithm for EPON." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/08989963026928925806.

Full text

Abstract:

碩士<br>國立交通大學<br>電信工程研究所<br>98<br>Due to multimedia programs are increased and developed nowadays, the required bandwidth to many users is increased rapidly, too. The advantage of light is high transmission rate, low bit error rate, and extremely low signal attenuation. Therefore, optical network is the best choice to build next generation high speed network. In order to achieve dynamic bandwidth allocation and satisfy the demand for quality of service, the decrease in packet delay and delay variance are both the most important issues for us to improve. In this article, we focus mainly on management of upstream traffic on EPON. The purpose of this algorithm is that bandwidth can be allocated fairly through adaptive modified the original. Furthermore, we also successfully decrease the mean packet delay and delay variance. A detailed description of the algorithm will be given in the text and the simulation result will show it can really achieve our requirements.

APA, Harvard, Vancouver, ISO, and other styles

9

LI, DONG-YU, and 李東宇. "Weighted Round-Robin with Threshold Algorithm to Load Balance on SDN." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/58860627269954684831.

Full text

Abstract:

碩士<br>銘傳大學<br>電腦與通訊工程學系碩士班<br>104<br>In this thesis, we adopt the characteristics of SDN(Software Defined Network) to implement dynamic load balancing. We propose a weighted round-robin with threshold algorithm to balance the loads based on SDN. When available bandwidth of link is lower than the defined threshold, the link will not be added to the load balancing; otherwise, the link will be added to the load balancing. In the simulation results, we can observe that this proposed algorithm will achieve better performance.

APA, Harvard, Vancouver, ISO, and other styles

10

Syu, Ting-yu, and 許庭瑜. "Efficient Xen vCPU scheduler Using Distribute Weighted Round-Robin Scheduling Algorithm." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/75280689937721126362.

Full text

Abstract:

碩士<br>大同大學<br>資訊工程學系(所)<br>100<br>Virtualization can let one physical machine to simulate multiple virtual machines simultaneously, and it has many advantages such as better system utilization, energy conservation, resource quantification, and more easily to manage system. With these advantages, virtualization become the technology which is widely used to support cloud computing. With the computer hardware industry promote multi-core system continuously, how to allocate hardware resources to the virtual machine between physical CPUs becomes the key issue of which affects the overall system performance. Credit Scheduler is Xen default virtual CPU scheduler, having better fairness for multi-core systems with global load balancing, but bad performance for latency-sensitive workloads. In order to solve this problem, this paper proposed the Distribute Weighted Round-Robin scheduling algorithm using on Xen virtual CPU scheduler, it can get less response time for latency-sensitive workloads, also have good fairness, so that enhance 20% to 33% of the performance of the Xen virtualization system.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Round Robin Algorithm"

1

McGuire, Christopher, and Jeonghwa Lee. "The Adaptive80 Round Robin Scheduling Algorithm." In Transactions on Engineering Technologies. Springer Netherlands, 2015. http://dx.doi.org/10.1007/978-94-017-7236-5_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Matsumoto, Tsuyoshi. "Competitive analysis of the Round Robin algorithm." In Algorithms and Computation. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56279-6_59.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zahedi, M. H., M. Ghazizadeh, and M. Naghibzadeh. "Fuzzy Round Robin CPU Scheduling (FRRCS) Algorithm." In Advances in Computer and Information Sciences and Engineering. Springer Netherlands, 2008. http://dx.doi.org/10.1007/978-1-4020-8741-7_63.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Upadhyay, Anurag, and Hitesh Hasija. "Optimization in Round Robin Process Scheduling Algorithm." In Advances in Intelligent Systems and Computing. Springer India, 2016. http://dx.doi.org/10.1007/978-81-322-2752-6_45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chen, Min-Xiou, and Shih-Hao Liu. "Hierarchical Deficit Round-Robin Packet Scheduling Algorithm." In Advances in Intelligent Systems and Applications - Volume 1. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35452-6_43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Choi, Jin Seek, Bum Sik Bae, Hyeong Ho Lee, and Hyeung Sub Lee. "Round-Robin Scheduling Algorithm with Multiple Distributed Windows." In Information Networking: Wireless Communications Technologies and Network Applications. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45801-8_76.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gupta, Chhaya, and Kirti Sharma. "Fluctuating Time Quantum Round Robin (FTQRR) CPU Scheduling Algorithm." In First International Conference on Sustainable Technologies for Computational Intelligence. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0029-9_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Vayadande, Kuldeep, Aditya Bodhankar, Ajinkya Mahajan, Diksha Prasad, Riya Dhakalkar, and Shivani Mahajan. "An Improved Way to Implement Round Robin Scheduling Algorithm." In Lecture Notes in Electrical Engineering. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-6690-5_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sharma, Priyanka, and Yatendra Mohan Sharma. "An Efficient Customized Round Robin Algorithm for CPU Scheduling." In Lecture Notes in Networks and Systems. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-15-9689-6_68.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Vyakaranal, Shashidhara B., and Jayalaxmi G. Naragund. "Weighted Round-Robin Load Balancing Algorithm for Software-Defined Network." In Lecture Notes in Electrical Engineering. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-5802-9_35.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Round Robin Algorithm"

1

Qais Mirkar, Sulalah, Amiksha Bobal, and Sanjana Gattani. "Agile Time Quantum Round Robin Algorithm." In 2024 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES). IEEE, 2024. https://doi.org/10.1109/spices62143.2024.10779685.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Kanani, Jash, Param Makwana, Yash Kalbhor, and Vikram Kulkarni. "Progressive Round Robin CPU Scheduling Algorithm for Operating Systems." In 2024 5th IEEE Global Conference for Advancement in Technology (GCAT). IEEE, 2024. https://doi.org/10.1109/gcat62922.2024.10923888.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Patil, Anagha, Komal Rohan Shringarpure, Kunal Patil, Shreya Kathe, Sangini Shetty, and Sridhar Pillai. "RoundGen: Sports Event Scheduler using Genetic and Round Robin Algorithm." In 2025 3rd International Conference on Intelligent Data Communication Technologies and Internet of Things (IDCIoT). IEEE, 2025. https://doi.org/10.1109/idciot64235.2025.10914869.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Srujana, R., Y. Mohana Roopa, and M. Datta Sai Krishna Mohan. "Sorted Round Robin Algorithm." In 2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI). IEEE, 2019. http://dx.doi.org/10.1109/icoei.2019.8862609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Singh, Montek, and Rohit Agrawal. "Modified Round Robin algorithm (MRR)." In 2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI). IEEE, 2017. http://dx.doi.org/10.1109/icpcsi.2017.8392238.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mora, Hafsatu, Saleh E. Abdullahi, and Sahalu B. Junaidu. "Modified Median Round Robin Algorithm (MMRRA)." In 2017 13th International Conference on Electronics, Computer and Computation (ICECCO). IEEE, 2017. http://dx.doi.org/10.1109/icecco.2017.8333325.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mangukia, Ayush, Mohammed Ibrahim, Soorya Golamudi, Nishant Kumar, and M. Anand Kumar. "Improved Variable Round Robin Scheduling Algorithm." In 2021 12th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2021. http://dx.doi.org/10.1109/icccnt51525.2021.9579716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Singh Sehgal, Manpreet, Nandini Bansal, Saloni Dhingra, Ashish Bansal, Pransh Rastogi, and Twinkle Sehgal. "Optimizing Round Robin Algorithm in Operating System." In 2022 International Conference on Smart and Sustainable Technologies in Energy and Power Sectors (SSTEPS). IEEE, 2022. http://dx.doi.org/10.1109/ssteps57475.2022.00051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Tychalas, Dimitrios, and Helen Karatza. "An Advanced Weighted Round Robin Scheduling Algorithm." In PCI 2020: 24th Pan-Hellenic Conference on Informatics. ACM, 2020. http://dx.doi.org/10.1145/3437120.3437304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chitaliya, Paarshva, Samruddhi Kulkarni, Arya Telang, Dishant Zaveri, Aditya Shah, and Khushali Deulkar. "Time Quantum Optimization in Round Robin Algorithm." In 2023 International Conference on Network, Multimedia and Information Technology (NMITCON). IEEE, 2023. http://dx.doi.org/10.1109/nmitcon58196.2023.10276146.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!