Scheduling in Linux and Windows 2000. CS 431 Sanjay Kumar (01D07041) Sanjay Kumar Ram (01D07042). Linux kernel Linux process Scheduling policy Data Structures and Scheduling Algorithm in Uniprocessor System Scheduling algorithm for multiprocessor Scheduling in windows 2000.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Sanjay Kumar (01D07041)
Sanjay Kumar Ram (01D07042)
Kernel subsystem overview
1. Inserts current in the proper wait queue
2. Changes the state of current either to TASK_INTERRUPTIBLE or to TASK_UNINTERRUPTIBLE
3. Invokes schedule( )
4. Checks if the resource is available; if not, goes to step 2
5. Once the resource is available, removes current from the wait queue
1. active array, contains all the tasks in the associated runqueue
that have timeslice left.
2. expired array , contains all the tasks in the associated
runqueue that have exhausted their timeslice.
16 “real-time” levels
15 variable levels
Used by zero page thread
Used by idle thread(s)