𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal scheduling of reader—systems

✍ Scribed by K. D. Glazebrook; V. G. Kulkarni; L. C. Puryear Jr.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
82 KB
Volume
45
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Broadcast Scheduling Optimization for He
Broadcast Scheduling Optimization for Heterogeneous Cluster Systems
✍ Pangfeng Liu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, it is now possible to build a PC or workstation cluster that provides high computing power within a limited budget. However

Short communication optimal replacement
Short communication optimal replacement scheduling in multi-state series–parallel systems
✍ Gregory Levitin; Anatoly Lisnianski 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

The paper generalizes a replacement schedule optimization problem to multi-state systems, where the system and its components have a range of performance levels-from perfect functioning to complete failure. The multistate system reliability is defined as the ability to satisfy a demand which is repr

Optimal arrangement of systems
Optimal arrangement of systems
✍ Philip J. Boland; Frank Proschan 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB

To location 15, we are to allocate a "generator" and n, "machines" for i = 1, . . . ,k, where n , 2 . . . 2 n,. Although the generators and machines function independently of one another, a machine is operable only if it and the generator at its location are functioning. The problem we consider is t