Performance最新文献_第10页

Calculating equilibrium probabilities for λ(n)/Ck/1/N queues 计算λ(n)/Ck/1/ n队列的均衡概率

Performance Pub Date : 1980-08-01 DOI: 10.1145/1009375.806155

Raymond A. Marie

引用次数: 103

Computational algorithms for product form queueing networks 产品表单排队网络的计算算法

Performance Pub Date : 1980-05-28 DOI: 10.1145/1009375.806144

K. Chandy, C. H. Sauer

引用次数: 57

Aspects of software design analysis: Concurrency and blocking 软件设计分析方面:并发和阻塞

Performance Pub Date : 1980-05-28 DOI: 10.1145/800199.806169

C. U. Smith, J. Browne

引用次数: 26

Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues 计算&lgr;(n)/Ck/1/ n队列的均衡概率

Performance Pub Date : 1980-05-28 DOI: 10.1145/800199.806155

Raymond A. Marie

引用次数: 80

Prevention of task overruns in real-time non-preemptive multiprogramming systems 实时非抢占式多路编程系统中任务超支的预防

Performance Pub Date : 1980-05-28 DOI: 10.1145/800199.806173

K. Kim, Mahmoud Naghibzadeh

{"title":"Prevention of task overruns in real-time non-preemptive multiprogramming systems","authors":"K. Kim, Mahmoud Naghibzadeh","doi":"10.1145/800199.806173","DOIUrl":"https://doi.org/10.1145/800199.806173","url":null,"abstract":"Real-time multiprogramming systems, in which a hardware processor is dynamically assigned to run multiple software processes each designed to control an important device (user), are considered. Each software process executes a task in response to a service request repeatedly coming from the corresponding user. Each service task is associated with a strict deadline, and thus the design problem that we are concerned with is to ensure that the service tasks requested can always be executed within the associated deadlines, i.e., no task overrun occurs. This problem was studied by several investigators for the cases where preemptive scheduling strategies are used. In contrast, very few studies have been conducted for cases of non-preemptive scheduling. In this paper we show that a non-preemptive strategy, called relative urgency non-preemptive (RUNP) strategy, is optimal in the sense that if a system runs without a task overrun under any non-preemptive strategy, it will also run without a task overrun under the RUNP strategy. Then an efficient procedure used at the design time for detecting the possibility of a task overrun in a system using the RUNP strategy is presented. The procedure is useful in designing overrun-free real-time multiprogramming systems that yield high processor utilizations. Some special types of systems using the RUNP strategy for which even simpler detection procedures are available are also discussed.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"101 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"1980-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77269790","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

Analysis of an intrinsic overload control for a class of queueing systems 一类排队系统的内在过载控制分析

Performance Pub Date : 1980-05-28 DOI: 10.1145/800199.806168

Y. T. Wang

引用次数: 2

On homogeneity in M/G/1 queueing systems M/G/1排队系统的同质性

Performance Pub Date : 1980-05-28 DOI: 10.1145/800199.806164

R. Bryant

引用次数: 1

Hardware configuration selection through discretizing a continuous variable solution 硬件配置选择通过离散连续变量求解

Performance Pub Date : 1980-05-28 DOI: 10.1145/800199.806156

R. Wagner, Kishor S. Trivedi