Round-robin scheduling - Process scheduling

Download in Excel, CSV or JSON

Structured data parsed from Wikipedia. Process scheduling To schedule processes fairly, a round robin scheduler generally employs time sharing, giving each job a time slot or quantum (its allowance of CPU time), and interrupting the job if it is not completed by then. The job is resumed next time a time slot is assigned to that process. If the process terminates or changes its state to waiting during its attributed time quantum, the scheduler selects the first process in the ready queue to execute. In the absence of time sharing, or if the quanta were large relative to the sizes of the jobs, a process that produced large jobs would be favoured over other processes. quantum Round robin algorithm is a pre emptive algorithm as the scheduler forces the process out of the CPU once the time quota expires. For example, if the time slot is 100 milliseconds, and job1 takes a total time of 250 ms to complete, the round robin scheduler will suspend the job after 100 ms and give other jobs their time on the CPU. Once the other jobs have had their equal share (100 ms each), job1 will get another allocation of CPU time and the cycle will repeat. This process continues until the job finishes and needs no more time on the CPU. job1 job1 Job1 = Total time to complete 250 ms (quantum 100 ms) First allocation = 100 ms.Second allocation = 100 ms.Third allocation = 100 msTotal CPU time of job1 = 250 ms job1 Consider the following table with the arrival time and execute time of the process with the quantum time of 100ms to understand the round robin scheduling:

Data Source : WIKIPEDIA
Number of Data columns : 3 Number of Data rows : 6
Categories : economy, demography, politics, knowledge


Data row number Process name Arrival time Execute time

Download the dataset to see the full list of 6 entries

Data Columns

Name Description Data Type
Process name text
Arrival time integer
Execute time integer

Other datasets published on Basedig

List of terrorist incidents in 1982 - August


Structured data parsed from Wikipedia. August

august, list, incidents, 1982, terrorist

List of cryptographic file systems - Cryptographic filesystems - FUSE-based file systems


Structured data parsed from Wikipedia. FUSE based file systems

file, systems, based, fuse, cryptographic

Fedor Klimov - Competitive highlights - With Stolbova


Structured data parsed from Wikipedia. With Stolbova

stolbova, fedor, klimov, highlights, competitive