首页> 外文会议>World multiconference on systemics, cybernetics and informatics >An Efficient Periodic-Request-Grouping Technique for Reduced Seek Time in Disk Array-based Video-on-Demand Server
【24h】

An Efficient Periodic-Request-Grouping Technique for Reduced Seek Time in Disk Array-based Video-on-Demand Server

机译:基于磁盘阵列的视频点播服务器中的搜索时间减少了一个有效的定期请求分组技术

获取原文

摘要

Disk throughput is significantly affected by scheduling of disk I/O requests. In the case of VoD (Video-on-Demand) servers, disk throughput is directly related to the number of user requests that can be served simultaneously. In this paper, we propose an efficient periodic request grouping scheme for disk array-based VoD servers to improve the disk throughput. To reduce the disk seek time that are needed in processing the periodic I/O requests, this scheme groups the periodic requests that access adjacent regions into one, and arranges the groups in a pre-determined order. We show that by using this scheme, we can reduce the average disk bandwidth required by a stream and serve more periodic requests simultaneously than existing schemes. We also propose an adaptation technique that conforms the proposed scheme to access pattern changes of user requests. We performed simulation studies to evaluate the performance of the proposed scheme.
机译:磁盘吞吐量受到磁盘I / O请求的调度影响。在VOD(按需)服务器的情况下,磁盘吞吐量与可以同时供应的用户请求的数量直接相关。在本文中,我们为基于磁盘阵列的VOD服务器提出了一种有效的定期请求分组方案,以提高磁盘吞吐量。为了减少处理周期性I / O请求时所需的磁盘搜索时间,该方案将访问相邻区域的周期性请求分组为一个,并以预定的顺序排列组。我们表明,通过使用此方案,我们可以减少流所需的平均磁盘带宽,并比现有方案同时使用更定期的请求。我们还提出了一种适应技术,该技术符合所提出的方案来访问用户请求的模式变化。我们执行了仿真研究以评估所提出的计划的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号