Log in

Relevant bibliographies by topics / Round Robin Algorithm / Journal articles

To see the other types of publications on this topic, follow the link: Round Robin Algorithm.

Journal articles on the topic 'Round Robin Algorithm'

Author: Grafiati

Published: 5 June 2025

Last updated: 1 August 2025

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

Select a source type:

Consult the top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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 que

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 que

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

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 canno

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 algori

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 mo

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 cl

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

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

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 Uti

APA, Harvard, Vancouver, ISO, and other styles

11

Thirumala Rao, B., M. Susmitha, T. Swathi, and G. Akhil. "Implementation Of Hybrid Scheduler In Hadoop." International Journal of Engineering & Technology 7, no. 2.7 (2018): 868. http://dx.doi.org/10.14419/ijet.v7i2.7.11084.

Full text

Abstract:

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 priorit

APA, Harvard, Vancouver, ISO, and other styles

12

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

APA, Harvard, Vancouver, ISO, and other styles

13

Putra, Tri Dharma, and Rakhmat Purnomo. "A Review on AMRR and Improved Round Robin Algorithms: Comparative Study." sinkron 8, no. 4 (2024): 2354–60. http://dx.doi.org/10.33395/sinkron.v8i4.13563.

Full text

Abstract:

Round Robin Algorithm is a dominant algorithm in real time system. Improved round robin and average max round robin, which is also called AMRR are two types with a breakthrough. Improved round robin is an algorithm where if the remaining burst time of the process is less than the quantum, then the running process will continue to be executed. Afterwards the next iteration will be executed as its turn. So, each iteration will have a vary of quantum. It is called a dynamic time quantum. Different with improved round robin, in AMRR, in every iteration, the quantum will be calculated. So, for ever

APA, Harvard, Vancouver, ISO, and other styles

14

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

APA, Harvard, Vancouver, ISO, and other styles

15

Purnomo, Rakhmat, and Tri Dharma Putra. "Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms." Sinkron 8, no. 2 (2024): 756–63. http://dx.doi.org/10.33395/sinkron.v8i2.12525.

Full text

Abstract:

Abstract: Operating system is a software acting as an interface between computer hardware and user. Operating system is known as a resource manager. The main responsibility of operating system is to handle resources of computer system. Scheduling is a key concept in computer multitasking and multiprocessing operating system design by switching the CPU among process. Shortest job first (SJF) and round robin are two wellknown algorithms in CPU processing. For shortest job first, this algorithm can be preemptived. In preemptive shortest job first, when a new process coming in, the process can be

APA, Harvard, Vancouver, ISO, and other styles

16

Ramadhan, Hardiyan Kesuma, and Sukma Wardhana. "Computer Networks Optimization using Load Balancing Algorithms on the Citrix ADC Virtual Server." Jurnal Online Informatika 6, no. 1 (2021): 103. http://dx.doi.org/10.15575/join.v6i1.672.

Full text

Abstract:

In the digital era and the outbreak of the COVID-19 pandemic, all activities are online. If the number of users accessing the server exceeds IT infrastructure, server down occurs. A load balancer device is required to share the traffic request load. This study compares four algorithms on Citrix ADC VPX load balancer: round-robin, least connection, least response time and least packet using GNS3. The results of testing response time and throughput parameters show that the least connection algorithm is superior. There were a 33% reduction in response time and a 53% increase in throughput. In the

APA, Harvard, Vancouver, ISO, and other styles

17

Abdelhameed, Safaa Taher, Noor Alhode Mohamed Alkikly, and Ferdaws Omar Alkharbash. "Optimizing Round Robin Using Machine Learning Models (KNN) in CPU scheduling." International Science and Technology Journal 35, no. 1 (2024): 1–10. https://doi.org/10.62341/sana0913.

Full text

Abstract:

Round Robin is considered as one of the most practically recognized process scheduling algorithms in CPU scheduling because it is simple and fair. However, the efficiency of Round Robin depends a lot upon the selection of an optimal time quantum. If the quantum is too small, then frequent context switches are needed by the CPU; therefore, the overhead increases, and thus, the average waiting time for the processes also becomes long. As a result, system performance is reduced as more and more CPU time is used up in context switching, instead of task execution. it may behave similarly to the Fir

APA, Harvard, Vancouver, ISO, and other styles

18

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

APA, Harvard, Vancouver, ISO, and other styles

19

Putra, Tri Dharma, and Rakhmat Purnomo. "Case Study: Improved Round Robin Algorithm." SinkrOn 7, no. 3 (2022): 950–56. http://dx.doi.org/10.33395/sinkron.v7i3.11530.

Full text

Abstract:

In this journal, discussion is given to analyse the improved round robin algorithm more thoroughly. Round robin algorithm plays a significant role to be used in embedded systems. Round robin algorithm usually applied in real-time systems. Here, three case studies are given, and also the analysis of each case study. Comparisons are given about the average turn around time and average waiting time, also number of context switching between the three case studies. Improved round robin algorithm, is a modification from the generic round robin algorithm. In improved round robin algorithm if the rema

APA, Harvard, Vancouver, ISO, and other styles

20

Xu, Zhao Di, Xiao Yi Li, and Wan Xi Chou. "Algorithms of Determining any Perfect Matching M_i of K_v." Applied Mechanics and Materials 48-49 (February 2011): 170–73. http://dx.doi.org/10.4028/www.scientific.net/amm.48-49.170.

Full text

Abstract:

A definition about edge-matrix is given. Two algorithms for solving perfect matching are obtained. Algorithms A is that perfect matching is determined by using edge coloring of edge-matrix ; Algorithm B is that perfect matching is determined by partitioning edge-matrix into sub matrix and also by solving perfect matching of a complete graph .The procedure of constructing round-robin tournament by using algorithm A and round-robin tournament by using algorithm B.

APA, Harvard, Vancouver, ISO, and other styles

21

Bagui, Sikha, and Evorell Fridge. "A Comparison of Fair Sharing Algorithms for Regulating Search as a Service API." Transactions on Networks and Communications 8, no. 6 (2021): 16–34. http://dx.doi.org/10.14738/tnc.86.9633.

Full text

Abstract:

Providers of a Search as a Service (SaaS) environment must ensure that their users will not monopolize the service or use more than their fair share of resources. Fair sharing algorithms have long been used in computer networking to balance access to a router or switch, and some of these algorithms have also been applied to the control of queries submitted to search engine APIs. If a search query’s execution cost can be reliably estimated, fair sharing algorithms can be applied to the input of a SaaS API to ensure everyone has equitable access to the search engine. The novelty of this pa

APA, Harvard, Vancouver, ISO, and other styles

22

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 combinatio

APA, Harvard, Vancouver, ISO, and other styles

23

Lenzini, Luciano, Enzo Mingozzi, and Giovanni Stea. "Performance analysis of Modified Deficit Round Robin schedulers." Journal of High Speed Networks 16, no. 4 (2007): 399–422. https://doi.org/10.3233/hsn-2007-325.

Full text

Abstract:

Deficit Round Robin (DRR) is a scheduling algorithm which provides fair queuing at O(1) complexity. However, due to its round robin structure, its latency properties are not adequate for latency-critical applications, such as voice. For this reason, router manufacturers implement variants of the DRR algorithm which guarantee lower latencies to one (or a subset of) queue(s). In this paper we evaluate the performance of two such variants, both of which are known as Modified Deficit Round Robin, currently implemented in commercial routers. The comparison is carried out analytically, by deriving t

APA, Harvard, Vancouver, ISO, and other styles

24

Nurcahya, Dimas, Siti Amatullah Karimah, and Satria Akbar Mugitama. "Performance Analysis of Scheduling Algorithms on Fog Computing using YAFS." Sinkron 8, no. 3 (2023): 1677–86. http://dx.doi.org/10.33395/sinkron.v8i3.12682.

Full text

Abstract:

A smart device that has seen more development is the Internet of Things (IoT). An IoT system implementation requires a device that can accept and handle various sorts of data. Fog Computing is a solution to the issue since the IoT demands a device that can provide Real-Time. Certainly, load balancing involves scheduling the IoT devices and data used. Because Cloud and Fog Computing models enable data growth management and deployment planning, which necessitate a quicker response from platforms and applications, processing power scheduling is essential. The purpose of this study is to evaluate

APA, Harvard, Vancouver, ISO, and other styles

25

Prasad, Vinay Kumar. "Optimized Load Balancing Using Adaptive Algorithm in Cloud Computing with Round Robin Technique." International Journal for Research in Applied Science and Engineering Technology 10, no. 7 (2022): 134–49. http://dx.doi.org/10.22214/ijraset.2022.45225.

Full text

Abstract:

Abstract: Developments in the field of computer networks have been carried out by several groups. However, there are still a lot of wrong problems one is the server load. For this reason, a system will be implemented Load Balancing with the aim of overcoming the server load which is not in accordance with its capacity and to optimize server load before and after the implementation of the Round robin Algorithm Load Balancing system on the cloud servers. The method used is the comparative method, namely researches that compares and analyze two or more symptoms, compare least connection algorithm

APA, Harvard, Vancouver, ISO, and other styles

26

Alankar, Bhavya, Gaurav Sharma, Harleen Kaur, Raul Valverde, and Victor Chang. "Experimental Setup for Investigating the Efficient Load Balancing Algorithms on Virtual Cloud." Sensors 20, no. 24 (2020): 7342. http://dx.doi.org/10.3390/s20247342.

Full text

Abstract:

Cloud computing has emerged as the primary choice for developers in developing applications that require high-performance computing. Virtualization technology has helped in the distribution of resources to multiple users. Increased use of cloud infrastructure has led to the challenge of developing a load balancing mechanism to provide optimized use of resources and better performance. Round robin and least connections load balancing algorithms have been developed to allocate user requests across a cluster of servers in the cloud in a time-bound manner. In this paper, we have applied the round

APA, Harvard, Vancouver, ISO, and other styles

27

Al-Mekhlafi, Muneer Abdullah Saeed, and Nashwan Nagi Saleh Al-Marbe. "Lower and Upper Quartiles Enhanced Round Robin Algorithm for Scheduling of Outlier Tasks in Cloud Computing." Journal of Engineering and Technological Sciences - JOEATS 1, no. 1 (2023): 67–87. http://dx.doi.org/10.59421/joeats.v1i1.1420.

Full text

Abstract:

Cloud computing is one of the top emerging technologies with huge market and enterprise potential as it provides on-demand, -based access to large-scale shared computing resources. Task scheduling is one of the most important issues in cloud computing in order to enhance performance and resource utilization while minimizing costs. Because of its simplicity and fairness, the round-robin algorithm is the ideal task scheduling algorithm, although it suffers from time complexity and cannot handle outlier tasks. Several modifications of Round Robin have bee

APA, Harvard, Vancouver, ISO, and other styles

28

Alhaidari, Fahd, and Taghreed Zayed Balharith. "Enhanced Round-Robin Algorithm in the Cloud Computing Environment for Optimal Task Scheduling." Computers 10, no. 5 (2021): 63. http://dx.doi.org/10.3390/computers10050063.

Full text

Abstract:

Recently, there has been significant growth in the popularity of cloud computing systems. One of the main issues in building cloud computing systems is task scheduling. It plays a critical role in achieving high-level performance and outstanding throughput by having the greatest benefit from the resources. Therefore, enhancing task scheduling algorithms will enhance the QoS, thus leading to more sustainability of cloud computing systems. This paper introduces a novel technique called the dynamic round-robin heuristic algorithm (DRRHA) by utilizing the round-robin algorithm and tuning its time

APA, Harvard, Vancouver, ISO, and other styles

29

Triangga, Hasta, Ilham Faisal, and Imran Lubis. "Analisis Perbandingan Algoritma Static Round-Robin dengan Least-Connection Terhadap Efisiensi Load Balancing pada Load Balancer Haproxy." InfoTekJar (Jurnal Nasional Informatika dan Teknologi Jaringan) 4, no. 1 (2019): 70–75. http://dx.doi.org/10.30743/infotekjar.v4i1.1688.

Full text

Abstract:

In IT networking, load balancing used to share the traffic between backend servers. The idea is to make effective and efficient load sharing. Load balancing uses scheduling algorithms in the process includes Static round-robin and Least-connection algorithm. Haproxy is a load balancer that can be used to perform the load balancing technique and run by Linux operating systems. In this research, Haproxy uses 4 Nginx web server as backend servers. Haproxy act as a reverse proxy which accessed by the client while the backend servers handle HTTP requests. The experiment involves 20 Client PCs that

APA, Harvard, Vancouver, ISO, and other styles

30

Chhugani, Barkha, and Mahima Silvester. "Improving Round Robin Process Scheduling Algorithm." International Journal of Computer Applications 166, no. 6 (2017): 12–16. http://dx.doi.org/10.5120/ijca2017914034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

., S. Jain, and H. Rohil. "Mode Based Round Robin Scheduling Algorithm." International Journal of Computer Sciences and Engineering 6, no. 6 (2018): 1399–403. http://dx.doi.org/10.26438/ijcse/v6i6.13991403.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Sirohi, Abhishek, Aseem Pratap, and Mayank Aggarwal. "Improvised Round Robin (CPU) Scheduling Algorithm." International Journal of Computer Applications 99, no. 18 (2014): 40–43. http://dx.doi.org/10.5120/17475-8361.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Alam. "FUZZY ROUND ROBIN CPU SCHEDULING ALGORITHM." Journal of Computer Science 9, no. 8 (2013): 1079–85. http://dx.doi.org/10.3844/jcssp.2013.1079.1085.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

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 processo

APA, Harvard, Vancouver, ISO, and other styles

35

He, Yong, Lei Gao, Gui Kai Liu, and Yu Zhen Liu. "A Dynamic Round-Robin Packet Scheduling Algorithm." Applied Mechanics and Materials 347-350 (August 2013): 2203–7. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2203.

Full text

Abstract:

This paper puts forward a new dynamic round-robin (DYRR) packet scheduling algorithm with high efficiency and good fairness. DYRR algorithm introduces dynamic round-robin concept, that is, the allowance given to each of the flows in a given round is not fixed, but is related with the number of bytes sent of this and other flows of the last round scheduling. The time complexity of the DYRR algorithm is O(1). Results from performance simulation analysis shows that DYRR algorithm can effectively smooth output burst, realize fair scheduling, and have a good time delay characteristic.

APA, Harvard, Vancouver, ISO, and other styles

36

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 r

APA, Harvard, Vancouver, ISO, and other styles

37

Nafea, Omar Anwer, and Turkan Ahmed Khaleel. "An improved throttling algorithm for fog computing networks with an additional management layer." Al-Qadisiyah Journal for Engineering Sciences 17, no. 4 (2024): 390–99. https://doi.org/10.30772/qjes.2024.146104.1089.

Full text

Abstract:

An emerging networking technique called fog computing extends cloud computing capabilities to the edge network's borders. It is employed to get around the limitations of cloud computing, like latency and bandwidth problems. Fog computing is suitable for IoT systems and applications that require real-time processing, reliable network access, low latency, and strong security. In this work, the objective is to design and implement a fog computing environment to simulate the behavior of a multi-user healthcare application, which represents the monitoring of elderly care homes in Mosul city. Severa

APA, Harvard, Vancouver, ISO, and other styles

38

Iqbal, Mansoor, Zahid Ullah, Izaz Ahmad Khan, et al. "Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling." Future Internet 15, no. 3 (2023): 104. http://dx.doi.org/10.3390/fi15030104.

Full text

Abstract:

Task scheduling algorithms are crucial for optimizing the utilization of computing resources. This work proposes a unique approach for improving task execution in real-time systems using an enhanced Round Robin scheduling algorithm variant incorporating dynamic time quantum and priority. The proposed algorithm adjusts the time slice allocated to each task based on execution time and priority, resulting in more efficient resource utilization. We also prioritize higher-priority tasks and execute them as soon as they arrive in the ready queue, ensuring the timely completion of critical tasks. We

APA, Harvard, Vancouver, ISO, and other styles

39

Biswas, Dipto, Md Samsuddoha, Md Rashid Al Asif, and Md Manjur Ahmed. "Optimized Round Robin Scheduling Algorithm Using Dynamic Time Quantum Approach in Cloud Computing Environment." International Journal of Intelligent Systems and Applications 15, no. 1 (2023): 22–34. http://dx.doi.org/10.5815/ijisa.2023.01.03.

Full text

Abstract:

Cloud computing refers to a sophisticated technology that deals with the manipulation of data in internet-based servers dynamically and efficiently. The utilization of the cloud computing has been rapidly increased because of its scalability, accessibility, and incredible flexibility. Dynamic usage and process sharing facilities require task scheduling which is a prominent issue and plays a significant role in developing an optimal cloud computing environment. Round robin is generally an efficient task scheduling algorithm that has a powerful impact on the performance of the cloud computing en

APA, Harvard, Vancouver, ISO, and other styles

40

Gao, Chenhao, and Hengyang Wu. "An Improved Dynamic Smooth Weighted Round-robin Load-balancing Algorithm." Journal of Physics: Conference Series 2404, no. 1 (2022): 012047. http://dx.doi.org/10.1088/1742-6596/2404/1/012047.

Full text

Abstract:

Abstract Load-balancing is a key component of highly available network infrastructure. Weighted round-robin is one of the important strategies to achieve load-balancing, which is a classic research subject. In recent years, the weighted round-robin algorithm has developed from static weight to dynamic. The Dynamic weighted round-robin algorithm needs further research in time-sensitive of dynamic weights and the rationality of results. Based on Nginx, this paper improves the dynamic weighting algorithm. Firstly, it proposes a method of dynamically calculating weights. The method determines the

APA, Harvard, Vancouver, ISO, and other styles

41

ElDahshan, Kamal, Afaf Abd, and Nermeen Ghazy. "Achieving Stability in the Round Robin Algorithm." International Journal of Computer Applications 172, no. 6 (2017): 15–20. http://dx.doi.org/10.5120/ijca2017915161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Youm, Dong Hyun. "Load Balancing Strategy using Round Robin Algorithm." Asia-pacific Journal of Convergent Research Interchange 2, no. 3 (2016): 1–10. http://dx.doi.org/10.21742/apjcri.2016.09.01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Khatri, Jayanti. "An Enhanced Round Robin CPU Scheduling Algorithm." IOSR Journal of Computer Engineering 18, no. 04 (2016): 20–24. http://dx.doi.org/10.9790/0661-1804022024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Nawaz Tareen, Faheem, Ahmad Naseem Alvi, Badr Alsamani, Mohammed Alkhathami, Deafallah Alsadie, and Norah Alosaimi. "EOTE-FSC: An efficient offloaded task execution for fog enabled smart cities." PLOS ONE 19, no. 4 (2024): e0298363. http://dx.doi.org/10.1371/journal.pone.0298363.

Full text

Abstract:

Smart cities provide ease in lifestyle to their community members with the help of Information and Communication Technology (ICT). It provides better water, waste and energy management, enhances the security and safety of its citizens and offers better health facilities. Most of these applications are based on IoT-based sensor networks, that are deployed in different areas of applications according to their demand. Due to limited processing capabilities, sensor nodes cannot process multiple tasks simultaneously and need to offload some of their tasks to remotely placed cloud servers, which may

APA, Harvard, Vancouver, ISO, and other styles

45

A. Sheela, Mrs, and Mrs J. Ranjani. "An approach for dynamically load balanced flow scheduling(DLBS) in cloud." International Journal of Engineering & Technology 7, no. 3.3 (2018): 600. http://dx.doi.org/10.14419/ijet.v7i2.33.14844.

Full text

Abstract:

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 form

APA, Harvard, Vancouver, ISO, and other styles

46

Zohora, Most Fatematuz, Fahiba Farhin, and M. Shamim Kaiser. "An enhanced round robin using dynamic time quantum for real-time asymmetric burst length processes in cloud computing environment." PLOS ONE 19, no. 8 (2024): e0304517. http://dx.doi.org/10.1371/journal.pone.0304517.

Full text

Abstract:

Cloud computing is a popular, flexible, scalable, and cost-effective technology in the modern world that provides on-demand services dynamically. The dynamic execution of user requests and resource-sharing facilities require proper task scheduling among the available virtual machines, which is a significant issue and plays a crucial role in developing an optimal cloud computing environment. Round Robin is a prevalent scheduling algorithm for fair distribution of resources with a balanced contribution in minimized response time and turnaround time. This paper introduced a new enhanced round-rob

APA, Harvard, Vancouver, ISO, and other styles

47

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

APA, Harvard, Vancouver, ISO, and other styles

48

Ghani, Rana Fareed, and Laith Al-Jobouri. "Packet Loss Optimization in Router Forwarding Tasks Based on the Particle Swarm Algorithm." Electronics 12, no. 2 (2023): 462. http://dx.doi.org/10.3390/electronics12020462.

Full text

Abstract:

Software-defined networks (SDNs) are computer networks where parameters and devices are configured by software. Recently, artificial intelligence aspects have been used for SDN programs for various applications, including packet classification and forwarding according to the quality of service (QoS) requirements. The main problem is that when packets from different applications pass through computer networks, they have different QoS criteria. To meet the requirements of packets, routers classify these packets, add them to multiple weighting queue systems, and forward them according to their pr

APA, Harvard, Vancouver, ISO, and other styles

49

Putra, Muhammad Aldi Aditia, Iskandar Fitri, and Agus Iskandar. "Implementasi High Availability Cluster Web Server Menggunakan Virtualisasi Container Docker." JURNAL MEDIA INFORMATIKA BUDIDARMA 4, no. 1 (2020): 9. http://dx.doi.org/10.30865/mib.v4i1.1729.

Full text

Abstract:

The increasing demand for information on the internet causes the traffic load on the web server to increase. Therefore it can cause the workload on a web server service to be overloaded (request), so that the server is down (overloaded). Based on previous research the application of load balancing can reduce the burden of traffic on the web server. This research method uses load balancing on servers with round robin algorithm and least connections as well as a single server as a comparison. The parameters measured are throughput, responses time, requests per second, CPU utilization. From the t

APA, Harvard, Vancouver, ISO, and other styles

50

N., Srilatha, Sravani M., and Divya Y. "Optimal Round Robin CPU Scheduling Algorithm using Manhattan Distance." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 6 (2017): 3664–68. https://doi.org/10.11591/ijece.v7i6.pp3664-3668.

Full text

Abstract:

In Round Robin Scheduling the time quantum is fixed and then processes are scheduled such that no process get CPU time more than one time quantum in one go. The performance of Round robin CPU scheduling algorithm is entirely dependent on the time quantum selected. If time quantum is too large, the response time of the processes is too much which may not be tolerated in interactive environment. If time quantum is too small, it causes unnecessarily frequent context switch leading to more overheads resulting in less throughput. In this paper a method using Manhattan distance has been proposed tha

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!