Zaloguj się

Gotowe bibliografie tematyczne / ROBIN PROCESS SCHEDULING

Spis treści

Artykuły w czasopismach
Części książek
Streszczenia konferencji

Gotowa bibliografia na temat „ROBIN PROCESS SCHEDULING”

Autor: Grafiati

Data publikacji: 11 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „ROBIN PROCESS SCHEDULING”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "ROBIN PROCESS SCHEDULING"

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Streszczenie:

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 priority scheduling algorithms.

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

5

Prasad Arya, Govind, Kumar Nilay i Devendra Prasad. "An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process". International Journal of Engineering & Technology 7, nr 4.5 (22.09.2018): 238. http://dx.doi.org/10.14419/ijet.v7i4.5.20077.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

6

Faizan, Khaji, Abhijeet Marikal i Kakelli Anil. "A Hybrid Round Robin Scheduling Mechanism for Process Management". International Journal of Computer Applications 177, nr 36 (17.02.2020): 14–19. http://dx.doi.org/10.5120/ijca2020919851.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Biswas, Dipto, Md Samsuddoha, Md Rashid Al Asif i 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, nr 1 (8.02.2023): 22–34. http://dx.doi.org/10.5815/ijisa.2023.01.03.

Pełny tekst źródła

Streszczenie:

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 environment. This paper introduces a new approach for round robin based task scheduling algorithm which is suitable for cloud computing environment. The proposed algorithm determines time quantum dynamically based on the differences among three maximum burst time of tasks in the ready queue for each round. The concerning part of the proposed method is utilizing additive manner among the differences, and the burst times of the processes during determining the time quantum. The experimental results showed that the proposed approach has enhanced the performance of the round robin task scheduling algorithm in reducing average turn-around time, diminishing average waiting time, and minimizing number of contexts switching. Moreover, a comparative study has been conducted which showed that the proposed approach outperforms some of the similar existing round robin approaches. Finally, it can be concluded based on the experiment and comparative study that the proposed dynamic round robin scheduling algorithm is comparatively better, acceptable and optimal for cloud environment.

Style APA, Harvard, Vancouver, ISO itp.

8

Siva Nageswara Rao, G., N. Srinivasu, S. V. N. Srinivasu i G. Rama Koteswara Rao. "Dynamic Time Slice Calculation for Round Robin Process Scheduling Using NOC". International Journal of Electrical and Computer Engineering (IJECE) 5, nr 6 (1.12.2015): 1480. http://dx.doi.org/10.11591/ijece.v5i6.pp1480-1485.

Pełny tekst źródła

Streszczenie:

<p>Process scheduling means allocating a certain amount of CPU time to each of the user processes. One of the popular scheduling algorithms is the “Round Robin” algorithm, which allows each and every process to utilize the CPU for short time duration. Processes which finish executing during the time slice are removed from the ready queue. Processes which do not complete execution during the specified time slice are removed from the front of the queue, and placed at the rear end of the queue. This paper presents an improvisation to the traditional round robin scheduling algorithm, by proposing a new method. The new method represents the time slice as a function of the burst time of the waiting process in the ready queue. Fixing the time slice for a process is a crucial factor, because it subsequently influences many performance parameters like turnaround time, waiting time, response time and the frequency of context switches. Though the time slot is fixed for each process, this paper explores the fine-tuning of the time slice for processes which do not complete in the stipulated time allotted to them.</p>

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

10

Parinduri, Ikhsan, i Siti Nurhabibah Hutagalung. "Teknik Penjadwalan Prosesor FIFO, SJF Non Preempetive, Round Robin". Prosiding Seminar Nasional Riset Information Science (SENARIS) 1 (30.09.2019): 864. http://dx.doi.org/10.30645/senaris.v1i0.93.

Pełny tekst źródła

Streszczenie:

Processor scheduling is divided into several methods including FIFO, Non Preempetive SJF, Round Robin. Implementation can know the performance of the processor which consists of process, waiting time, arrival time and completion stage. In this case the processor scheduling is made in NetBeans IDE.7.0.1 programming with input on the main menu and calculation process display menu with AWT (Average Waiting Time) value with units of ms, table display process: process, burst time and gaint chart : process, waiting time, start time and end time.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "ROBIN PROCESS SCHEDULING"

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Gupta, Amit Kumar, Narendra Singh Yadav i Dinesh Goyal. "Design and Performance Evaluation of Smart Job First Multilevel Feedback Queue (SJFMLFQ) Scheduling Algorithm With Dynamic Smart Time Quantum". W Research Anthology on Advancements in Quantum Technology, 111–26. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-8593-1.ch005.

Pełny tekst źródła

Streszczenie:

Multilevel feedback queue scheduling (MLFQ) algorithm is based on the concept of several queues in which a process moves. In earlier scenarios there are three queues defined for scheduling. The two higher level queues are running on Round Robin scheduling and last level queue is running on FCFS (First Come First Serve). A fix time quantum is defined for RR scheduling and scheduling of process depends upon the arrival time in ready queue. Previously a lot of work has been done in MLFQ. In our propose algorithm Smart Job First Multilevel feedback queue (SJFMLFQ) with smart time quantum (STQ), the processes are arranged in ascending order of their CPU execution time and calculate a Smart Priority Factor SPF on which processes are scheduled in queue. The process which has lowest SPF value will schedule first and the process which has highest SF value will schedule last in queue. Then a smart time quantum (STQ) is calculated for each queue. As a result, we found decreasing in turnaround time, average waiting time and increasing throughput as compared to the previous approaches and hence increase in the overall performance.

Style APA, Harvard, Vancouver, ISO itp.

3

Taranum, Fahmina, Sridevi K, Maniza Hijab, Syeda Fouzia Sayeedunissa, Afshan Kaleem i Niraja K.S. "Role of an Optimal Multiagent Scheduling in Different Applications Using ML". W Artificial Intelligence. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.108314.

Pełny tekst źródła

Streszczenie:

Scheduling is regarded as one of the vital decision-making processes used frequently in many real-time cases. It manages everything from resource allocation to the task completion, with the goal to optimize the desired objectives. Subject to the problem, the resources, tasks, and goals can differ. The aim is to design a corporative multiagent system for optimal scheduling. Many of the scheduling available algorithms calculate optimality based on different perspectives. The proposal is to create the dataset using multiple algorithms with different performance metrics to find an optimal one. This data can be imported into machine learning tools for training and predicting, based on the selected performance metrics. The algorithm considered in the empirical analysis includes first come first serve, Round robin, and Ant colony approach. The major finding shows that scheduling using Ant colony is an optimal algorithm, which is based on speed and velocity. The future extension would be to check the correctness of optimality using machine learning tools.

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "ROBIN PROCESS SCHEDULING"

1

Mishra, Rahul, i Gourav Mitawa. "Improved Round Robin Algorithm for effective Scheduling Process for CPU". W 2021 Third International Conference on Intelligent Communication Technologies and Virtual Mobile Networks (ICICV). IEEE, 2021. http://dx.doi.org/10.1109/icicv50876.2021.9388561.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Hayatunnufus, Mardhani Riasetiawan i Ahmad Ashari. "Performance Analysis of FIFO and Round Robin Scheduling Process Algorithm in IoT Operating System for Collecting Landslide Data". W 2020 International Conference on Data Science, Artificial Intelligence, and Business Analytics (DATABIA). IEEE, 2020. http://dx.doi.org/10.1109/databia50434.2020.9190608.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Sonata, Fifin, Juniar Hutagalung i Aeri Rachmad. "Analysis average waiting time search performance in the queue process on CPU scheduling using the Round Robin, shortest job first and first in first out algorithm". W THE FIRST INTERNATIONAL CONFERENCE ON NEUROSCIENCE AND LEARNING TECHNOLOGY (ICONSATIN 2021). AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0111352.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!