Divyesh Jadav
@InProceedings{jadav:ioschedule, author = {Divyesh Jadav and Chutimet Srinilta and Alok Choudhary and P. Bruce Berra}, title = {Design and Evaluation of Data Access Strategies in a High Performance Multimedia-on-Demand Server}, booktitle = {Proceedings of the Second IEEE International Conference on Multimedia Computing and Systems}, year = {1995}, month = {May}, pages = {286--291}, later = {jadav:j-ioschedule}, URL = {http://www.cat.syr.edu/~divyesh/ICMCS95.ps}, keywords = {parallel I/O, multimedia, pario-bib}, abstract = {One of the key components of a multi user multimedia on demand system is the data server. Digitization of traditionally analog data such as video and audio, and the feasibility of obtaining network bandwidths above the gigabit per second range are two important advances that have made possible the realization, in the near future, of interactive distributed multimedia systems. Secondary-to-main memory I/O technology has not kept pace with advances in networking, main memory and CPU processing power. Consequently, the performance of the server has a direct bearing on the overall performance of such a system. We develop a model for the architecture of a server for such a system. Parallelism of data retrieval is achieved by striping the data across multiple disks. The performance of any server ultimately depends on the data access patterns. Two modifications of the basic retrieval algorithm are presented to exploit data access patterns in order to improve system throughput and response time. A complementary information caching optimization is discussed. Finally, we present performance results of these algorithms on the IBM SP1 and Intel Paragon parallel computers.}, comment = {Journal version is jadav:j-ioschedule? See also jadav:media-on-demand. [Comments based on a much earlier version.] They propose I/O scheduling algorithms for multimedia file servers. They assume an MIMD architecture with no shared memory and with a disk on every node. One node is essentially a manager for new requests. Another set are interface nodes, each managing the data flow for a few multimedia data streams. The majority are server nodes, responsible just for fetching their data from disk and sending it to the interface nodes. The interface nodes assemble data from the server nodes into a data stream, and send it on out to the client. They describe algorithms for scheduling requests from the interface node to the server node, and for sending data out to the client. They also describe an algorithm for determining whether the system can accept a new request.} }
关注
立即认领
分享
关注
立即认领
分享
基本信息
浏览量:62
职业迁徙
个人简介
暂无内容
研究兴趣
论文共 56 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
arxiv(2023)
2023 5th IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) (2023): 193-202
2020 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)pp.32-41, (2020)
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn