Several properties of the SFQ algorithm are proved in [142]. The algorithm allocatesCPU fairly when the available bandwidth varies in time and provides throughput, as well asdelay guarantees. The algorithm schedules the threads in the order of their virtual startup time, the shortest one first; the length of the time quantum is not required when a thread is scheduled, but only after the thread has finished its current allocation. The authors of [142] report that the overhead of the SFQ algorithms is comparable to that of the Solaris scheduling algorithm.
đang được dịch, vui lòng đợi..
