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.