Relevant bibliographies by topics / Round Robin (RR) Scheduling Algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Round Robin (RR) Scheduling Algorithm'

Author: Grafiati
Published: 4 June 2025
Last updated: 14 July 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 (RR) Scheduling 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 (RR) Scheduling Algorithm"

1

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
2

Divya, M. O., and T. M. Prajesha. "INTELLIGENT ROUND ROBIN SCHEDULING ALGORITHM WITH DYNAMIC TIME QUANTUM." International Journal of Advances in Engineering & Scientific Research 2, no. 8 (2015): 05–09. https://doi.org/10.5281/zenodo.10726962.

Full text
Abstract:
<strong>Abstract: </strong> &nbsp; <em>In this paper, we have studied various algorithms for scheduling of the processes in Operating System (OS). Amongst all the algorithms, Round Robin (RR) performs optimally in timeshared system because each process is given an equal amount of static time quantum. But the effectiveness of RR algorithm solely depends upon the choice of time quantum. We have made a comprehensive study and analysis of RR algorithm. We have proposed a new Improved-RR algorithm Intelligent RR (Intelligent Round Robin) by using Intelligent Time Slice. Our experimental analysis shows that Intelligent RR performs better than RR algorithm in terms of reducing the number of context switches, average waiting time and average turnaround time.</em> <strong><em>Keywords:</em></strong> Operating System, Scheduling Algorithm, Round Robin, Context switch, Waiting time, Turnaround time.
APA, Harvard, Vancouver, ISO, and other styles
3

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:
&lt;p&gt;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.&lt;/p&gt;
APA, Harvard, Vancouver, ISO, and other styles
4

Shafi, Uferah, Munam Shah, Abdul Wahid, et al. "A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems." International Arab Journal of Information Technology 17, no. 1 (2019): 90–98. http://dx.doi.org/10.34028/iajit/17/1/11.

Full text
Abstract:
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)
APA, Harvard, Vancouver, ISO, and other styles
5

Kumar, Anil, Amit Kumar Gupta, Deepak Panwar, Sandeep Chaurasia, and Dinesh Goyal. "Operating system security with discrete mathematical structure for secure round robin scheduling method with intelligent time quantum." Journal of Discrete Mathematical Sciences and Cryptography 26, no. 5 (2023): 1519–33. http://dx.doi.org/10.47974/jdmsc-1816.

Full text
Abstract:
These days, the problems of scheduling and security are increasingly pressing as a result of the rapidly growing number of implementations that are operated in operating systems. Process scheduling and scheduling security is the most effective methodology of operating a system which can improve and degrade the performance of the computer system. The performance of scheduling algorithm in operating system can be measured by scheduling principles like average waiting time, average turnaround time, response time, throughput etc. Much research carried out over operating system security and round robin scheduling used in time sharing operating system in previous years to resolve the issues regarding to improvement in the performance of round robin (RR) scheduling and improving the security in the scheduling approach. This study discussed the security issues in operating systems, scheduling security and discrete structure of a new approach for RR scheduling. The researcher has suggested a list of policy for scheduling method security and proposed a new approach for RR scheduling and investigated the scheduling principles. The proposed methodology covers distinctive strategy for selection manner of process from ready queue than RR and used diverges time quantum. The proposed methodology has been validated experimentally by comparing with a numerous scheduling algorithm namely as Round Robin (RR), Adaptive Round Robin (ARR), Round Robin Remaining time (RRRT), improved Round Robin (IRR), an additional improvement on the improved Round Robin (AAAIRR), and an Enhanced Round Robin (ERR). Numerous simulations have been conducted to validate the effectiveness of the proposed algorithm to compelling the performance of system. At the conclusion the performance of computing system is dependent on security of operating system as well as secluding methods.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

Abukari, Arnold Mashud, Edem Kwedzo Bankas, and Mohammed Muniru Iddrisu. "An Enhanced Load Balancing Algorithm for Cloud Enterprise Resource Planning (ERP) Data in a Multi-Cloud Environment." Asian Journal of Research in Computer Science 16, no. 3 (2023): 197–209. http://dx.doi.org/10.9734/ajrcos/2023/v16i3356.

Full text
Abstract:
Businesses and individuals have seen the need to adopt the cloud and mulit-cloud environment for their businesses and storage of data. The load balancing concerns especially in the multi-cloud environment was investigated and a new algorithm proposed. In this research, a proposed new load balancing algorithm is presented and compared with the Round Robin (RR) and Weighted Round Robin (WRR) algorithms. The proposed scheduling algorithm considered several Cloud ERP Data chunks to analyse the data transmission rate or throughput, the transmission delay, data loss and the Cloud ERP Data drop ratio. The proposed algorithm performed better compared to the Round Robin (RR) and Weighted Round Robin (WRR) in a multi cloud environment with data chunks above 150 in terms of throughput. The proposed algorithm again outperformed the RR and WRR with a recorded lower transmission delays and lower data loss.
APA, Harvard, Vancouver, ISO, and other styles
8

Qazi, Farheen, Dur-e.-Shawar Agha, Muhammad Naseem, Shahnila Badar, and Fozia Hanif Khan. "Improving Round Robin Scheduling with Dynamic Time Quantum (IRRDQ)." Journal of Applied Engineering & Technology (JAET) 7, no. 2 (2023): 70–82. http://dx.doi.org/10.55447/jaet.07.02.115.

Full text
Abstract:
In the realm of real-time and multitasking environments, the Round Robin (RR) CPU scheduling algorithm is extensively utilized. Renowned for its fairness and avoidance of process starvation, RR allocates a specific time quantum to each process. However, the frequent context switching between processes during CPU scheduling, owing to the short time quantum, can adversely impact system performance by increasing average waiting time and response waiting time. To address these concerns, this paper introduces "Improving Round Robin Scheduling Using Dynamic Time Quantum (IRRDQ)," a modified version of RR aimed at diminishing turnaround time, average waiting time, and context switching. In our proposed approach, we arrange all incoming processes based on minimum burst time and dynamically assign an optimal time quantum to each process using the Shortest Job First (SJF) algorithm. The computation of time quantum is tailored to the burst times of individual processes. Through experimental demonstrations, we showcase the significant performance improvement of our algorithm compared to RR and other existing algorithms.
APA, Harvard, Vancouver, ISO, and other styles
9

Bhati, Roshi, Rahul Thambi, and Nikhil Nerurkar. "Various Variants of Round Robin Scheduling Algorithm." International Journal for Research in Applied Science and Engineering Technology 12, no. 7 (2024): 888–93. http://dx.doi.org/10.22214/ijraset.2024.63675.

Full text
Abstract:
Abstract: In order to use the computer processor efficiently, different scheduling algorithms are used to manage the executionof multiple processes. One popular algorithm is called Round Robin (RR), where each process is given a short amount of time to run on the processor before switching to the next process inthe queue. The length of this time period, called a time quantum, is important in determining how efficient the scheduling is. If the time quantum is too long, it can increase the time it takes for a process to respond. If it is too short, it can increase the amount of time the processor spends switching between processes instead of actually executing them. In this paper, we explore different variants of the RR algorithm and compare their performancein terms of waiting time, turnaround time, and the number of times the processor switches between processes.
APA, Harvard, Vancouver, ISO, and other styles
10

Putra, Tri Dharma, and Rakhmat Purnomo. "Simulation of Priority Round Robin Scheduling Algorithm." Sinkron 7, no. 4 (2022): 2170–81. http://dx.doi.org/10.33395/sinkron.v7i4.11665.

Full text
Abstract:
In this journal, simulation of priority round robin scheduling algorithm is presented. To imitate the processes of operating system operation, simulation can be used. By simulation, model is used, namely models that represent the characteristics or behaviour of systems. Process scheduling is one important operation in operating system. OS-SIM can be used to model and simulate the operations of process scheduling. Some scheduling algorithms are available in modern operating systems, like First come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling or combination of these algorithms. One important scheduling algorithm for real-time or embedded system is priority round robin scheduling algorithm. Priority round robin scheduling algorithm is a preemptive algorithm. Each process is given time quantum. Each process has a priority. Here time quantum 3 is given. The higher the time quantum, the more the context switching. By the use of OS-SIM, simulation can be understood easily and thoroughly. The statistics, will be calculated automatically by the system by the simulator, like the number of context switching, average waiting time, average turn around time, and average responds time. With one example, by using quantum=3. The average turn around time is 18.25 ms. The Average Waiting Time is 12 ms. The Average Responds time is 2.75 ms. The total burst time is 25 ms.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Round Robin (RR) Scheduling Algorithm"

1

Nyberg, Angelica, and Jonas Hartman. "Evaluation of EDF scheduling for Ericsson LTE system : A comparison between EDF, FIFO and RR." Thesis, Linköpings universitet, Programvara och system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-131551.

Full text
Abstract:
Scheduling is extremely important for modern real-time systems. It enables several programs to run in parallel and succeed with their tasks. Many systems today are real-time systems, which means that good scheduling is highly needed. This thesis aims to evaluate the real-time scheduling algorithm earliest deadline first, newly introduced into the Linux kernel, and compare it to the already existing real-time scheduling algorithms first in, first out and round robin in the context of firm tasks. By creating a test program that can create pthreads and set their scheduling characteristics, the performance of earliest deadline first can be evaluated and compared to the others.<br>Schemaläggning är extremt viktigt för dagens realtidssystem. Det tillåter att flera program körs parallellt samtidigt som deras processer inte misslyckas med sina uppgifter. Idag är många system realtidssystem, vilket innebär att det finns ett ytterst stort behov för en bra schemaläggningsalgoritm. Målet med det här examensarbetet är att utvärdera schema-läggningsalgoritmen earliest deadline first som nyligen introducerats i operativsystemet Linux. Målet är även att jämföra algoritmen med två andra schemaläggningsalgoritmer (first in, first out och round robin), vilka redan är väletablerade i Linux kärnan. Det här görs med avseende på processer klassificerade som firm. Genom att skapa ett program som kan skapa pthreads med önskvärda egenskaper kan prestandan av earliest deadline first algoritmen utvärderas, samt jämföras med de andra algoritmerna.
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

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
4

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
5

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
6

Al-Khasib, Tariq Jamal. "Mini round robin : an enhanced frame-based scheduling algorithm for multimedia networks." Thesis, 2004. http://hdl.handle.net/2429/15654.

Full text
Abstract:
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today's Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) that is primarily designed for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. Most scheduling methods are based on the concept of providing a delay bound based on the bandwidth reserved by the session. The main advantage of MRR is its ability to decouple the delay from session bandwidth. This enables applications such as Voiceover- IP to demand low delay despite the low reserved bit rate of the voice sessions. MRR is computationally very efficient with an O(1) per packet work complexity, and it provides better fairness to multimedia sessions compared to other frame-based scheduling algorithms. We show that some of the most recently introduced schedulers fail to provide fairness or bounded latency under certain network conditions, and we propose a solution to overcome this problem. Finally, we present an extensive set of performance and validation test results obtained from simulations conducted using network models built for each one of the scheduling algorithms under consideration.
APA, Harvard, Vancouver, ISO, and other styles
7

Tsao, Shih-Chiang, and 曹世強. "Preemptive Deficit Round Robin: A New Scheduling Algorithm for Packet-Switched Networks." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/11858724151759771570.

Full text
Abstract:
碩士<br>國立交通大學<br>資訊科學系<br>87<br>In recent years, many packet fair queueing algorithms have been proposed to approximate GPS (generalized processor sharing). Most of them can provide low end-to-end delay bound and ensure that all connections share the link in a fair manner. However, scalability and simplicity are two more important issues in practice. Deficit Round Robin requires only O(1) work to process a packet and is simple enough to implement in hardware, but its latency is too large to tolerate as the number of flows increases. In this work, we describe a new scheme, Preemptive Deficit Round Robin, which overcomes the problem of DRR. A fixed number of pre-order queues are placed to enable the transmission order of our scheme to approximate the order of PGPS (packet by packet generalized processor sharing). We provide an analysis of delay bound and fairness which shows our scheme as the better choice among all work-conserving schedulers with a worst-case time complexity of O(1) per packet. Simulation results are also provided to further illustrate its average behavior.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Round Robin (RR) Scheduling 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

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
3

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
4

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
5

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
6

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
7

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
8

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
9

Helmy, Tarek. "Optimizing Round-Robin Scheduling Algorithm Performance in Real-Time Systems." In Communications in Computer and Information Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-68639-9_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sahu, Turendar, Sandeep Kumar Verma, Mohit Shakya, and Raksha Pandey. "An Enhanced Round-Robin-Based Job Scheduling Algorithm in Grid Computing." In International Conference on Computer Networks and Communication Technologies. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8681-6_73.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Round Robin (RR) Scheduling Algorithm"

1

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
2

Ramesh, R., R. Sujatha, R. Rajavarman, et al. "Electric vehicle charging station system using Round Robin (RR) scheduling algorithm." In INTERNATIONAL CONFERENCE ON SCIENCE, ENGINEERING, AND TECHNOLOGY 2022: Conference Proceedings. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0180560.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tufegdžić, Milica, Vladeta Jevremović, and Zvonko Petrović. "Estimation of CPU Scheduling Algorithms Efficiency Using Object Oriented Programming." In 9th International Scientific Conference Technics and Informatics in Education. University of Kragujevac, Faculty of Technical Sciences Čačak, 2022. http://dx.doi.org/10.46793/tie22.182t.

Full text
Abstract:
Modern operating systems require sophisticated strategies for computer resources management that allows efficient allocation of Computer Processing Unit (CPU) within minimal response time for active users. CPU allocation shemas use different scheduling algorithms, such as First Come First Served (FCFS), Shortest Job First (SJF), Shortest Remaining Time (SRTF), and Round Robin (RR). These algorithms will be presented and evaluated in the terms of scheduling parameters, such as average waiting time (AWT), average turnaround time (ATT), average reponse time (ART), CPU utilization and throughput. Scheduling criteria metrics is done over two sets of input data, within 20 cases, with five processes in each case. Cases in which processes have the same arrival times (ATs) and cases when processes arrive in different times are considered. Randomly generated ATs and burst times (BTs) are used as input data in executable files, obtained from C++ source codes. Files are running by clicking on proper button from Graphical User Interface (GUI), developed in Python programming language. The results for obtained values of AWT, ATT, ART, CPU utilization and throughput for all cases and for FCFS, SJF, SRTF, and RR algorithms are analyzed and compared with the aim to estimate the efficiency of proposed algorithms.
APA, Harvard, Vancouver, ISO, and other styles
4

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
5

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
6

He, Yong, Lei Gao, Guikai Liu, and Yuzhen Liu. "A Dynamic Round-robin Packet Scheduling Algorithm." In 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013). Atlantis Press, 2013. http://dx.doi.org/10.2991/iccsee.2013.675.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Riggio, Roberto, Daniele Miorandi, and Imrich Chlamtac. "Airtime Deficit Round Robin (ADRR) packet scheduling algorithm." In 2008 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, 2008. http://dx.doi.org/10.1109/mahss.2008.4660101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Arif, Salman, Saad Rehman, and Farhan Riaz. "Design of a modulus based Round Robin scheduling algorithm." In 2015 9th Malaysian Software Engineering Conference (MySEC). IEEE, 2015. http://dx.doi.org/10.1109/mysec.2015.7475226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Karapici, Alban, Enri Feka, Igli Tafa, and Alban Allkoci. "The Simulation of Round Robin and Priority Scheduling Algorithm." In 2015 12th International Conference on Information Technology - New Generations (ITNG). IEEE, 2015. http://dx.doi.org/10.1109/itng.2015.131.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pathak, Pragati, Prashant Kumar, Kumkum Dubey, Prince Rajpoot, and Shobhit Kumar. "Mean Threshold Shortest Job Round Robin CPU Scheduling Algorithm." In 2019 International Conference on Intelligent Sustainable Systems (ICISS). IEEE, 2019. http://dx.doi.org/10.1109/iss1.2019.8908071.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Round Robin (RR) Scheduling Algorithm' for particular source types:
Journal articles
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!

To the bibliography