Jump to content

Generalized foreground-background

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Chongkian (talk | contribs) at 08:29, 11 January 2021 (remove navbox whose article is unlinked per WP:EXISTING). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  1. ^ Nuyens, Misja; Wierman, Adam (2008). "The Foreground-Background queue: a survey" (PDF). Performance Evaluation. 65 (3–4). Retrieved 7 August 2017.
P ≟ NP 

This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Generalized_foreground-background&oldid=999660444"