SIGMETRICS '86/PERFORMANCE '86最新文献

筛选
英文 中文
Queueing systems with a procrastinating server 具有延迟服务器的排队系统
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317557
M. Hofri
{"title":"Queueing systems with a procrastinating server","authors":"M. Hofri","doi":"10.1145/317499.317557","DOIUrl":"https://doi.org/10.1145/317499.317557","url":null,"abstract":"Two related problems are analyzed and discussed:<list><item>A queueing system that differs from the standard M/G/1 only in that at the end of a busy-period the server takes a sequence of vacations, inspecting the state of the queue at the end of each. When the length of the queue exceeds a predetermined level <italic>m</italic> it returns to serve the queue exhaustively.\u0000</item><item>Two queues, with Poisson arrivals and general service-time distributions are attended by a single server. When the server is positioned at a certain queue it will serve the latter exhaustively, and at busy-period end will only switch to the other if the queue length there exceeds in size a predetermined threshold <italic>m</italic><subscrpt>i</subscrpt>.\u0000</item></list>\u0000The treatment combines analytic and numerical methods. Only steady-state results are presented.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126925569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
The analysis and performance of batching arbiters 批处理仲裁器的分析与性能
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317537
L. Kleeman, A. Cantoni
{"title":"The analysis and performance of batching arbiters","authors":"L. Kleeman, A. Cantoni","doi":"10.1145/317499.317537","DOIUrl":"https://doi.org/10.1145/317499.317537","url":null,"abstract":"A class of arbiters, known as batching arbiters, is introduced and defined. A particularly simple decentralised example of a batching arbiter is described, with motivation given for the batching arbiter model adopted. It is shown that under reasonable assumptions, batching arbiters can be described by a finite state Markov chain. The key steps in the analysis of the arbiter performance are the method of assigning states, evaluation of state transition probabilities and showing that the Markov chain is irreducible. Arbiter performance parameters are defined, such as proportion of time allocated to each requester and mean waiting time for each requester. Apart from results describing the steady state behavior of the arbiter for general system parameters, a number of limiting results are also obtained corresponding to light and heavy request loading.\u0000Finally, numerical results of practical interest are presented, showing the performance parameters of the arbiter versus request rates for various configurations.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116414314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
ARMA models of program behaviour 程序行为的ARMA模型
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317550
I. Haikala
{"title":"ARMA models of program behaviour","authors":"I. Haikala","doi":"10.1145/317499.317550","DOIUrl":"https://doi.org/10.1145/317499.317550","url":null,"abstract":"In models of virtual memory computer systems, it is generally assumed that the time intervals between the page (or segment) faults, often called lifetimes, are independent from each other. Due to the phase-transition behaviour in many real programs this is not always true, and strong correlations may exist between successive lifetimes. These correlations may have a notable effect on the system behaviour. This paper describes a series of experiments where autoregressive -moving average (ARMA) models are used to describe the correlation structure in sequences of lifetimes. It is shown that many real program executions can be described with models having four parameters only, i.e. with the ARMA(1,1) models. The models can be used as parts of simulation models for instance, and they also give us better understanding about the program behaviour in general.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128783167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Performance of real-time bus scheduling algorithms 实时公交调度算法的性能
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317538
J. Lehoczky, L. Sha
{"title":"Performance of real-time bus scheduling algorithms","authors":"J. Lehoczky, L. Sha","doi":"10.1145/317499.317538","DOIUrl":"https://doi.org/10.1145/317499.317538","url":null,"abstract":"When periodic tasks with hard deadlines communicate over a bus, the problem of hard real-time bus scheduling arises. This paper addresses several problems of hard real-time bus scheduling, including the evaluation of scheduling algorithms and the issues of message packet pacing, preemption, priority granularity and buffering.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131204636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 145
Footprints in the cache 缓存中的足迹
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317533
H. Stone, D. Thiébaut
{"title":"Footprints in the cache","authors":"H. Stone, D. Thiébaut","doi":"10.1145/317499.317533","DOIUrl":"https://doi.org/10.1145/317499.317533","url":null,"abstract":"This paper develops an analytical model for a cache-reload transient. When an interrupt program or system program runs periodically in a cache-based computer, a short cache-reload transient occurs each time the interrupt program is invoked. That transient depends on the size of the cache, the fraction of the cache used by the interrupt program, and the fraction of the cache used by background programs that run between interrupts. We call the portion of a cache used by a program its footprint in the cache, and we show that the reload transient is related to the area in the tail of a normal distribution whose mean is a function of the footprints of the programs that compete for the cache. We believe that the model may be useful as well for predicting paging behavior in virtual-memory systems with round-robin scheduling.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128972843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 138
An efficient algorithm for semi-homogeneous queueing network models 半齐次排队网络模型的一种高效算法
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317542
A. Conway, N. Georganas
{"title":"An efficient algorithm for semi-homogeneous queueing network models","authors":"A. Conway, N. Georganas","doi":"10.1145/317499.317542","DOIUrl":"https://doi.org/10.1145/317499.317542","url":null,"abstract":"The class of product-form semi-homogeneous queueing networks is introduced as a generalization of the class of homogeneous networks, which has been considered by Balbo et al for the performance modeling of local area networks. In semi-homogeneous networks, the relative traffic intensity at the various shared resources may depend on the routing chain to which a customer belongs. We develop an efficient algorithm for the exact analysis of this class of networks. It is based on the equations which form the foundation of RECAL, a general purpose exact algorithm for multiple-chain closed queueing networks. The complexity of the algorithm is shown to be of order less than exponential in (P-1)1/2, where P is the number of processors (workstations) in the network. It is therefore, in general, more efficient than a direct application of either convolution, MVA or RECAL to the class of semi-homogeneous queueing networks. The algorithm presented here may be situated between the algorithms of Balbo et al and the general purpose algorithms, both in terms of its generality and efficiency.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132509497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Performance modelling of parallel computer architectures 并行计算机体系结构的性能建模
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317535
P. Harrison, T. Field
{"title":"Performance modelling of parallel computer architectures","authors":"P. Harrison, T. Field","doi":"10.1145/317499.317535","DOIUrl":"https://doi.org/10.1145/317499.317535","url":null,"abstract":"In this paper we describe two types of complex server aggregations which can be used to model collections of components in certain types of parallel computer systems and give a case study showing how the aggregations may be applied in practice. Analytical models of such systems are becoming increasingly important as a means of guiding the often complex design processes, particularly since recent developments in VLSI technology now make it possible to fabricate many paper-designs hitherto impractical for reasons of cost. We argue that aggregations of the type described are essential in the modelling of parallel systems; using the proposed techniques, large numbers of components can be modelled as queue-length-dependent servers within a queueing network in which the number of servers is the same as the number of distinct types of processing element in the system being modelled. Because the number of severs in the model is fixed i.e. is independent of the number of processors, very large multiprocessor systems can be modelled efficiently with no explosion in the size of the state space.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"17 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121958605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Performance analysis of an algorithm for concurrency control in replicated database systems 复制数据库系统并发控制算法的性能分析
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317549
M. Singhal, A. Agrawala
{"title":"Performance analysis of an algorithm for concurrency control in replicated database systems","authors":"M. Singhal, A. Agrawala","doi":"10.1145/317499.317549","DOIUrl":"https://doi.org/10.1145/317499.317549","url":null,"abstract":"In this paper, we analyze the performance of a concurrency control algorithm for replicated database systems. We present a model of a distributed database system which provides a framework to study the performance of different concurrency control algorithms. We discuss performance criteria to evaluate different algorithms. We use the model to analyze the performance of an algorithm for concurrency control in replicated database systems. The technique used in analysis is iterative and approximate. We plot a set of performance measures for several values of the model parameters. The results of analysis are compared against a simulation study.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Optimal multiplexing of heterogeneous traffic with hard constraint 硬约束异构流量的最优复用
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317543
P. Nain, K. Ross
{"title":"Optimal multiplexing of heterogeneous traffic with hard constraint","authors":"P. Nain, K. Ross","doi":"10.1145/317499.317543","DOIUrl":"https://doi.org/10.1145/317499.317543","url":null,"abstract":"Considered are optimal dynamic policies for multiplexing &Kgr; + 1 heterogeneous traffic types onto a single communication channel. The packet types arrive to the channel according to independent Poisson processes. The service requirements are exponential with type dependent means. The optimization criterion is to minimize a linear combination of the average delays for packet types 1 to &Kgr;, while simultaneously subjecting the average delay of type-0 packets to a hard constraint. The optimal multiplexing policy is shown to be a randomized modification of the “μc rule”. The optimization problem is thereby reduced to a problem of finding the optimal randomization factor; an algorithm, which can be implemented in real time, is given to do this for two particular cases.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125929712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
A generalization of mean value analysis to higher moments: moment analysis 将均值分析推广到更高矩:矩分析
SIGMETRICS '86/PERFORMANCE '86 Pub Date : 1986-05-01 DOI: 10.1145/317499.317546
J. Strelen
{"title":"A generalization of mean value analysis to higher moments: moment analysis","authors":"J. Strelen","doi":"10.1145/317499.317546","DOIUrl":"https://doi.org/10.1145/317499.317546","url":null,"abstract":"Closed product-form queueing networks are considered. Recursive schemata are proposed for the higher moments of the number of customers in the queues, called “moment analysis”. As with mean value analysis (MVA), in general no state probabilities are needed. Approximation techniques for these schemata similar to those existing for MVA are introduced.","PeriodicalId":445002,"journal":{"name":"SIGMETRICS '86/PERFORMANCE '86","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1986-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126437748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书