Abstract
The problem of scheduling a continuous stream of requests of varying sizes is studied. Two scheduling metrics, max-stretch and max-flow that gauge the responsiveness of the scheduler to each job is proposed. These metrics are optimized under varying circumstances, offline/online and preemptive/nonpreemptive. The overall fairness of various metrics and scheduling strategies are observed.
| Original language | English (US) |
|---|---|
| Pages | 270-279 |
| Number of pages | 10 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 25 1998 → Jan 27 1998 |
Other
| Other | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms |
|---|---|
| City | San Francisco, CA, USA |
| Period | 1/25/98 → 1/27/98 |
ASJC Scopus subject areas
- Software
- General Mathematics