Multiuser operating systems such as Linux and other Unixes are known as time-sharing systems. This is because each user is given the impression that they are using the entire system when in fact the system resources are actually divided among all users. In other words, due to the low turnaround time users are able to run interactive processes. In order to facilitate this low turnaround time, most time sharing systems use the round robin scheduling algorithm because the waiting time of each process is bounded. The timeslice given to a process is known as a quantum.

Log in or registerto write something here or to contact authors.