✦ LIBER ✦
Asymptotic loss of priority scheduling policies in closed re-entrant lines: A computational study
✍ Scribed by Y. Narahari; L.M. Khan
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 807 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we present an approximate but efficient analytical method to compute the asymptotic loss of buffer priority scheduling policies in closed re-entrant lines. For simple two-station closed re-entrant lines, this enables the verification of Harrison-Wein conjectures and Jin-Ou-Kumar results. For multi-station re-entrant lines, this provides an efficient way of comparing different buffer priority scheduling policies. We also use the method to evaluate the effect of high priority jobs in re-entrant lines.