.png){kind=icon}
返回
A cost driven disk scheduling algorithm for multimedia object retrieval
.png){kind=icon}
PRE
AI
DOI：10.1109/TMM.2003.811623.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes a novel cost-driven disk scheduling algorithm for environments consisting of multipriority requests. An example application is a video-on-demand (VOD) system that provides high and low quality services, termed priority 2 and 1, respectively. Customers ordering a high quality (priority 2) service pay a higher fee and are assigned a higher priority by the underlying system. Our proposed algorithm minimizes costs by maintaining one-queue And managing requests intelligently in order to meet the deadline of as many priority 1 requests as possible while maximizing the number of priority 2 requests that meet their deadline. Our algorithm is general enough to accommodate an arbitrary number of priority levels. Prior schemes, collectively termed multiqueue schemes maintain a separate queue for each priority level in order to optimize the performance of the high priority requests only. When compared with our proposed scheme, in certain cases, our technique provides more than one order of magnitude improvement in total cost.
Keyword:
CONTINUOUS MEDIA SERVERS
REAL-TIME SYSTEMS
PERFORMANCE EVALUATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.7
论文数:
4.5K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏A fourth order product integration rule by using the generalized Euler–Maclaurin summation formula
OAAI
OAAI分享收藏
分享收藏
查看更多内容