一种改进的防止流媒体任务饥饿的RM算法

Shuhua Peng, Xiaodong Liu, Qionghai Dai, Yu Cheng
{"title":"一种改进的防止流媒体任务饥饿的RM算法","authors":"Shuhua Peng, Xiaodong Liu, Qionghai Dai, Yu Cheng","doi":"10.1109/ICME.2003.1221380","DOIUrl":null,"url":null,"abstract":"A streaming media system is a soft real-time system according to streaming media service features. Some soft real-time tasks and best-effort tasks will be starved when using traditional RM algorithm to schedule streaming media services. Aiming at this problem, an improved RM algorithm with elastic priority is proposed in this paper. The algorithm can prevent periodic streaming media tasks from starvation, improving QoS of streaming media system. Some simulation experiments are given in the paper, and these experiments illustrate that the algorithm can reach our anticipative target.","PeriodicalId":118560,"journal":{"name":"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An improved RM algorithm for preventing streaming media tasks from starvation\",\"authors\":\"Shuhua Peng, Xiaodong Liu, Qionghai Dai, Yu Cheng\",\"doi\":\"10.1109/ICME.2003.1221380\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A streaming media system is a soft real-time system according to streaming media service features. Some soft real-time tasks and best-effort tasks will be starved when using traditional RM algorithm to schedule streaming media services. Aiming at this problem, an improved RM algorithm with elastic priority is proposed in this paper. The algorithm can prevent periodic streaming media tasks from starvation, improving QoS of streaming media system. Some simulation experiments are given in the paper, and these experiments illustrate that the algorithm can reach our anticipative target.\",\"PeriodicalId\":118560,\"journal\":{\"name\":\"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2003.1221380\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2003.1221380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

根据流媒体业务的特点,流媒体系统是一种软实时系统。在使用传统RM算法调度流媒体服务时,会饿死一些软实时任务和尽力而为任务。针对这一问题,本文提出了一种改进的具有弹性优先级的RM算法。该算法可以防止周期性流媒体任务饥饿,提高流媒体系统的QoS。文中给出了一些仿真实验,实验结果表明该算法能够达到预期的目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved RM algorithm for preventing streaming media tasks from starvation
A streaming media system is a soft real-time system according to streaming media service features. Some soft real-time tasks and best-effort tasks will be starved when using traditional RM algorithm to schedule streaming media services. Aiming at this problem, an improved RM algorithm with elastic priority is proposed in this paper. The algorithm can prevent periodic streaming media tasks from starvation, improving QoS of streaming media system. Some simulation experiments are given in the paper, and these experiments illustrate that the algorithm can reach our anticipative target.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信