探讨计算机系统中文件的多副本文件分配模型

ACM-SE 17 Pub Date : 1979-04-09 DOI:10.1145/503506.503515
L. G. Jones, D. Foster
{"title":"探讨计算机系统中文件的多副本文件分配模型","authors":"L. G. Jones, D. Foster","doi":"10.1145/503506.503515","DOIUrl":null,"url":null,"abstract":"The placement of files among computer system storage devices can have a significant impact on system performance. Here we present a method to represent multiple copies of read-write files that accounts for the overhead involved in updates. We then present a solution technique for the file assignment problem for the case of read-write files without multiple copies. The technique analyzes the system as a network of queues and assigns files to devices by integer programming. The resultant file assignment is optimal with respect to CPU throughput.","PeriodicalId":258426,"journal":{"name":"ACM-SE 17","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Toward a multiple copy file assignment model for files in a computer system\",\"authors\":\"L. G. Jones, D. Foster\",\"doi\":\"10.1145/503506.503515\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The placement of files among computer system storage devices can have a significant impact on system performance. Here we present a method to represent multiple copies of read-write files that accounts for the overhead involved in updates. We then present a solution technique for the file assignment problem for the case of read-write files without multiple copies. The technique analyzes the system as a network of queues and assigns files to devices by integer programming. The resultant file assignment is optimal with respect to CPU throughput.\",\"PeriodicalId\":258426,\"journal\":{\"name\":\"ACM-SE 17\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1979-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 17\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/503506.503515\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 17","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503506.503515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在计算机系统存储设备之间放置文件会对系统性能产生重大影响。在这里,我们提出了一种方法来表示读写文件的多个副本,这种方法考虑了更新所涉及的开销。然后,我们提出了一种解决读写文件无多副本情况下的文件分配问题的方法。该技术将系统分析为一个队列网络,并通过整数编程将文件分配给设备。就CPU吞吐量而言,最终的文件分配是最优的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Toward a multiple copy file assignment model for files in a computer system
The placement of files among computer system storage devices can have a significant impact on system performance. Here we present a method to represent multiple copies of read-write files that accounts for the overhead involved in updates. We then present a solution technique for the file assignment problem for the case of read-write files without multiple copies. The technique analyzes the system as a network of queues and assigns files to devices by integer programming. The resultant file assignment is optimal with respect to CPU throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信