Each queue has its own scheduling algorithm.įor example, separate queues might be used for foreground and background processes. The processes are permanently assigned to one queue, generally based on some property of the process, such as memory size, process priority, or process type. ![]() In addition, foreground processes may have priority over background processes.Ī multi-level queue scheduling algorithm partitions the ready queue into several separate queues. ![]() These two types of processes have different response-time requirements, and so might have different scheduling needs. Longest Remaining Time First SchedulingĪnother class of scheduling algorithms has been created for situations in which processes are easily classified into different groups.įor example, A common division is made between foreground(or interactive) processes and background (or batch) processes.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |