并行读、顺序写系统的最佳复制

Performance Pub Date : 1980-05-28 DOI:10.1145/800199.806165
E. Coffman, E. Gelenbe, R. Wood
{"title":"并行读、顺序写系统的最佳复制","authors":"E. Coffman, E. Gelenbe, R. Wood","doi":"10.1145/800199.806165","DOIUrl":null,"url":null,"abstract":"Frequently used computer elements that can be written by at most one process at a time constitute important bottlenecks in multiprocessor system operation, particularly when such elements are accessible only serially. Hardware devices, data files, system tables and critical sections in general may be examples of such elements. One common way to relieve this congestion is to provide several copies of the element, which can then be read (used) in parallel. However, the requirement that writing (changing) remain sequential means that writing times increase with the number of copies provided. The optimization question in this trade-off is the main concern of this paper. A probability model of such a system is formulated with the objective of obtaining read-rate capacities as a function of read/write loads and the number of copies provided. The above optimization problem is expressed in terms of these results and then solved. In particular, it is shown how to select the number of copies that maximizes the read-rate capacity for given system parameters. Two distinct operating regimes, based on how interrupted read operations are restarted, are analyzed.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1980-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Optimal replication of parallel-read, sequential-write systems\",\"authors\":\"E. Coffman, E. Gelenbe, R. Wood\",\"doi\":\"10.1145/800199.806165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Frequently used computer elements that can be written by at most one process at a time constitute important bottlenecks in multiprocessor system operation, particularly when such elements are accessible only serially. Hardware devices, data files, system tables and critical sections in general may be examples of such elements. One common way to relieve this congestion is to provide several copies of the element, which can then be read (used) in parallel. However, the requirement that writing (changing) remain sequential means that writing times increase with the number of copies provided. The optimization question in this trade-off is the main concern of this paper. A probability model of such a system is formulated with the objective of obtaining read-rate capacities as a function of read/write loads and the number of copies provided. The above optimization problem is expressed in terms of these results and then solved. In particular, it is shown how to select the number of copies that maximizes the read-rate capacity for given system parameters. Two distinct operating regimes, based on how interrupted read operations are restarted, are analyzed.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800199.806165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800199.806165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

一次最多只能由一个进程写入的常用计算机元件构成了多处理器系统操作的重要瓶颈,特别是当这些元件只能串行访问时。一般来说,硬件设备、数据文件、系统表和临界区都可以是这些元素的例子。缓解这种拥塞的一种常见方法是提供元素的多个副本,然后可以并行地读取(使用)这些副本。但是,写入(更改)保持顺序的要求意味着写入时间随着提供的副本数量的增加而增加。这种权衡中的优化问题是本文主要关注的问题。建立了这样一个系统的概率模型,其目标是获得作为读/写负载和提供的副本数量的函数的读速率容量。用这些结果来表示上述优化问题,然后求解。特别是,本文展示了如何在给定系统参数下选择使读取速率容量最大化的副本数量。根据中断的读取操作的重新启动方式,分析了两种不同的操作机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal replication of parallel-read, sequential-write systems
Frequently used computer elements that can be written by at most one process at a time constitute important bottlenecks in multiprocessor system operation, particularly when such elements are accessible only serially. Hardware devices, data files, system tables and critical sections in general may be examples of such elements. One common way to relieve this congestion is to provide several copies of the element, which can then be read (used) in parallel. However, the requirement that writing (changing) remain sequential means that writing times increase with the number of copies provided. The optimization question in this trade-off is the main concern of this paper. A probability model of such a system is formulated with the objective of obtaining read-rate capacities as a function of read/write loads and the number of copies provided. The above optimization problem is expressed in terms of these results and then solved. In particular, it is shown how to select the number of copies that maximizes the read-rate capacity for given system parameters. Two distinct operating regimes, based on how interrupted read operations are restarted, are analyzed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信