Optimal scheduling of reader–writer systems

Optimal scheduling of reader–writer systems

0.00 Avg rating0 Votes
Article ID: iaor19991737
Country: United States
Volume: 45
Issue: 5
Start Page Number: 483
End Page Number: 495
Publication Date: Aug 1998
Journal: Naval Research Logistics
Authors: , ,
Keywords: scheduling
Abstract:

We consider a reader–writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion.

Reviews

Required fields are marked *. Your email address will not be published.