In this paper we present the approximate waiting time analysis of two class non-preemptive priority queues. The traffics of the queue are characterized by ”two parameter description”, which means that the mean and the squared coefficient of variation of the inter arrival times and of the service times are given. The solution is based on the separate analysis of the low and high priority queue. ...

Machines whose sole function is to re-order their input data are considered. Every such machine defines a set of allowable input-output pairs of permutations. These sets are studied in terms of the minimal disallowed pairs (the basis). Some allowable sets with small bases are considered including the one defined by a priority queue machine. For more complex machines defined by two or more prior...

This paper discusses admission control in a two-priority system. The main aim is to evaluate the maximum load that can be admitted to a finite low priority buffer when the constraint on the packet loss ratio is given. To calculate the admissible low priority load we propose the approximate analysis that exploits just two first moments of stochastic processes involved. The method lets us derive ...

3 List of Papers 5 Abbreviations 7 Background 9 Introduction 9 Priority setting and rationing – why and what it is 10 Aspects of priority setting and rationing 12 Priority setting at different levels 14 Vertical and horizontal priority setting 14 Explicit and implicit priority setting 15 Central components in priority setting 16 Facts 16 Values 17 Process 18 Synthesis 20 Priority setting in Swe...

Several distributed mutual exclusion algorithms define the order in which requests are satisfied based on the priorities assigned to requests. These algorithms are very useful for real-time applications ones or those where priority is associated to a quality of service requirement. However, priority based strategies may result in starvation problems where high priority requests forever prevent ...