Trading disk capacity for performance

Robert Y. Hou, Y. Patt
{"title":"Trading disk capacity for performance","authors":"Robert Y. Hou, Y. Patt","doi":"10.1109/HPDC.1993.263834","DOIUrl":null,"url":null,"abstract":"Improvements in disk access time have lagged behind improvements in microprocessor and main memory speeds. This disparity has made the storage subsystem a major bottleneck for many applications. Disk arrays that can service multiple disk requests simultaneously are being used to satisfy increasing throughput requirements. Higher throughput rates can be achieved by increasing the number of disks in an array. This increases the number of actuators that are available to service separate requests. It also spreads the data among more disk drives, reducing the seek time as the number of cylinders utilized on each disk drive decreases. The result is an increase in throughput that exceeds the increase in the number of disks. This suggests a tradeoff between the space utilization of disks in an array and the throughput of the array.<<ETX>>","PeriodicalId":226280,"journal":{"name":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1993-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings The 2nd International Symposium on High Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPDC.1993.263834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Improvements in disk access time have lagged behind improvements in microprocessor and main memory speeds. This disparity has made the storage subsystem a major bottleneck for many applications. Disk arrays that can service multiple disk requests simultaneously are being used to satisfy increasing throughput requirements. Higher throughput rates can be achieved by increasing the number of disks in an array. This increases the number of actuators that are available to service separate requests. It also spreads the data among more disk drives, reducing the seek time as the number of cylinders utilized on each disk drive decreases. The result is an increase in throughput that exceeds the increase in the number of disks. This suggests a tradeoff between the space utilization of disks in an array and the throughput of the array.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用磁盘容量换取性能
磁盘访问时间的改进落后于微处理器和主存储器速度的改进。这种差异使得存储子系统成为许多应用程序的主要瓶颈。可以同时处理多个磁盘请求的磁盘阵列正在被用来满足日益增长的吞吐量需求。通过增加阵列中的磁盘数量可以实现更高的吞吐率。这增加了可用于服务单独请求的执行器的数量。它还将数据分散到更多的磁盘驱动器中,随着每个磁盘驱动器上使用的柱面数量的减少,查找时间也会减少。其结果是吞吐量的增加超过了磁盘数量的增加。这表明在阵列中磁盘的空间利用率和阵列的吞吐量之间进行权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A methodology for evaluating load balancing algorithms A message passing interface for parallel and distributed computing Distributed computing systems and checkpointing DARTS-a dynamically adaptable transport service suitable for high speed networks p4-Linda: a portable implementation of Linda
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1