Research Article
A Pruning-Based Disk Scheduling Algorithm for Heterogeneous I/O Workloads
Table 2
Summary of workloads used in the experiments.
| Workload | Type of application | Access pattern | Average interarrival time (ms) | Deadline (ms) | I/O size (KB) | File size (MB) |
| (1) | Real-time application | Random | 20 | 30–70 | 64 | 100 | Best-effort application | Random | 20 | Infinite | 4–128 | 100 |
| (2) | Real-time application | Periodic | 20 | 20 | 64 | 100 | Best-effort application | Random | 20 | Infinite | 4–128 | 200 |
| (3) | Real-time application | Periodic | 20 | 20 | 64 | 100 | Best-effort application | Sequential | 20 | Infinite | 64 | 200 |
| (4) | Real-time application | Periodic | 20 | 20 | 64 | 100 | Best-effort application | Random | 45 | Infinite | 4–128 | 100 | Best-effort application | Sequential | 20 | Infinite | 64 | 100 |
| (5) | Real-time application | Periodic | 45 | 30 | 4–64 | 324 | Best-effort application | Random | 10 | Infinite | 4–64 | 128 |
| (6) | Real-time application | Periodic | 90 | 30 | 4–64 | 324 | Best-effort application | Random | 19 | Infinite | 4–64 | 128 |
|
|