Describe different job scheduling in operating systems.
Answer Posted / kwrtos
First the rationale to have a sophisticated job scheduling
mechanism is a demand of multi-tasking system where multiple
jobs compete for their execution time-slots. Each of
job-scheduling policies then also shines with particular
scenarios depending on what the goal the system attempts to
achieve. Priority-based scheduling is to give a process CPU
usage upon its prioirty at any given time. First-Come-First
Serve, aka FIFO, scheduling operates as it means.
Round-robin then allows each process receive frequent time
slots of CPU usage. Dynamic priority adjusts its priority
upon the resource use and type of operations, allowing
frequent priority and time-quantum modifications.
Shortest-remaining-time scheduling then utilizes the
feedback among processes to give the shortest task more
chances to complete its task than others.
Is This Answer Correct ? | 16 Yes | 8 No |
Post New Answer View All Answers
No New Questions to Answer in this Category !! You can
Post New Questions
Answer Questions in Different Category