An analytic model of CP-67 - VM/370

Y. Bard
{"title":"An analytic model of CP-67 - VM/370","authors":"Y. Bard","doi":"10.1145/800122.803955","DOIUrl":null,"url":null,"abstract":"The paper describes an analytic model of CP-67 - VM/370 (1, 2). Each user (virtual machine) on the system is in one of four states (see Figure 1): dormant (“Console”), receiving interactive service (“Q1”), waiting for batch service (“Queue”), or receiving batch service (“Q2”) The users receiving batch service form the multi-programmed set, and are described by a cyclic queuing network of the Gordon-Newell type (3,4,5). The effect of interactive users is treated by assuming that a fixed portion of system resources is dedicated to them. In order to solve this queuing problem for a given multi-programming level it is necessary to have information on the ratio of channel to CPU busy times. Some of the channel requirements are due to paging, and hence it is necessary to have a characterization of the paging rate vs. memory requirements of various programs.","PeriodicalId":386817,"journal":{"name":"Workshop on Virtual Computer Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1973-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Virtual Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800122.803955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

The paper describes an analytic model of CP-67 - VM/370 (1, 2). Each user (virtual machine) on the system is in one of four states (see Figure 1): dormant (“Console”), receiving interactive service (“Q1”), waiting for batch service (“Queue”), or receiving batch service (“Q2”) The users receiving batch service form the multi-programmed set, and are described by a cyclic queuing network of the Gordon-Newell type (3,4,5). The effect of interactive users is treated by assuming that a fixed portion of system resources is dedicated to them. In order to solve this queuing problem for a given multi-programming level it is necessary to have information on the ratio of channel to CPU busy times. Some of the channel requirements are due to paging, and hence it is necessary to have a characterization of the paging rate vs. memory requirements of various programs.
CP-67 - VM/370的解析模型
本文描述了CP-67 - VM/370(1,2)的分析模型。系统上的每个用户(虚拟机)处于四种状态之一(见图1):休眠(“控制台”)、接受交互服务(“Q1”)、等待批处理服务(“队列”)或接受批处理服务(“Q2”)。接受批处理服务的用户构成多程序集,并由Gordon-Newell型(3,4,5)的循环排队网络描述。交互式用户的影响是通过假设系统资源的固定部分专用于他们来处理的。为了解决给定多编程级别的排队问题,有必要获得通道与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学术文献互助群
群 号:481959085
Book学术官方微信