多媒体演示服务器的灵活磁盘调度

Sindhu Emilda, L. Jacob, O. Daescu, B. Prabhakaran
{"title":"多媒体演示服务器的灵活磁盘调度","authors":"Sindhu Emilda, L. Jacob, O. Daescu, B. Prabhakaran","doi":"10.1109/MMSP.2002.1203343","DOIUrl":null,"url":null,"abstract":"Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author or authors. Depending on the composition of multimedia presentations, disk access for retrieval may not be needed in every round. A presentation can skip a certain number of disk scheduling rounds before retrieving the next required chunk of data. In this paper, we present a min-max skip round disk access algorithm for the retrieval of multimedia presentations in a flexible manner depending on the presentation composition, client/server buffer, and server-disk/network bandwidths. The proposed min-max skip round disk scheduling algorithm can be used for push, pull, as well as hybrid approaches for delivering multimedia presentations. We consider storage of presentations on an array of disks as well as on multi-zone recording disks. A few simulation results are provided.","PeriodicalId":398813,"journal":{"name":"2002 IEEE Workshop on Multimedia Signal Processing.","volume":"83 10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Flexible disk scheduling for multimedia presentation servers\",\"authors\":\"Sindhu Emilda, L. Jacob, O. Daescu, B. Prabhakaran\",\"doi\":\"10.1109/MMSP.2002.1203343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author or authors. Depending on the composition of multimedia presentations, disk access for retrieval may not be needed in every round. A presentation can skip a certain number of disk scheduling rounds before retrieving the next required chunk of data. In this paper, we present a min-max skip round disk access algorithm for the retrieval of multimedia presentations in a flexible manner depending on the presentation composition, client/server buffer, and server-disk/network bandwidths. The proposed min-max skip round disk scheduling algorithm can be used for push, pull, as well as hybrid approaches for delivering multimedia presentations. We consider storage of presentations on an array of disks as well as on multi-zone recording disks. A few simulation results are provided.\",\"PeriodicalId\":398813,\"journal\":{\"name\":\"2002 IEEE Workshop on Multimedia Signal Processing.\",\"volume\":\"83 10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 IEEE Workshop on Multimedia Signal Processing.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMSP.2002.1203343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE Workshop on Multimedia Signal Processing.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMSP.2002.1203343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

组成多媒体表示的对象需要根据作者指定的时间关系来交付。根据多媒体演示的组成,并非每一轮都需要磁盘访问以进行检索。在检索下一个所需的数据块之前,演示文稿可以跳过一定数量的磁盘调度轮。在本文中,我们提出了一种最小-最大跳过圆磁盘访问算法,用于根据演示组成,客户端/服务器缓冲区和服务器-磁盘/网络带宽灵活地检索多媒体演示文稿。提出的最小-最大跳过圆磁盘调度算法可用于推送、拉以及混合方法来提供多媒体演示。我们考虑在磁盘阵列以及多区域记录磁盘上存储演示文稿。给出了一些仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Flexible disk scheduling for multimedia presentation servers
Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author or authors. Depending on the composition of multimedia presentations, disk access for retrieval may not be needed in every round. A presentation can skip a certain number of disk scheduling rounds before retrieving the next required chunk of data. In this paper, we present a min-max skip round disk access algorithm for the retrieval of multimedia presentations in a flexible manner depending on the presentation composition, client/server buffer, and server-disk/network bandwidths. The proposed min-max skip round disk scheduling algorithm can be used for push, pull, as well as hybrid approaches for delivering multimedia presentations. We consider storage of presentations on an array of disks as well as on multi-zone recording disks. A few simulation results are provided.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信