A cost analysis of multiprogramming and swap-time in a time-sharing system

ACM-SE 14 Pub Date : 1976-04-22 DOI:10.1145/503561.503587
P. Mills
{"title":"A cost analysis of multiprogramming and swap-time in a time-sharing system","authors":"P. Mills","doi":"10.1145/503561.503587","DOIUrl":null,"url":null,"abstract":"In a t~me-sharing system the most important aspect of performance is the response time to the user. The question of making improvements to the hardware must be evaluated in terms of how it will improve the response time to the user. The average cost of a single interaction (C I) for N active term%nals including the cost of the user's time at th~ terminal is: where CII = CS* (R+T k}/T+N*H* (R+T k)/T C S = Hardware cost for t~me period T W = Wages of user for t~me period T R = Average response time and T k = average think time R+T k = Average time for one interaction assuming additional hardware cost is ~&C S cause a decrease in the response time AR, then C12 = (Cs+ZICs)* (R-LLR+Tk)/T+N*W* (R-~+Tk)/T if ~C S <~R/CR-~R+Tk)*(Cs+N*W) then C12 < CII The above relation shows that an additional hardware cost~C is cost effective if it is less th~n AR/(R-AR+T k) times the cost of the original system plus the wages of N persons. The cost may be lease or purchase over any time period as long as the same time period is used for Cs,~C S and W. Figure I. shows the flow of a process associated with a specific terminal in a time-sharing system. Once a user completes his thinking at a terminal he responds to the system by typing input at his k~o His request for service waits on the swap queue until the code associated with his process can be read into memory. The request waits on the swap queue until all requests in front are serviced. Upon the completion of a swap operation the process must wait on the CPU queue for the use of the CPU. Once the process is given control of the CPU it willterminate by requesting input from the terminal. All queuing is first come first serve. The time for an interaction is the time to complete a full cycle in Figure I° The response time is an interaction time, minus the think time or.the swap queue time, plus the swap t_ime, plus the CPUqueue time, plus CPU time.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 14","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503561.503587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In a t~me-sharing system the most important aspect of performance is the response time to the user. The question of making improvements to the hardware must be evaluated in terms of how it will improve the response time to the user. The average cost of a single interaction (C I) for N active term%nals including the cost of the user's time at th~ terminal is: where CII = CS* (R+T k}/T+N*H* (R+T k)/T C S = Hardware cost for t~me period T W = Wages of user for t~me period T R = Average response time and T k = average think time R+T k = Average time for one interaction assuming additional hardware cost is ~&C S cause a decrease in the response time AR, then C12 = (Cs+ZICs)* (R-LLR+Tk)/T+N*W* (R-~+Tk)/T if ~C S <~R/CR-~R+Tk)*(Cs+N*W) then C12 < CII The above relation shows that an additional hardware cost~C is cost effective if it is less th~n AR/(R-AR+T k) times the cost of the original system plus the wages of N persons. The cost may be lease or purchase over any time period as long as the same time period is used for Cs,~C S and W. Figure I. shows the flow of a process associated with a specific terminal in a time-sharing system. Once a user completes his thinking at a terminal he responds to the system by typing input at his k~o His request for service waits on the swap queue until the code associated with his process can be read into memory. The request waits on the swap queue until all requests in front are serviced. Upon the completion of a swap operation the process must wait on the CPU queue for the use of the CPU. Once the process is given control of the CPU it willterminate by requesting input from the terminal. All queuing is first come first serve. The time for an interaction is the time to complete a full cycle in Figure I° The response time is an interaction time, minus the think time or.the swap queue time, plus the swap t_ime, plus the CPUqueue time, plus CPU time.
分时系统中多路编程和切换时间的成本分析
在t~me共享系统中,性能最重要的方面是对用户的响应时间。对硬件进行改进的问题必须根据如何改进对用户的响应时间来进行评估。N个有效项%nals(包括用户在终端的时间成本)的单次交互平均成本(ci)为:其中CII = CS* (R+ tk}/T+N*H* (R+ tk)/T CS = T ~me期间的硬件成本T W =用户T ~me期间的工资T R =平均响应时间,T k =平均思考时间R+ tk =假设额外硬件成本为~&C S,一次交互的平均时间导致响应时间AR减少;那么C12 = (Cs+ZICs)* (R- llr +Tk)/T+N*W* (R-~+Tk)/T如果~ Cs <~R/CR-~R+Tk)*(Cs+N*W)则C12 < CII以上关系表明,如果额外的硬件成本~C小于~ N AR/(R-AR+ Tk)乘以原始系统的成本加上N个人的工资,则成本有效。成本可以是任何时间段的租赁或购买,只要同一时间段用于C、~C、S和w。图1显示了在分时系统中与特定终端相关联的流程流。一旦用户在终端上完成了他的思考,他就以自己的方式输入信息来响应系统。他的服务请求在交换队列上等待,直到与他的进程相关的代码被读入内存。请求在交换队列上等待,直到前面的所有请求都得到服务。在交换操作完成后,进程必须等待CPU队列使用CPU。一旦进程获得了CPU的控制权,它将通过从终端请求输入而终止。所有排队者先到先得。交互的时间是图1中完成一个完整周期的时间。响应时间是交互时间,减去思考时间。交换队列时间,加上交换t_ime,加上CPUqueue时间,再加上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学术官方微信