Describe Round Robin Scheduling

Round robin scheduling is a process by which a computer can multitask. Technically a computer cannot multitask but what round robin does is it gives each task/program a very small time slice of the processors time. During this time the processor will run the programs instructions until the time is up. After this point the processor will move onto the next task in the list. Tasks can be interrupted with interrupt signals sent by the hardware or software, after which the processor will drop what it's doing and work on the event that has been signaled eg/ a program has tried to divide a number by 0 causing an interrupt signal to be sent. Once the signal is received the processor stops what it's doing, then the current state is saved by the processor, the interrupt is handled and then the state is resumed by the processor.

GV

Related Computing A Level answers

All answers ▸

What is the main difference between the Stack and the Queue abstract data types?


A binary, 8-bit floating point number 0111 0010 is said to have a 4-bit mantissa and a 4-bit exponent. What is meant by the terms 'mantissa' and 'exponent'? What is the value of this 8-bit binary floating point number?


Basic Conversions (Binary, Hexadecimal, etc)


How do I make simplifying Boolean algebra easier?