Block Rearrangement Policy and Grouped Scheduling Algorithms for VOD System
用于VOD系统的块重组策略及分组调度算法

With the advances in storage subsystems, compression and network technology, video-on- demand (VOD) is increasingly becoming an important services, the investigation to improve the performance of VOD servers has become a major focus. In this paper, we propose two rearrangements of data block and a request scheduling algorithms. With this approach, the data blocks with comparable access frequency are kept closer to each other, so as to reduce the moving distance of disk head and the seeking time. The simulation result demonstrates that the strategy and algorithms can effectively reduce disk access time and response latency respectively.