Name
Title | ||
|---|---|---|
A New Real-Time Disk Scheduling Algorithm and Its Application to Distributed Multimedia Storage Systems |
Abstract | ||
|---|---|---|
In this paper, a new real-time disk scheduling algorithm called BFI (best-fit-insertion) is proposed. Notably, different from the conventional real- time problem, the service time of a disk request depends on its schedule result. As the service time is not a constant value, it is time-consuming to verify the feasi- bility of a schedule. In this paper, we introduce a temporal parameter called maximum tardiness. With the help of maximum tardiness, we can verify the im- provement of an insertion test within a constant time. We have evaluated and im- plemented our proposed algorithm on operating systems. Experiments show that the proposed algorithm can support more requests and can achieve higher disk throughput than that of the conventional approach. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0055325 | IDMS |
Keywords | DocType | Volume |
New Real-Time Disk,Multimedia Storage Systems | Conference | 1483 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-64955-7 | 4 |
PageRank | References | Authors |
0.52 | 21 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ray-I Chang | 1 | 238 | 32.52 |
| Wei Kuan Shih | 2 | 95 | 12.50 |
| Ruei-Chuan Chang | 3 | 267 | 56.19 |