Efficient striping techniques for multimedia file servers

Prashant Shenoy, H. Vin
{"title":"Efficient striping techniques for multimedia file servers","authors":"Prashant Shenoy, H. Vin","doi":"10.1109/NOSDAV.1997.629332","DOIUrl":null,"url":null,"abstract":"The performance of striped disk arrays is governed by two parameters: the stripe unit size and the degree of striping. The authors describe techniques for determining the stripe unit size and degree of striping for disk arrays storing variable bit rate continuous media data. They present an analytical model that uses the server configuration and the workload characteristics to predict the load on the most heavily loaded disk in redundant and non-redundant arrays. They then use the model to determine the optimal stripe unit size for different workloads. They also use the model to study the effect of various system parameters on the optimal stripe unit size. To determine the degree of striping, they first demonstrate that striping a continuous media stream across all disks in the array causes the number of clients supported to increase sub-linearly with increase in the number of disks. To maximize the number of clients supported in large arrays, they propose a technique that partitions a disk array and stripes each media stream across a single partition. Since load imbalance can occur in such partitioned arrays, they present an analytical model to compute the imbalance across partitions in the array. They then use the model to determine a partition size that minimizes the load imbalance, and hence, maximizes the number of clients supported by the array.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"64","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOSDAV.1997.629332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 64

Abstract

The performance of striped disk arrays is governed by two parameters: the stripe unit size and the degree of striping. The authors describe techniques for determining the stripe unit size and degree of striping for disk arrays storing variable bit rate continuous media data. They present an analytical model that uses the server configuration and the workload characteristics to predict the load on the most heavily loaded disk in redundant and non-redundant arrays. They then use the model to determine the optimal stripe unit size for different workloads. They also use the model to study the effect of various system parameters on the optimal stripe unit size. To determine the degree of striping, they first demonstrate that striping a continuous media stream across all disks in the array causes the number of clients supported to increase sub-linearly with increase in the number of disks. To maximize the number of clients supported in large arrays, they propose a technique that partitions a disk array and stripes each media stream across a single partition. Since load imbalance can occur in such partitioned arrays, they present an analytical model to compute the imbalance across partitions in the array. They then use the model to determine a partition size that minimizes the load imbalance, and hence, maximizes the number of clients supported by the array.
多媒体文件服务器的高效条带化技术
分条磁盘阵列的性能主要由两个参数决定:分条单元大小和分条程度。作者描述了用于存储可变比特率连续媒体数据的磁盘阵列确定条带单位大小和条带程度的技术。他们提出了一个分析模型,该模型使用服务器配置和工作负载特征来预测冗余和非冗余阵列中负载最重的磁盘上的负载。然后,他们使用该模型来确定不同工作负载的最佳条带单元大小。他们还利用该模型研究了各种系统参数对最优条纹单元尺寸的影响。为了确定条带化的程度,他们首先证明了在阵列中的所有磁盘上对连续媒体流进行条带化会导致支持的客户机数量随着磁盘数量的增加而呈亚线性增长。为了最大限度地增加大型阵列中支持的客户机数量,他们提出了一种技术,该技术对磁盘阵列进行分区,并在单个分区上划分每个媒体流。由于负载不平衡可能发生在这样的分区数组中,因此他们提出了一个分析模型来计算数组中分区之间的不平衡。然后,他们使用该模型确定分区大小,使负载不平衡最小化,从而使阵列支持的客户机数量最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信