Title :
Performance evaluation of a threshold policy for scheduling readers and writers
Author :
Thomasian, Alexander ; Nicola, Victor F.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fDate :
1/1/1993 12:00:00 AM
Abstract :
An analysis of a threshold policy for scheduling readers and writers in a multiserver system and a comparison of its performance with the first-come, first-served (FCFS) policy are presented. The threshold fastest emptying (FTE) policy is analyzed in a system with writer arrivals and an infinite backlog of readers using a Markovian model as well as a vacationing server model to yield closed-form expressions for the mean writer response time and the reader throughput. The maximum throughput achieved by the TFE policy is shown to be an increasing function of K, the threshold on the number of writers in the system, which even at K=1 exceeds the maximum throughput achieved by FCFS. In a system with reader and writer arrivals (nonsaturated system), simulation is used to study and compare the mean response time for the FCFS and the TFE policies
Keywords :
Markov processes; concurrency control; parallel processing; performance evaluation; queueing theory; scheduling; Markovian model; closed-form expressions; multiserver system; readers; scheduling; simulation; threshold fastest emptying; threshold policy; vacationing server model; writers; Concurrency control; Concurrent computing; Delay; Distributed databases; Helium; Operating systems; Performance analysis; Queueing analysis; Throughput; Transaction databases;
Journal_Title :
Computers, IEEE Transactions on
