![]() If differentiated or guaranteed quality of service is offered, as opposed to best-effort communication, weighted fair queuing may be utilized. The simplest best-effort scheduling algorithms are round-robin, fair queuing (a max-min fair scheduling algorithm), proportionally fair scheduling and maximum throughput. In packet-switched computer networks and other statistical multiplexing, the notion of a scheduling algorithm is used as an alternative to first-come first-served queuing of data packets. In this section, we introduce several of them. There are many different scheduling algorithms. Scheduling deals with the problem of deciding which of the outstanding requests is to be allocated resources. The main purposes of scheduling algorithms are to minimize resource starvation and to ensure fairness amongst the parties utilizing the resources. ![]() Scheduling disciplines are used in routers (to handle packet traffic) as well as in operating systems (to share CPU time among both threads and processes), disk drives (I/O scheduling), printers (print spooler), most embedded systems, etc. Scheduling algorithms are used for distributing resources among parties which simultaneously and asynchronously request them.
0 Comments
Leave a Reply. |