In this paper, we present an ameliorative demand-paging algorithm called PDPAF (i.e., pinned demandpaging based on the access frequency of video files), to efficiently utilize the limited buffer space in a VOD (video...
详细信息
In this paper, we present an ameliorative demand-paging algorithm called PDPAF (i.e., pinned demandpaging based on the access frequency of video files), to efficiently utilize the limited buffer space in a VOD (video-on-demand) server. It excludes the limitation of the disk bandwidth, and raises the hit ratio of video pages in the buffer, thereby increasing the total number of concurrent clients. Furthermore, we also propose an admission control algorithm to decide whether a new request can be admitted. Finally, we conduct extensive experiments to compare PDPAF with other algorithms on the average waiting time and the maximal number of concurrent requests, and the simulation results validate the superiority of our approach. (c) 2004 Elsevier Inc. All rights reserved.
A formal model is presented for pagingalgorithms under /-order nonstationary assumptions about program behavior. When processing a program under paging in a given memory, a given paging policy generates a certain (ex...
详细信息
暂无评论