Abstract
Most modern operating systems allocate limited amounts of processor time to tasks and let them take turns to run. By dividing time on each processor to ready-to-run tasks, the operating system gives the impression that the tasks are running simultaneously. The amount of time each task is allowed to run each turn is assigned by the scheduler. With a few exceptions, Windows kernel scheduler gives all tasks the same amount regardless of their priorities. In contrast, Linux 2.6.10 kernel computes the amount for each task based on its priority. This thesis evaluates the methods used by Windows and Linux operating systems to allocate time to tasks under different workloads and system configurations by simulating the methods and scheduling algorithms used by the operating systems. The performance data presented here demonstrate that under certain workloads and system configurations, the more complicated Linux operating system has better performance than its simpler Windows counterpart. While in some other cases Windows performs just as well as Linux.