Transcription of Process Scheduling in Linux - Computer Science
{{id}} {{{paragraph}}}
Example: marketing
Process Scheduling in Linux - Computer Science
'&$% Process Scheduling in Linux Scheduling Mechanism: how to switch. Scheduling Policy: when to switch and what Process to choose. Some schedul-ing objectives: fast Process response time avoidance of Process starvation good throughput for background jobs support for soft real time processes Linux uses dynamically assigned Process priorities for non real-time running for a long time have their priorities decreased while pro-cesses that are waiting have their priorities increased dynamically.'&$%Classification of Processes Compute-boundversusI/O bound. Linux implicitly favors I/O bound pro-cesses over compute bound processes (why?). Another classification: Interactive : shells, text editors, GUI applications. Batch : compilers, database search engine, web server,number-crunching. Real-time applications, data-collection from physi-cal sensors, robot controllers.
Invoking the scheduler The scheduler proper is the functionschedule()in kernel/sched.c. Direct Invocation.Examples: A process must be blocked because a resource is not available, a device driver can invoke schedule() directly if it will be executing a long iterative task. Lazy Invocation.By setting theneedresched ag eld of current to 1.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: