الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 16 |  |  |
| | | from | 16 | | |
Abstract
Emerging multimedia applications require the underlying multimedia
storage server to be able to efficiently support a diverse group of
activities. Existing real-time disk scheduling algorithms do not support
the whole spectrum of disk request types that is required by server-based
multimedia applications. This thesis presents a new technique for the disk
queue organization and proposes a real-time disk scheduling algorithm
that is able to efficiently support the whole spectrum of disk request types
serviced by multimedia storage servers. The complexity analysis of the
proposed algorithm is studied and its correctness is established. A
simulation model is developed to assess the performance of the algorithm
with comparison to other existing algorithms. The simulation model is
validated and verified. Simulation results demonstrate that the proposed
algorithm is superior to other existing algorithms.