To see the other types of publications on this topic, follow the link: Round Robin (RR) Scheduling Algorithm.
Journal articles on the topic 'Round Robin (RR) Scheduling Algorithm'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research 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.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
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 textAbstract:
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.
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 textAbstract:
<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 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.
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 textAbstract:
<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>
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 textAbstract:
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)
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 textAbstract:
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.
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 textAbstract:
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
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
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 textAbstract:
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.
11
Nermeen, Ghazy, Abdelkader Afaf, S. Zaki Mervat, and A. Eldahshan Kamal. "An ameliorated Round Robin algorithm in the cloud computing for task scheduling." Bulletin of Electrical Engineering and Informatics 12, no. 2 (2023): 1103~1114. https://doi.org/10.11591/eei.v12i2.4524.
Full textAbstract:
Cloud computing is an advanced technology that offers types of assistance on requests. Because of the huge measure of requests got from cloud clients, all requests should be managed efficiently. Therefore, the task scheduling is critical in cloud computing. The provision of computational resources in cloud is controlled by a cloud provider. It is necessary to design highefficiency scheduling algorithms that are compatible with the corresponding computing paradigms. This paper introduces a new task scheduling method for cloud computing called an ameliorated Round Robin algorithm (ARRA). The proposed algorithm develops an optimal time quantum based on the average of task burst time using fixed and dynamic manners. The experimental results showed that the ARRA significantly outperformed other algorithms including improved RR, enhanced RR, dynamic time quantum approach (ARR) and enhanced RR (RAST ERR) in terms of the average waiting time, average turnaround time and response time.
12
Putri, Raissa Amanda. "Aplikasi Simulasi Algoritma Penjadwalan Sistem Operasi." Jurnal Teknologi Informasi 5, no. 1 (2021): 98–102. http://dx.doi.org/10.36294/jurti.v5i1.2215.
Full textAbstract:
Abstract - In the operating system course, various scheduling algorithms with complex calculations are studied. The scheduling algorithms that are often used are FIFO (First-in, first out) or FCFS (first come, first serve), SJF (Shortest Job First), RR (Round robin) and SRF (Shortest remaining first). Unfortunately, the scheduling algorithm learning method often only uses the Gantt Chart as a tool for its calculations. For this reason, the researcher intends to design and build a desktop-based operating system scheduling algorithm simulation application as a learning medium for operating system courses. The application built can simulate four types of queues, namely FIFO (First-in, first out) or FCFS (first come, first serve), SJF (Shortest Job First), RR (Round robin) and SRF (Shortest remaining first). This application performs a simulation by calculating the start time, completion time, response time and waiting time for each process. In addition, the system also produces the results of the average response time and average waiting time, as well as a gantt chart of the entire process.Keywords - Application, Simulation, Operating System, Scheduling Algorithm. Abstrak - Dalam mata kuliah sistem operasi, berbagai algoritma penjadwalan dengan perhitungan yang kompleks dipelajari. Algoritma penjadwalan yang sering digunakan adalah FIFO (First-in, first out) atau FCFS (first come, first serve), SJF (Shortest Job First), RR (Round robin) dan SRF (Shortest Remaining First). Sayangnya, metode pembelajaran algoritma penjadwalan seringkali hanya menggunakan Gantt Chart sebagai alat bantu perhitungannya. Untuk itu peneliti merancang dan membangun aplikasi simulasi algoritma penjadwalan sistem operasi berbasis desktop sebagai media pembelajaran mata kuliah sistem operasi. Aplikasi yang dibangun dapat mensimulasikan empat jenis antrian yaitu FIFO (First-in, first out) atau FCFS (first come, first serve), SJF (Shortest Job First), RR (Round robin) dan SRF (Shortest remaining first). Aplikasi ini melakukan simulasi dengan menghitung saat mulai, saat rampung, lama tanggap dan lama tunggu masing-masing proses. Selain itu, sistem juga mengeluarkan hasil rata-rata lama tanggap dan rata-rata waktu tunggu, serta gantt chart dari keseluruhan proses.Kata Kunci - Aplikasi, Simulasi, Sistem Operasi, Algoritma Penjadwalan.
13
Prasad Arya, Govind, Kumar Nilay, and Devendra Prasad. "An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process." International Journal of Engineering & Technology 7, no. 4.5 (2018): 238. http://dx.doi.org/10.14419/ijet.v7i4.5.20077.
Full textAbstract:
The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Shortest Job First (SJF). This paper focuses on Round Robin Scheduling algorithm and various issues related to it. One major issue in RR scheduling is determining the length of Time Quantum. If the Time Quantum is too large RR scheduling behaves as FCFS. On the other hand, if it is too small it forces considerable increase in the number of context switches. Our main objective is to overcome this limitation of traditional RR scheduling algorithm and maximize CPU utilization, further, leading to more efficient and faster system. Here we propose an algorithm that categorizes available processes into High Priority processes and Low Priority process. The proposed algorithm reduces the average waiting time of High Priority processes in all cases and of Low Priority processes in not all but some cases. The overall waiting time changes on the basis of set of processes considered. The simulation results justify that the proposed schemes reduces the overall average waiting time when compared to the existing schemes.
14
Ghazy, Nermeen, Afaf Abdelkader, Mervat S. Zaki, and Kamal A. Eldahshan. "An ameliorated Round Robin algorithm in the cloud computing for task scheduling." Bulletin of Electrical Engineering and Informatics 12, no. 2 (2023): 1103–14. http://dx.doi.org/10.11591/eei.v12i2.4524.
Full textAbstract:
Cloud computing is an advanced technology that offers types of assistance on requests. Because of the huge measure of requests got from cloud clients, all requests should be managed efficiently. Therefore, the task scheduling is critical in cloud computing. The provision of computational resources in cloud is controlled by a cloud provider. It is necessary to design high-efficiency scheduling algorithms that are compatible with the corresponding computing paradigms. This paper introduces a new task scheduling method for cloud computing called an ameliorated Round Robin algorithm (ARRA). The proposed algorithm develops an optimal time quantum based on the average of task burst time using fixed and dynamic manners. The experimental results showed that the ARRA significantly outperformed other algorithms including improved RR, enhanced RR, dynamic time quantum approach (ARR) and enhanced RR (RAST ERR) in terms of the average waiting time, average turnaround time and response time.
15
Mostafa, Samih M., and Hirofumi Amano. "Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique." Applied Sciences 10, no. 15 (2020): 5134. http://dx.doi.org/10.3390/app10155134.
Full textAbstract:
Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results.
16
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 textAbstract:
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 quantum in a dynamic manner based on the mean of the time quantum. Moreover, we applied the remaining burst time of the task as a factor to decide the continuity of executing the task during the current round. The experimental results obtained using the CloudSim Plus tool showed that the DRRHA significantly outperformed the competition in terms of the average waiting time, turnaround time, and response time compared with several studied algorithms, including IRRVQ, dynamic time slice round-robin, improved RR, and SRDQ algorithms.
17
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 textAbstract:
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 that decides a quantum value. The computation of the time quantum value is done by the distance or difference between the highest burst time and lowest burst time. The experimental analysis also shows that this algorithm performs better than RR algorithm and by reducing number of context switches, reducing average waiting time and also the average turna round time.
18
Belferik, Ronald, and Evander Banjarnahor. "Analisis Average Waiting Time Penjadwalan CPU Menggunakan Algoritma Shortest Remaining First dan Algoritma Round Robin." JDMIS: Journal of Data Mining and Information Systems 3, no. 1 (2025): 43–53. https://doi.org/10.54259/jdmis.v3i1.4076.
Full textAbstract:
In operating systems, process scheduling is a critical aspect to determine the order of process execution by the CPU. This research compares the average waiting time (AWT) of Shortest Remaining First (SRF) algorithm and Round Robin (RR) algorithm where the problem to be solved is CPU scheduling. The purpose of this research is to get an algorithm that has a short average waiting time. The test results obtained that the SRF algorithm has a very short average waiting time with a value of 29.85 ms compared to the RR algorithm which gets an AWT result of 65.6 ms.
19
Nor, Syazwani Mohd Pakhrudin, Kassim Murizah, and Idris Azlina. "Cloud service analysis using round-robin algorithm for qualityof-service aware task placement for internet of things services." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 3 (2023): 3464–73. https://doi.org/10.11591/ijece.v13i3.pp3464-3473.
Full textAbstract:
Round-robin (RR) is a process approach to sharing resources that requires each user to get a turn using them in an agreed order in cloud computing. It is suited for time-sharing systems since it automatically reduces the problem of priority inversion, which are low-priority tasks delayed. The time quantum is limited, and only a one-time quantum process is allowed in round-robin scheduling. The objective of this research is to improve the functionality of the current RR method for scheduling actions in the cloud by lowering the average waiting, turnaround, and response time. CloudAnalyst tool was used to enhance the RR technique by changing the parameter value in optimizing the high accuracy and low cost. The result presents the achieved overall min and max response times are 36.69 and 650.30 ms for running 300 min RR. The cost for the virtual machines (VMs) is identified from $0.5 to $3. The longer the time used, the higher the cost of the data transfer. This research is significant in improving communication and the quality of relationships within groups.Round-robin (RR) is a process approach to sharing resources that requires each user to get a turn using them in an agreed order in cloud computing. It is suited for time-sharing systems since it automatically reduces the problem of priority inversion, which are low-priority tasks delayed. The time quantum is limited, and only a one-time quantum process is allowed in round-robin scheduling. The objective of this research is to improve the functionality of the current RR method for scheduling actions in the cloud by lowering the average waiting, turnaround, and response time. CloudAnalyst tool was used to enhance the RR technique by changing the parameter value in optimizing the high accuracy and low cost. The result presents the achieved overall min and max response times are 36.69 and 650.30 ms for running 300 min RR. The cost for the virtual machines (VMs) is identified from $0.5 to $3. The longer the time used, the higher the cost of the data transfer. This research is significant in improving communication and the quality of relationships within groups.
20
Li, Lei. "Advances In CPU Scheduling Algorithms in Operating Systems." Highlights in Science, Engineering and Technology 120 (December 26, 2024): 8–13. https://doi.org/10.54097/9g6zbb91.
Full textAbstract:
CPU scheduling algorithms significantly influence Operating System (OS) performance. Many studies have proposed optimized scheduling algorithms. This paper outlines the main characteristics of common scheduling algorithms, including First Come First Served (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling, and Highest Response Ratio Next (HRRN). It reviews comparative performance research on these algorithms and mentions their optimizations to summarize the progress in this field. This paper also analyses two specific operating systems - Time-Sharing Systems and Embedded Systems, and introduces scheduling algorithms applicable to these two systems and their typical applications. The review finds that SJF & SPTF perform better than FCFS and RR in terms of waiting time, while HRRN also significantly outperforms RR. The optimization of the scheduling algorithm mainly focuses on RR, by clustering techniques and dynamically resizing the quantum time. For time-sharing systems, RR is the most common strategy, while the Linux kernel adopts the Completely Fair Scheduler (CFS). For embedded systems, the real-time scheduling algorithms, Earliest Deadline First(EDF) and Least Slack Time(LST), are applicable to soft real-time systems.
21
Srilatha, N., M. Sravani, and Y. Divya. "Optimal Round Robin CPU Scheduling Algorithm Using Manhattan Distance." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 6 (2017): 3664. http://dx.doi.org/10.11591/ijece.v7i6.pp3664-3668.
Full textAbstract:
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 that decides a quantum value. The computation of the time quantum value is done by the distance or difference between the highest burst time and lowest burst time. The experimental analysis also shows that this algorithm performs better than RR algorithm and by reducing number of context switches, reducing average waiting time and also the average turna round time.
22
Ni, Ye Peng, Xiao Sen Chen, and Jian Bo Liu. "Resolving Unordered Issues for CMT-SCTP in Heterogeneous Wireless Network." Applied Mechanics and Materials 380-384 (August 2013): 2152–56. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2152.
Full textAbstract:
Concurrent Multi-path Transfer extension of the Stream Control Transport Protocol (CMT-SCTP) has great potential to improve the utilization of scarce network bandwidth resource. Traditional CMT-SCTP adopts Round Robin (RR) algorithms to carry out packet scheduling that could affect the performance of SCTP traffic as unordered issues. In this paper, we discuss the unordered issues and propose a novel packet scheduling algorithm to improve the performance in heterogeneous wireless network. Our main idea is predicting the packet arriving time and then provides a path selection strategy. Through measuring round-trip time (RTT) and available bandwidth, we achieve an algorithm to predict the arriving time of data packets on one path, then give a reasonable path selection strategy to make sure that data arrives in the right order. By using proposed algorithm, the unordered packets and receive buffer blocking are reduced. We evaluate the performance of our algorithm by comparing it with the RR algorithm and show that it can resolve several performance issues.
23
Mohd Pakhrudin, Nor Syazwani, Murizah Kassim, and Azlina Idris. "Cloud service analysis using round-robin algorithm for quality-of-service aware task placement for internet of things services." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 3 (2023): 3464. http://dx.doi.org/10.11591/ijece.v13i3.pp3464-3473.
Full textAbstract:
Round-robin (RR) is a process approach to sharing resources that requires each user to get a turn using them in an agreed order in cloud computing. It is suited for time-sharing systems since it automatically reduces the problem of priority inversion, which are low-priority tasks delayed. The time quantum is limited, and only a one-time quantum process is allowed in round-robin scheduling. The objective of this research is to improve the functionality of the current RR method for scheduling actions in the cloud by lowering the average waiting, turnaround, and response time. CloudAnalyst tool was used to enhance the RR technique by changing the parameter value in optimizing the high accuracy and low cost. The result presents the achieved overall min and max response times are 36.69 and 650.30 ms for running 300 min RR. The cost for the virtual machines (VMs) is identified from $0.5 to $3. The longer the time used, the higher the cost of the data transfer. This research is significant in improving communication and the quality of relationships within groups.
24
Al-Khatib, Raed M., Asef Al-Khateeb, Esraa Al-Daom, Ishraq T. Al-Dagamseh, Ayat Tawalbeh, and Laith Abualigah. "A New Enhanced IGBTQ-based Model for CPU Scheduling." Applied and Computational Engineering 8, no. 1 (2023): 429–35. http://dx.doi.org/10.54254/2755-2721/8/20230207.
Full textAbstract:
CPU scheduling is concerned with how to efficiently exploit processors by executing the largest number of operations in the shortest possible time. The efficiency of CPU scheduling depends on the algorithm used. Round Robin (RR) is one of the most popular algorithms, which is primarily based on determining the period of execution time for the operation. In this work, we develop a new enhancement algorithm for modifying the RR algorithm based on IGBTQ model to solve the CPU scheduling problem. Therefore, the main objective is to improve the Average waiting Time (AWT) and the Average Turnaround Time (ATT). The final results are successful when reached the lowest scores of AWT and ATT measurements. The experiments used two cases of a different number of processes, which obtained better outputs compared to other state-of-the-art models like; the dynamic RR with Control Preemption (DRRCP), Group Based Time Quantum (GBTQ), and IGBTQ algorithm.
25
Shafinaz, Bt Ismail, Bt Mohd Ali Darmawaty, and Ya'acob Norsuzila. "Performance Analysis of Uplink Scheduling Algorithms in LTE Networks." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 2 (2018): 373–79. https://doi.org/10.11591/ijeecs.v9.i2.pp373-379.
Full textAbstract:
Scheduling is referring to the process of allocating resources to User Equipment based on scheduling algorithms that is located at the LTE base station. Various algorithms have been proposed as the execution of scheduling algorithm, which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of three well-known uplink schedulers namely, Maximum Throughput (MT), First Maximum Expansion (FME), and Round Robin (RR). The evaluation is considered for a single cell with interference for three flows such as Best effort, Video and VoIP in a pedestrian environment using the LTE-SIM network simulator. The performance evaluation is conducted in terms of system throughput, fairness index, delay and packet loss ratio (PLR). The simulations results show that RR algorithm always reaches the lowest PLR, delivering highest throughput for video and VoIP flows among all those strategies. Thus, RR is the most suitable scheduling algorithm for VoIP and video flows while MT and FME is appropriate for BE flows in LTE networks.
26
Bt Ismail, Shafinaz, Darmawaty Bt Mohd Ali, and Norsuzila Ya’acob. "Performance Analysis of Uplink Scheduling Algorithms in LTE Networks." Indonesian Journal of Electrical Engineering and Computer Science 9, no. 2 (2018): 373. http://dx.doi.org/10.11591/ijeecs.v9.i2.pp373-379.
Full textAbstract:
Scheduling is referring to the process of allocating resources to User Equipment based on scheduling algorithms that is located at the LTE base station. Various algorithms have been proposed as the execution of scheduling algorithm, which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of three well-known uplink schedulers namely, Maximum Throughput (MT), First Maximum Expansion (FME), and Round Robin (RR). The evaluation is considered for a single cell with interference for three flows such as Best effort, Video and VoIP in a pedestrian environment using the LTE-SIM network simulator. The performance evaluation is conducted in terms of system throughput, fairness index, delay and packet loss ratio (PLR). The simulations results show that RR algorithm always reaches the lowest PLR, delivering highest throughput for video and VoIP flows among all those strategies. Thus, RR is the most suitable scheduling algorithm for VoIP and video flows while MT and FME is appropriate for BE flows in LTE networks.
27
Ezeribe, Basil. "An Improved Proportional Fair Scheduling Algorithm for Downlink LTE Cellular Network." International Journal for Research in Applied Science and Engineering Technology 9, no. 10 (2021): 1522–34. http://dx.doi.org/10.22214/ijraset.2021.38642.
Full textAbstract:
Abstract: Network providers of LTE networks can achieve maximum gain and Quality of Service (QoS) requirement of their users by employing a radio resource management technique that has the ability to allocate resource blocks to users in a fair manner without compromising the capacity of the network. This implies that for a better performing LTE network, a fair scheduling and balanced QoS delivery for various forms of traffic are needed. In this paper an improved proportional fair scheduling algorithm for downlink LTE cellular network has been developed. This algorithm was implemented using a MATLAB-based System Level simulator by Vienna University. The developed algorithm was compared to other scheduling algorithms such as the Proportional Fair (PF) algorithm, Best Channel Quality Indicator (CQI), and Round Robin (RR) scheduling methods. The system performance was also analyzed under different scenarios using different performance metrics. The achieved results showed that the developed algorithm had a better throughput performance than the Round Robin and Proportional fair scheduling. The developed algorithm shows improved cell edge throughputs of about 19.2% (as at 20 users) and 9.1% higher for cell edge users without and with mobility impact respectively. The Best CQI algorithm had higher peak throughput values but the fairness was highly compromised. The developed algorithm outperforms the Best CQI by 136.6% without the impact of mobility. Finally, in dense conditions, the developed algorithm still outperforms the other algorithms with a QoS metric of 4.6% increment when compared to the PF algorithm which was the closest competitor. Keywords: UE, eNodeB, Scheduling, Proportional Fair, LTE,
28
Yassein, Muneer O. Bani, Yaser M. Khamayseh, and Ali M. Hatamleh. "Intelligent Randomize Round Robin for Cloud Computing." International Journal of Cloud Applications and Computing 3, no. 1 (2013): 27–33. http://dx.doi.org/10.4018/ijcac.2013010103.
Full textAbstract:
Cloud computing is a recent scientific revolution in information technology, it is considered as the basic infrastructure of ubiquitous computing. It supports various features including, Internet based computing, and resources sharing. Delivery of services is provided to computers and other devices upon request. In other words, it is a technology based on the internet and central remote servers to maintain data and applications. This technology allows consumers and enterprises to use applications without the need of installing them or allowing access to their personal files at any computer with internet access. Among different users that may access the cloud data center, cloud computing must include job scheduling to organize and monitor these jobs, and to achieve fairness among all users. One of the most popular job scheduling algorithms is Round Robin (RR). This paper proposes an enhancement to the traditional RR, namely Randomized Round Robin (RRR). The enhanced version of RR algorithms is based on random selection for processes that come from different users to achieve near optimal selection of jobs to be served. A simulation has been carried out using CloudSim simulator V 3.0 to test the performance of the proposed scheme in terms of different evaluation metrics such as average throughput and average turnaround time.
29
K. Subba Shankar. "Optimizing Workflow Scheduling in Cloud Computing Through Comparative Study of Dynamic Group and Prioritize Scheduling (DGPS) and Traditional Algorithms." Journal of Information Systems Engineering and Management 10, no. 24s (2025): 141–52. https://doi.org/10.52783/jisem.v10i24s.3881.
Full textAbstract:
In cloud computing environments, efficient workflow scheduling is critical for optimizing resource utilization and minimizing response times. This study introduces and evaluates a new scheduling algorithm—Dynamic Group and Prioritize Scheduling (DGPS)—and compares its performance with three traditional algorithms: First-Come-First-Served (FCFS), Shortest Job First (SJF), and Round Robin (RR). The DGPS algorithm dynamically groups tasks based on their attributes and prioritizes them before allocation to Virtual Machines (VMs), aiming to enhance scheduling efficiency. Through simulations with 5 VMs and 50 tasks, the performance metrics of average response time and standard deviation were analyzed. The results indicate that DGPS provides a balanced performance with stable response times, while SJF achieves the lowest average response time but with moderate variability. FCFS offers slightly better response times than DGPS but with higher variability, and RR demonstrates the highest response times and standard deviations. This research highlights the effectiveness of DGPS in achieving consistent and efficient task scheduling in cloud environments.
30
AL-SAFAR, AHMED. "Hybrid CPU Scheduling algorithm SJF-RR In Static Set of Processes." Journal of Al-Rafidain University College For Sciences ( Print ISSN: 1681-6870 ,Online ISSN: 2790-2293 ), no. 1 (October 20, 2021): 36–60. http://dx.doi.org/10.55562/jrucs.v29i1.377.
Full textAbstract:
Round Robin (RR) algorithm is widely used in modern operating systems (OS) as it has a better responsiveness as periodic quantum (occurring at regular intervals) in addition to have a good feature such as low scheduling overhead of n processes in a ready queue which takes a constant time O(1). But, RR algorithms have the worse features such as having low throughput, long average turnaround and waiting time, in addition to the number of context switches for (n) processes is (n) switches. Shortest Job First (SJF) however, itself is not practical in time sharing Oss due to its low response. More over the scheduling overhead of n processes in a ready queue is O(n), But the good features of SJF algorithm are the best average turnaround time and waiting time.By considering a static set of n processes, desirable features of CPU scheduler to maximize CPU utilization, response time and minimize waiting time and turnaround time are obtained by combining the kernel properties of SJF algorithm with the best features of RR algorithm to produce a new algorithm as an original and novel algorithm called; " Hybrid CPU Scheduling algorithm SJF-RR in Static Set of Processes " which, proposed in this research.The proposed algorithm is implemented through an innovative optimal equation to adapt time quantum factor for each process in each round as a periodic quantum (occurred at irregular intervals). That is while applying proposed algorithm, mathematical calculations take place to have particular time quantum for each process. Once, a criterion has been selected for comparison, deterministic modeling with the same numbers for input is proven that proposed algorithm is the best.
31
Perdana, Doan, Aji Nur Sanyoto, and Yoseph Gustommy Bisono. "Performance Evaluation and Comparison of Scheduling Algorithms on 5G Networks using Network Simulator." International Journal of Computers Communications & Control 14, no. 4 (2019): 530–39. http://dx.doi.org/10.15837/ijccc.2019.4.3570.
Full textAbstract:
In this research, we compared the Round Robin (RR) and the Proportional Fair (PF) algorithms for different user equipment density scenarios using voice and video traffic, to evaluate the key impact on performance of 5G mmwave network. This research simulated on NS3.27 with an integrated mmwave module. Based on the result, we found that the RR is a good choice for voice traffic. It has a throughput of 3.65% better than PF with similar fairness index. On the other hand, we found that the PF is the right choice for video traffic due to has better result for throughput. It has a throughput of 1.24% better than RR. For fairness index round robin has better result for voice and video traffic.
32
Priya, S. Sree, and Dr T. Rajendran. "Enhanced Weighted Round Robin: A New Paradigm in Cloud Load Balancing." Indian Journal Of Science And Technology 18, no. 15 (2025): 1220–28. https://doi.org/10.17485/ijst/v18i15.3976.
Full textAbstract:
Objectives: The aim of this study is to suggest and recommend a load balancing algorithm based on enhanced weighted round robin (EWRR) technique to distribute incoming tasks or requests among various servers or resources in a cloud computing architecture. Methods: The study is accomplished by designing the enhanced weighted round robin (EWRR) load balancing and implemented in Cloud infrastructure by varying the number of jobs and virtual machines and evaluating the efficiency of the model. The experiments are simulated using CloudSim an open source tool and the effectiveness with regard to response time, idle time, task migration and delayed tasks are recorded. Findings: The obtained results are compared with round robin (RR) and weighted round robin (WRR) techniques and with the other state of art methods in the literature. The proposed EWRR performs better than all other approaches, such as Pragmatic Load Balancing (PLB) (28 ms) and Reinforcement Learning and Proficient Hybrid Lyrebird Falcon Optimization (RL-HFLO) (30 ms), with the shortest reaction time of 20 ms. Further, in comparison to greater values like 150 units in Round Robin and 120 units in K-means with RR, it reduces cumulative idle time to 75 units. Among all the methods examined, EWRR further reduces the number of delayed tasks to a mere 5. Even though EWRR involves 3 task migrations, which is slightly more than others, it results in better overall efficiency and utilization of resources. Novelty: The suggested EWRR model can be utilized as load balancing in cloud infrastructure in the varied cloud environments in a predictive way and enable the cloud service providers to make informed decisions. Dynamic parameters used by EWRR include each virtual machine's processing power, the quantity of incoming jobs, the duration of each job, and the VM's current burden (in real time). All of these EWRR settings produce intelligent scheduling that takes workload into account by preventing the blind assignment of jobs in RR and LC. Keywords: Load Balancing, Weighted Round Robin, Enhanced Weighted Round Robin, Cloud Computing, Performance Evaluation
33
Mishra, Praveen Kumar, and Amit Kumar Chaturvedi. "An Improved Laxity based Cost Efficient Task Scheduling Approach for Cloud-Fog Environment." Engineering, Technology & Applied Science Research 15, no. 1 (2025): 19037–44. https://doi.org/10.48084/etasr.8595.
Full textAbstract:
Task scheduling is critical in fog computing, as it has to assign workloads to fog nodes to save costs and execution times. This study emphasizes the allocation of jobs received from clients to suitable nodes through a proposed scheduling technique, which is deployed on layer 2 servers within a cloud-fog environment. Laxity-based Cost-efficient Task Scheduling (LCTS) is proposed for contemporary task scheduling difficulties, such as balancing cost and delay with optimal energy utilization. The results show that the proposed strategy decreased execution time and cost more than Round Robin (RR) and Genetic Algorithm (GA). Furthermore, the proposed method was less expensive than cloud-based IoT solutions. Compared to GA and RR, the simulation results showed that cost and execution time were reduced by 6.99%-17.36% and 4.58%-9.09%, respectively.
34
S., Sree Priya, and T. Rajendran Dr. "Enhanced Weighted Round Robin: A New Paradigm in Cloud Load Balancing." Indian Journal of Science and Technology 18, no. 15 (2025): 1220–28. https://doi.org/10.17485/IJST/v18i15.3976.
Full textAbstract:
Abstract <strong>Objectives:</strong> The aim of this study is to suggest and recommend a load balancing algorithm based on enhanced weighted round robin (EWRR) technique to distribute incoming tasks or requests among various servers or resources in a cloud computing architecture. <strong>Methods:</strong> The study is accomplished by designing the enhanced weighted round robin (EWRR) load balancing and implemented in Cloud infrastructure by varying the number of jobs and virtual machines and evaluating the efficiency of the model. The experiments are simulated using CloudSim an open source tool and the effectiveness with regard to response time, idle time, task migration and delayed tasks are recorded. <strong>Findings:</strong> The obtained results are compared with round robin (RR) and weighted round robin (WRR) techniques and with the other state of art methods in the literature. The proposed EWRR performs better than all other approaches, such as Pragmatic Load Balancing (PLB) (28 ms) and Reinforcement Learning and Proficient Hybrid Lyrebird Falcon Optimization (RL-HFLO) (30 ms), with the shortest reaction time of 20 ms. Further, in comparison to greater values like 150 units in Round Robin and 120 units in K-means with RR, it reduces cumulative idle time to 75 units. Among all the methods examined, EWRR further reduces the number of delayed tasks to a mere 5. Even though EWRR involves 3 task migrations, which is slightly more than others, it results in better overall efficiency and utilization of resources. <strong>Novelty:</strong> The suggested EWRR model can be utilized as load balancing in cloud infrastructure in the varied cloud environments in a predictive way and enable the cloud service providers to make informed decisions. Dynamic parameters used by EWRR include each virtual machine's processing power, the quantity of incoming jobs, the duration of each job, and the VM's current burden (in real time). All of these EWRR settings produce intelligent scheduling that takes workload into account by preventing the blind assignment of jobs in RR and LC. <strong>Keywords:</strong> Load Balancing, Weighted Round Robin, Enhanced Weighted Round Robin, Cloud Computing, Performance Evaluation
35
Shah, Syed Danial Ali, Daehyeong Kim, Pervez Khan, Hoon Kim, and Sangwook Han. "A Two Step Multi-Carrier Proportional Fair Scheduling Scheme for Cloud Radio Access Networks." International Journal of Interdisciplinary Telecommunications and Networking 10, no. 1 (2018): 49–62. http://dx.doi.org/10.4018/ijitn.2018010104.
Full textAbstract:
Proportional fair scheduling (PFS) is a widely used scheduling algorithm in the wireless networks which utilizes the network resources efficiently while maintaining a balance with the fairness among the users. It is a channel aware scheduling algorithm that allocates resources to the users with the best channel conditions, it also takes into account the users with bad channel quality by considering the user's access history in the scheduling decision. In this paper, the authors propose a two-step multiple carrier proportional fair scheduling (MC-PF) algorithm for the cloud radio access networks (C-RAN). The main purpose of this algorithm is to maximize the sum of logarithm transmission rate. The scheduler assigns users to each carrier in order to maximize the logarithm transmission rate for overall links of C-RAN. To prove the effectiveness of the proposed algorithm, the authors have shown the simulation results and compared it with the round robin (RR) scheduling scheme.
36
Olofintuyi, Sunday Samuel, Temidayo Oluwatosin Omotehinwa, and Joshua Segun Owotogbe. "A SURVEY OF VARIANTS OF ROUND ROBIN CPU SCHEDULING ALGORITHMS." FUDMA JOURNAL OF SCIENCES 4, no. 4 (2021): 526–46. http://dx.doi.org/10.33003/fjs-2020-0404-513.
Full textAbstract:
Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.
37
owotogbe, joshua, samuel olofituyi, and TEMIDAYO OLUWATOSIN OMOTEHINWA. "A SURVEY OF VARIANTS OF ROUND ROBIN CPU SCHEDULING ALGORITHMS." A SURVEY OF VARIANTS OF ROUND ROBIN CPU SCHEDULING ALGORITHMS 4, no. 4 (2020): 526–46. https://doi.org/10.33003/fjs-2020-0404-478.
Full textAbstract:
Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years-and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.
38
Saurabh, Saurabh, and Rajesh Kumar Dhanaraj. "Improved QoS with Fog computing based on Adaptive Load Balancing Algorithm." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 5 (2023): 347–62. http://dx.doi.org/10.17762/ijritcc.v11i5.6623.
Full textAbstract:
As the number of sensing devices rises, traffic on the cloud servers is boosting day by day. When a device connected to the IoTwants access to data, cloud computing encourages the pairing of fog & cloud nodes to provide that information. One of the key needs in a fog-based cloud system, is efficient job scheduling to decrease the data delay and improve the QoS (Quality of Service). The researchers have used a variety of strategies to maintain the QoS criteria. However, because of the increased service delay caused by the busty traffic, job scheduling is impacted which leads to the unbalanced load on the fog environment. The proposed work uses a novel model which curates the features and working style of Genetic algorithm and the optimization algorithm with the load balancing scheduling on the fog nodes. The performance of the proposed hybrid model is contrasted with the other well-known algorithms in contrast to the fundamental benchmark optimization test functions. The proposed work displays better results in sustaining the task scheduling process when compared to the existing algorithms, which include Round Robin (RR) method, Hybrid RR, Hybrid Threshold based and Hybrid Predictive Based models, which ensures the efficacy of the proposed load balancing model to improve the quality of service in fog environment.
39
Mahdi, Hussain Falih, Mohammed Hasan Alwan, Baidaa AL-Bander, and Aws Zuhair. "A Comparision of Node Detection Algorithms Over Wireless Sensor Network." International Journal of Interactive Mobile Technologies (iJIM) 16, no. 07 (2022): 38–53. http://dx.doi.org/10.3991/ijim.v16i07.24609.
Full textAbstract:
MANET is standing for Network as Mobile Ad-hoc which is a self-directed mobile handlers group which communicates over relatively bandwidth constrained wireless channels. Many services with different classes of Quality of Services (QoS) could be provided through the MANET such as data, voice, and video streaming. Thus, efficient packets routing is an essential issue especially over this kind of burst channel. To settle this issue, many scheduling techniques are proposed to reduce the packets dropping and channel collision when a huge demand of data is transferred from a sender to a receiver. In this paper, four MANET scheduling algorithms are selected and investigated in mobile ad hoc network which are Strict Preference (SP), Round Robin (RR), Weighted Round Robin (WRR), and Weighted Fair (WF). The network simulator EXata 2.0.1 is used to build the scenario which is consist of 50 nodes and performed the simulation. The results showed the performance metrics difference of the network such as the throughput and the end-end delay as well as queuing metrics like peak queue size, average queue length, in queue average time, and droppe of whole packets. Regrading throughput, the SP algorithm has a greater throughput than WF, RR, and WRR by 4.5%, 2.4%, and 1.42%, but WRR has outperformed others regarding the end-end delay. Moreover, WRR represents the best scheduling algorithm regarding both peak queue size since its greater than RP, WF, and WRR by 10.13%, 9.6%, and 5.32%, in order, and average output queue length in contrast, WRR worsts more time in queuing but it is the best in preventing the packets from dropping.
40
Shakor, Mohammed Y. "Scheduling and Synchronization Algorithms in Operating System: A Survey." Journal of Studies in Science and Engineering 1, no. 2 (2021): 1–16. http://dx.doi.org/10.53898/josse2021121.
Full textAbstract:
An operating system is software that is designed to manage computer hardware and software resources. However, this management requires applying an ample number of techniques and algorithms which are called synchronization and scheduling. The scheduling algorithms are used to arrange the way that the CPU is assigned to the processes, while synchronization is utilized to indicate how to work with multi-processes at the same time. Therefore, they are related to each other. CPU scheduling is a vital phenomenon of an operating system. At present, numerous CPU scheduling algorithms exist as First Come First Serve) FCFS(, Shortest Job First (SJF), Shortest Remaining Time First (SRTF), Priority Scheduling, and Round Robin (RR). In this paper, a survey of the current synchronization and scheduling algorithms have been presented. An overview of each technique with the main algorithms have been described in detail with the advantages and the issues of each algorithm. Furthermore, this paper has dug deep into the real-time operating system scheduling issues, which is the current trend in operating system researches.
41
Iqbal, Mansoor, Muhammad Umar Shafiq, Shouzab Khan, Obaidullah, Saad Alahmari, and Zahid Ullah. "Enhancing task execution: a dual-layer approach with multi-queue adaptive priority scheduling." PeerJ Computer Science 10 (December 3, 2024): e2531. https://doi.org/10.7717/peerj-cs.2531.
Full textAbstract:
Efficient task execution is critical to optimize the usage of computing resources in process scheduling. Various task scheduling algorithms ensure optimized and efficient use of computing resources. This article introduces an innovative dual-layer scheduling algorithm, Multi-Queue Adaptive Priority Scheduling (MQAPS), for task execution. MQAPS features a dual-layer hierarchy with a ready queue (RQ) and a secondary queue (SQ). New tasks enter the RQ, where they are prioritized, while the SQ contains tasks that have already used computing resources at least once, with priorities below a predefined threshold. The algorithm dynamically calculates the time slice based on process priorities to ensure efficient CPU utilization. In the RQ, the task’s priority level defines its prioritization, which ensures that important jobs are completed on time compared to other conventional methods where priority is fixed or no priority parameter is defined, resulting in starvation in low-priority jobs. The simulation results show that MQAPS better utilizes CPU resources and time than traditional round-robin (RR) and multi-level scheduling. The MQAPS showcases a promising scheduling technique ensuring a balanced framework for dynamic adjustment of time quantum and priority. The MQAPS algorithm demonstrated optimization, fairness, and efficiency in job scheduling.
42
Jiang, Xiao Ping, Teng Jiang, Tao Zhang, and Cheng Hua Li. "An Adaptive Load Balancing Method of Adjustment Based on Cloud Computing Resources." Applied Mechanics and Materials 385-386 (August 2013): 1708–12. http://dx.doi.org/10.4028/www.scientific.net/amm.385-386.1708.
Full textAbstract:
By combining LVS cluster architecture and could computing technology, system architecture of the cloud computing service platform is proposed. Cloud computing technology is suitable to support large-scale applications with flash crowds by support elastic amounts of bandwidth and storage resource etc. But traditional algorithms of load balancing provided by LVS are unsuitable for the proposed service platform, because these algorithms are designed for static server resource provided by traditional cluster technology. Taking both the overall utilization rate of server resources and the active connections of the server into counter, an adaptive adjustable load balancing algorithms (Least Comprehensive Utilization and Connection Scheduling algorithm, called LUCU) is proposed in this paper. According the utilization of cloud resource and the users demand, automatic switching between Round Robin (RR) algorithm and LUCU algorithm is achieved. When the cloud capacities are not able to meet the instantaneous demands, LUCU is chosen instead of RR. The proposed platform and algorithm are verified and evaluated using large-scare simulation experiments. The test results show that the equilibrium load is nearly achieved by adopting the proposed algorithms.
43
Sissodia, Rajeshwari, ManMohan Singh Rauthan, and Varun Barthwal. "A Multi-Objective Optimization Scheduling Method Based on the Genetic Algorithm in Cloud Computing." International Journal of Cloud Applications and Computing 12, no. 1 (2022): 1–21. http://dx.doi.org/10.4018/ijcac.305217.
Full textAbstract:
For task-scheduling problems in cloud computing, a multi-objective optimization method is proposed here. First, with an aim toward the biodiversity of resources and tasks in cloud computing. This paper propose a resource cost model that defines the demand of tasks on resources with more details. A multi-objective optimization scheduling method has been proposed based on this resource cost model. This method considers the makespan, wall clock time , execution time and the costs as constraints of the optimization problem. This paper proposed a multi-objective improved genetic algorithm (MOIGA) to address multi-objective task scheduling problems. The experiment results showed that the MOIGA algorithm minimizes makespan, wall clock time, execution time and cost when compared with First Come First Serve (FCFS), Round Robin (RR) and Shortest Job First (SJF).
44
Sahkhar, Lizia, Bunil Kumar Balabantaray, and Satyendra Singh Yadav. "Efficient Cloudlet Allocation to Virtual Machine to Impact Cloud System Performance." International Journal of Information System Modeling and Design 13, no. 6 (2022): 1–21. http://dx.doi.org/10.4018/ijismd.297630.
Full textAbstract:
Performance is an essential characteristic of any cloud computing system. It can be enhance through parallel computing, scheduling and load balancing. This work evaluates the connection between the response time (RT) and virtual machine’s (VM) CPU utilization when cloudlets are allocated from the datacenter broker to VM. To accentuate the RT and VM’s CPU utilization, a set of 100 and 500 heterogeneous cloudlets are analyzed under hybridized provisioning, scheduling and allocation algorithm using CloudSim simulator. These includes space shared (SS) and time shared (TS) provisioning policy, shortest job first (SJF), first come first search (FCFS), round robin (RR) and a novel length-wise allocation (LwA) algorithm. The experimental analysis shows that the RT is the least when SJF is combined with RR allocation at 40.665 secs and VM’s CPU utilization is the least when SJF is combined with LwA policy at 12.48 in all combinations of SS and TS provisioning policy.
45
Basha, Mudasar, Munuswamy Siva Kumar, Mangali Chinna Chinnaiah, et al. "Hardware Schemes for Smarter Indoor Robotics to Prevent the Backing Crash Framework Using Field Programmable Gate Array-Based Multi-Robots." Sensors 24, no. 6 (2024): 1724. http://dx.doi.org/10.3390/s24061724.
Full textAbstract:
The use of smart indoor robotics services is gradually increasing in real-time scenarios. This paper presents a versatile approach to multi-robot backing crash prevention in indoor environments, using hardware schemes to achieve greater competence. Here, sensor fusion was initially used to analyze the state of multi-robots and their orientation within a static or dynamic scenario. The proposed novel hardware scheme-based framework integrates both static and dynamic scenarios for the execution of backing crash prevention. A round-robin (RR) scheduling algorithm was composed for the static scenario. Dynamic backing crash prevention was deployed by embedding a first come, first served (FCFS) scheduling algorithm. The behavioral control mechanism of the distributed multi-robots was integrated with FCFS and adaptive cruise control (ACC) scheduling algorithms. The integration of multiple algorithms is a challenging task for smarter indoor robotics, and the Xilinx-based partial reconfiguration method was deployed to avoid computational issues with multiple algorithms during the run-time. These methods were coded with Verilog HDL and validated using an FPGA (Zynq)-based multi-robot system.
46
Nageswara Rao, Siva, Ramkumar Jayaraman, and Dr S.V.N Srinivasu. "Efficient PIMRR Algorithm Based on Scheduling Measures for Improving Real Time Systems." International Journal of Engineering & Technology 7, no. 2.32 (2018): 275. http://dx.doi.org/10.14419/ijet.v7i2.32.15583.
Full textAbstract:
Scheduling play an important role to perform a single (or) multiple process activities by considering scheduling criteria’s such as, waiting time, turnaround time, CPU utilization and context switches. The scheduling criteria’s mainly depends on the quantum time which is specific to real time systems. The challenges faced by the real time systems based on scheduling activities viz., higher waiting time, more context switches and high turnaround time. All the scheduling criteria’s are integrated to achieve Quality of Service (QoS) like throughput and delay. To improve the scheduling criteria’s like waiting time, context switches and turnaround time, PIMRR algorithm is proposed. The PIMRR algorithm is first integrated with modulo operation to provide priority to all the process. The average of all the processes burst time is equal to the quantum time. Performance analysis is done for PMIRR with the existing simple round robin, PRR, Priority based RR scheduling based on the scheduling criteria’s. Our results demonstrates that the PIMRR is more efficient compared to the existing ones, in terms of waiting time and turnaround time versus quantum time.
47
Gollapalli, Mohammed, Abrar Alamoudi, Arwa Aldossary, et al. "Modeling Algorithms for Task Scheduling in Cloud Computing Using CloudSim." Mathematical Modelling of Engineering Problems 9, no. 5 (2022): 1201–9. http://dx.doi.org/10.18280/mmep.090506.
Full textAbstract:
As the number of cloud users are spontaneously growing globally, there is an urgent need to constantly provide quality services to consumers. Consequently, task scheduling plays an essential role in improving the performance of the cloud computing environment. Most of the published research in this field share common goals, which can be summarized in maximizing resource utilization, reducing cost, and increasing performance. This research provides the foundation knowledge on the latest works done to enhance and optimize the existing task scheduling algorithm in cloud computing by considering various parameters. Furthermore, in this study, we have applied comparative study to analyze the performance of three task scheduling algorithms namely Max-Min, First Come First Serve (FCFS), and Round Robin (RR) in cloud computing environments based on the performance metric of the Virtual Machines (VM) resources' cost, average time and makespan to find the best performing algorithm in the cloud environment. The experimental evaluations were conducted using CloudSim simulation tool. The results show that Max-Min achieved better performance based on makespan and average waiting time than other algorithms in Space and Time-shared policies.
48
Joshi, Aparna, and Shayamala Devi Munisamy. "Enhancement of cloud performance metrics using dynamic degree memory balanced allocation algorithm." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 3 (2021): 1697–707. https://doi.org/10.11591/ijeecs.v22.i3.pp1697-1707.
Full textAbstract:
In cloud computing, load balancing among the resources is required to schedule a task, which is a key challenge. This paper proposes a dynamic degree memory balanced allocation (D2MBA) algorithm which allocate virtual machine (VM) to a best suitable host, based on availability of randomaccess memory (RAM) and microprocessor without interlocked pipelined stages (MIPS) of host and allocate task to a best suitable VM by considering balanced condition of VM. The proposed D2MBA algorithm has been simulated using a simulation tool CloudSim by varying number of tasks and keeping number of VMs constant and vice versa. The D2MBA algorithm is compared with the other load balancing algorithms viz. Round Robin (RR) and dynamic degree balance with central processing unit (CPU) based (D2B_CPU based) with respect to performance parameters such as execution cost, degree of imbalance and makespan time. It is found that the D2MBA algorithm has a large reduction in the performance parameters such as execution cost, degree of imbalance and makespan time as compared with RR and D2B CPU based algorithms.
49
Wang, Jianhua, Yiling Wang, Xialai Wu, and Wenyan Ci. "Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling." PeerJ Computer Science 9 (March 10, 2023): e1269. http://dx.doi.org/10.7717/peerj-cs.1269.
Full textAbstract:
This article is concerned with the robust model predictive control (RMPC) problem for polytopic uncertain systems under the round-robin (RR) scheduling in the high-rate communication channel. From a set of sensors to the controller, several sensors transmit the data to the remote controller via a shared high-rate communication network, data collision might happen if these sensors start transmissions at the same time. For the sake of preventing data collision in the high-rate communication channel, a communication scheduling known as RR is used to arrange the data transmission order, where only one node with token is allowed to send data at each transmission instant. In accordance with the token-dependent Lyapunov-like approach, the aim of the problem addressed is to design a set of controllers in the framework of RMPC such that the asymptotical stability of the closed-loop system is guaranteed. By taking the effect of the underlying RR scheduling in the high-rate communication channel into consideration, sufficient conditions are obtained by solving a terminal constraint set of an auxiliary optimization problem. In addition, an algorithm including both off-line and online parts is provided to find a sub-optimal solution. Finally, two simulation examples are used to demonstrate the usefulness and effectiveness of the proposed RMPC strategy.
50
Daw, Khin Po. "Simulation of Process Scheduling Algorithms." International Journal of Trend in Scientific Research and Development 3, no. 4 (2019): 1629–32. https://doi.org/10.5281/zenodo.3591438.
Full textAbstract:
In a multiprogramming system, multiple processes exist concurrently in main memory. Each process alternates between using a processor and waiting for some event to occur, such as the completion of an I O operation. The processor or processors are kept busy by executing one process while the others wait. The key to multiprogramming is scheduling. CPU scheduling deals with the problem of deciding which of the processes in the ready queue is to be allocated the CPU. By switching the CPU among processor the operating system can make the computer more productive. Scheduling affectes the performance of the system because it determines which processes will wait and which will progress. In this paper, simulation of various scheduling algorithm First Come First Served FCFS , Round Robin RR , Shortest Process Next SPN and Shortest Remaining Time SRT is done over C Daw Khin Po "Simulation of Process Scheduling Algorithms" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd25124.pdf