A | B | C | D | E | F | G | H | CH | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Generalized Foreground-Background (FB), also known as Least Attained Service (LAS) is a scheduling policy.[1] It consists in scheduling the process that has received the least service so far. Similarly to SRPT, the aim of FB is to improve the performance of a system, specifically mean response time. While SRPT is optimal it is more difficult to apply in practice as it requires accurate estimations of the service time of each request. In contrast, FB does not require estimations of service times, making it more practical but also less performing than SRPT.
References
- ^ Nuyens, Misja; Wierman, Adam (2008). "The Foreground-Background queue: a survey" (PDF). Performance Evaluation. 65 (3–4): 286–307. doi:10.1016/j.peva.2007.06.028. S2CID 2814864. Retrieved 7 August 2017.
>Text je dostupný pod licencí Creative Commons Uveďte autora – Zachovejte licenci, případně za dalších podmínek. Podrobnosti naleznete na stránce Podmínky užití.
Text je dostupný za podmienok Creative
Commons Attribution/Share-Alike License 3.0 Unported; prípadne za ďalších
podmienok.
Podrobnejšie informácie nájdete na stránke Podmienky
použitia.
