Multi-queue scheduling of two tasks |
| |
| Authors: | Jeffrey R Spirn |
| |
| Affiliation: | (1) Computer Science Department, The Pennsylvania State University, 16802 University Park, Pa., USA |
| |
| Abstract: | Summary Scheduling in the central server queueing model, consisting of a  CPU server and m I/O servers, is considered for the case of two customers. Optimal (maximal CPU utilization) CPU and I/O schedules are obtained. The best CPU schedule depends on the I/O schedule in effect; and is either Longest or Shortest-Expected-Remaining-Processing-Time-First. However, for certain I/O schedules the CPU schedule is immaterial. The best I/O schedule is always to process the longer CPU customer first. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
