Journal ArticleDOI
Realizable Performance Vectors of a Finite-Source Queue
TLDR
A necessary and sufficient condition for a performance vector consisting of utilization factors or average response times of the processor for the jobs to be achievable by some scheduling strategy is obtained.Abstract:
We study a scheduling problem on a finite-source queueing model which is identical to a two-stage closed Markovian cyclic queue consisting of a single-server "processor" and an infinite-server "terminals"; each job has a distinct mean service time at the processor. We obtain a necessary and sufficient condition for a performance vector consisting of utilization factors or average response times of the processor for the jobs to be achievable by some scheduling strategy. The result is analogous to that obtained by Coffman and Mitrani on infinite-source single-server queues.read more
Citations
More filters
Dissertation
Performance and reliability modelling of computing systems using spectral expansion
TL;DR: A comparative study is performed to show that the spectral expansion algorithm has an edge over the matrix-geometric method, in computational efficiency, accuracy and ease of use.
Journal ArticleDOI
Heterogeneous multiprocessor systems with breakdowns: performance and optimal repair strategies
Ram Chakka,Isi Mitrani +1 more
TL;DR: In this paper, a model of a system with N parallel processors subject to occasional interruptions of service, and a common unbounded queue fed by a Poisson arrival stream, is analyzed in the steady state.
Heterogeneous Multiprocessor Systems wilh Breakdowns: Performance and Optimal Repair Strategies
Ram Chakka,Isi Mitrani +1 more
TL;DR: A model of a system with N parallel processors subject to occasional interruptions of service, and a common unbounded queue fed by a Poisson arrival stream, is analyzed in the steady state and the problem of optimizing the repair policy is addressed.
Journal ArticleDOI
Optimal policies for scheduling repairs and allocating heterogeneous servers
TL;DR: In this paper, the authors considered the machine repairman model with non-identically distributed exponential return times and a single server with job dependent service times and constructed a coupling framework that provides a simple unified proof that strengthens many of the results in the literature, and generalizes easily to prove several new results.
Reference EntryDOI
Conservation Laws and Related Applications
TL;DR: In certain queueing models, the work conservation principle yields work conservation laws, which are linear constraints on performance measures that give an exact or relaxed linear programming formulation of the region of achievable performance spanned under admissible scheduling policies.
References
More filters
Book
Analysis and synthesis of computer systems
Erol Gelenbe,Isi Mitrani +1 more
TL;DR: This paper presents a monographs on characterisation and control of Achievable Performance Control of Performance in Mutliple-Resource Systems and a Queue with Server of Walking Type.
Journal ArticleDOI
A Characterization of Waiting Time Performance Realizable by Single-Server Queues
Edward G. Coffman,Isi Mitrani +1 more
TL;DR: Making use of a well known conservation law, this work proves a necessary and sufficient condition for the existence of a scheduling strategy that achieves the desired performance.
Journal ArticleDOI
A Finite-Source Queue with Different Customers
TL;DR: It is shown that the often used dynamic dispatching pohcy is optimal within the framework of this multiprogramming model, and the range within which these properties hold is discussed, and some examples are given.
Journal ArticleDOI
Complete parameterized families of job scheduling strategies
Isi Mitrani,J. H. Hine +1 more
TL;DR: In this paper, the concept of a family of scheduling strategies in which a few parameters may be varied to achieve different performance levels is introduced, and the use of such families in satisfying performance requirements stated in terms of average response times for jobs of different classes is studied.