About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SIGMETRICS 1989
Conference paper
Analysis of a threshold policy for scheduling readers and writers
Abstract
The author considers the Threshold Fastest Emptying policy. In the context of a system with saturated readers the TFE policy specifies: Serve M readers utilizing all processors until the queue for writers reaches some threshold K. Empty the system from readers as quickly as possible by finishing serving the active readers (a non-preemptive policy). Then serve all available writers. The cycle repeats.