Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obt...

This paper addresses scheduling and memory management in input queued switches having finite buffer space to improve the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. We introduce a buf...

The paper studies a single-server queueing system with autonomous service and l priority classes. Arrival and departure processes are defined by marked point processes. There are l buffers corresponding to priority classes, and upon arrival a unit of the kth priority class occupies the place in the kth buffer. Let N , k = 1, 2, . . . , l denote the quota for the total kth buffer content. The va...

In this paper, we consider a discrete time queueing system fed by a superposition of an ON and OFF source with heavy tail ON periods and geometric OFF periods and a D-BMAP (Discrete Batch Markovian Arrival Process). We study the tail behavior of the queue length distribution and both infinite and finite buffer systems are considered. In the infinite buffer case, we show that the asymptotic tail...

The paper studies a single-server queueing system with autonomous service and l priority classes. Arrival and departure processes are governed by marked point processes. There are l buffers corresponding to priority classes, and upon arrival a unit of the kth priority class occupies a place in the kth buffer. Let N , k = 1, 2, . . . , l denote the quota for the total kth buffer content. The val...

Stencil computations on low dimensional grids are kernels of many scientific applications including finite difference methods used to solve partial differential equations. On typical modern computer architectures such stencil computations are limited by the performance of the memory subsystem, namely by the bandwidth between main memory and the cache. This work considers the computation of star...

Riparian buffers can influence water quality in downstream lakes or rivers by buffering non-point source pollution in upstream agricultural fields. With increasing nitrogen (N) pollution in small agricultural watersheds, a major function of riparian buffers is to retain N in the soil. A series of field experiments were conducted to monitor pollutant transport in riparian buffers of small waters...

For finite-buffer manufacturing systems, the major stability issue is ‘deadlock’, rather than ‘bounded-buffer-length stability.’ The paper introduces the concept of ‘system deadlock,’ defined rigorously in Petri net terms, and system operation with uninterrupted part-flow is characterised in terms of the absence of this condition. For a large class of finite-buffer multiclass re-entrant flowlin...

In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varies with respect to the state of an underlying continuous-time Markov chain. We present a novel algorithmic approach to solve numerically for the steady-state solution of such queues. Using this approach, both infiniteand finite-buffer cases are studied. We show that the solution of the infinite-bu...