A model of shared dasd and multipathing

Performance Pub Date : 1980-05-28 DOI:10.1145/800199.806157
Y. Bard
{"title":"A model of shared dasd and multipathing","authors":"Y. Bard","doi":"10.1145/800199.806157","DOIUrl":null,"url":null,"abstract":"This paper presents a model of an I/O subsystem in which devices can be accessed from multiple CPUs and/or via alternative channel and control unit paths. The model estimates access response times, given access rates for all CPU-device combinations. The systems treated are those having the IBM System/370 architecture, with each path consisting of a CPU, channel, control unit, head of string, and device with rotational position sensing. The path selected for an access at seek initiation time remains in effect for the entire channel program. The computation proceeds in three stages: First, the feasibility of the prescribed access rates is determined by solving a linear programming problem. Second, the splitting of access rates among the available paths is determined so as to satisfy the following principle: The probability of selecting a given path is proportional to the probability that the path is free. This condition leads to a set of nonlinear equations, which can be solved by means of the Newton-Raphson method. Third, the RPS hit probability, i.e. the probability that the path is free when the device is ready to transmit, is computed in the following manner: From the point of view of the selected path, the system may be viewed as being in one of 25 possible states. There are twelve different subsets of states whose aggregate probabilities can be computed from the (by now) known flow rates over the various paths. The maximum entropy principle is used to calculate the unknown state probabilities, with the known aggregate probabilities acting as constraints. The required RPS hit probability can be computed easily once the state probabilities have been determined. Explicit formulas are given for all these quantities. Empirically derived formulas are used to compute the RPS miss probability on subsequent revolutions, given the probability on the first revolution. The model is validated against a simulator, showing excellent agreement for systems with path utilizations up to 50 percent. The model is also validated against measurements from a real three-CPU system with 31 shared devices. In this validation, the I/O subsystem model acts as a common submodel to three copies of a system model, one for each CPU. Estimated end-user transaction response times show excellent agreement with the live measurements.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"150 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"1980-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800199.806157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

This paper presents a model of an I/O subsystem in which devices can be accessed from multiple CPUs and/or via alternative channel and control unit paths. The model estimates access response times, given access rates for all CPU-device combinations. The systems treated are those having the IBM System/370 architecture, with each path consisting of a CPU, channel, control unit, head of string, and device with rotational position sensing. The path selected for an access at seek initiation time remains in effect for the entire channel program. The computation proceeds in three stages: First, the feasibility of the prescribed access rates is determined by solving a linear programming problem. Second, the splitting of access rates among the available paths is determined so as to satisfy the following principle: The probability of selecting a given path is proportional to the probability that the path is free. This condition leads to a set of nonlinear equations, which can be solved by means of the Newton-Raphson method. Third, the RPS hit probability, i.e. the probability that the path is free when the device is ready to transmit, is computed in the following manner: From the point of view of the selected path, the system may be viewed as being in one of 25 possible states. There are twelve different subsets of states whose aggregate probabilities can be computed from the (by now) known flow rates over the various paths. The maximum entropy principle is used to calculate the unknown state probabilities, with the known aggregate probabilities acting as constraints. The required RPS hit probability can be computed easily once the state probabilities have been determined. Explicit formulas are given for all these quantities. Empirically derived formulas are used to compute the RPS miss probability on subsequent revolutions, given the probability on the first revolution. The model is validated against a simulator, showing excellent agreement for systems with path utilizations up to 50 percent. The model is also validated against measurements from a real three-CPU system with 31 shared devices. In this validation, the I/O subsystem model acts as a common submodel to three copies of a system model, one for each CPU. Estimated end-user transaction response times show excellent agreement with the live measurements.
共享数据和多路径的模型
本文提出了一个I/O子系统的模型,其中设备可以从多个cpu和/或通过替代通道和控制单元路径访问。在给定所有cpu设备组合的访问速率的情况下,该模型估计访问响应时间。所处理的系统是那些具有IBM System/370体系结构的系统,每个路径由CPU、通道、控制单元、串头和具有旋转位置传感的设备组成。在寻道启动时为访问选择的路径对整个信道程序保持有效。计算分三个阶段进行:首先,通过求解一个线性规划问题来确定指定存取率的可行性;其次,确定可用路径之间的访问速率分割,以满足以下原则:选择给定路径的概率与路径空闲的概率成正比。这种情况导致了一组非线性方程,可以用牛顿-拉夫逊方法求解。第三,RPS命中概率,即当设备准备好传输时路径空闲的概率,按以下方式计算:从所选路径的角度来看,系统可能处于25种可能状态中的一种。有12个不同的状态子集,它们的总概率可以从(到目前为止)已知的各种路径上的流量计算出来。利用最大熵原理计算未知状态概率,以已知的聚合概率作为约束条件。一旦确定了状态概率,就可以很容易地计算出所需的RPS命中概率。给出了所有这些量的显式公式。在给定第一次旋转概率的情况下,使用经验推导公式计算后续旋转的RPS脱手概率。该模型在模拟器上进行了验证,对于路径利用率高达50%的系统显示出良好的一致性。该模型还通过一个具有31个共享设备的实际三cpu系统的测量结果进行了验证。在此验证中,I/O子系统模型充当系统模型三个副本的公共子模型,每个副本对应一个CPU。估计的终端用户事务响应时间与实时测量结果非常吻合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信