You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Stochastic Dispatching of Multi-Priority Jobs to Heterogeneous Processors
Susan H. Xu, Pitu B. Mirchandani, Srikanta P. R. Kumar and Richard R. Weber
Journal of Applied Probability
Vol. 27, No. 4 (Dec., 1990), pp. 852-861
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3214828
Page Count: 10
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
A number of multi-priority jobs are to be processed on two heterogeneous processors. Of the jobs waiting in the buffer, jobs with the highest priority have the first option of being dispatched for processing when a processor becomes available. On each processor, the processing times of the jobs within each priority class are stochastic, but have known distributions with decreasing mean residual (remaining) processing times. Processors are heterogeneous in the sense that, for each priority class, one has a lesser average processing time than the other. It is shown that the non-preemptive scheduling strategy for each priority class to minimize its expected flowtime is of threshold type. For each class, the threshold values, which specify when the slower processor is utilized, may be readily computed. It is also shown that the social and the individual optimality coincide.
Journal of Applied Probability © 1990 Applied Probability Trust