In the nonpreemptive highest-response-ratio-next discipline, the priority of a job is defined as the ratio of the time it has spent in the system to its service requirement. We evaluate the performance of this discipline by deriving an expression for the average waiting time of a job conditioned on its service requirement for arbitrary service time distributions. This expression is then evaluated analytically for constant service times and by a combination of analytical and numerical methods for hypoexponential, exponential, and hyperexponential distributions. For the latter, our exact result is compared with Br inch Hansen's approximation. We plot our results together with the waiting times of the first-come first-serve and shortest-job-fi...
Abstract—In this paper, the author extends the traditional exact schedulability analysis for fixed p...
We investigate the use of priority mechanisms when assigning service engineers to customers as a too...
This paper describes a stochastic analysis framework for general priority-driven periodic real-time ...
This paper provides an exact and sustainable schedulability test for a set of non-preemptive jobs sc...
We are interested in queues in which customers of different classes arrive to a service facility, an...
This paper introduces an analytical method for approximating the performance of a two-class priority...
We investigate the use of priority mechanisms when assigning service engineers to customers as a too...
The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing ti...
Since worst case response times must be determined repeatedly during the interactive design of real-...
This paper compares the performance of three classes of scheduling algorithms for real-time systems ...
This paper focuses on the hierarchical scheduling of systems where a number of separate applications...
Hokstad recently published an approximate method for calculating the behaviour of an M/G/m queue. Th...
This paper presents a new schedulability analysis methodology for distributed hard real-time systems...
We consider the mean delay optimization in the M/G/1 queue for service time distributions that have ...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
Abstract—In this paper, the author extends the traditional exact schedulability analysis for fixed p...
We investigate the use of priority mechanisms when assigning service engineers to customers as a too...
This paper describes a stochastic analysis framework for general priority-driven periodic real-time ...
This paper provides an exact and sustainable schedulability test for a set of non-preemptive jobs sc...
We are interested in queues in which customers of different classes arrive to a service facility, an...
This paper introduces an analytical method for approximating the performance of a two-class priority...
We investigate the use of priority mechanisms when assigning service engineers to customers as a too...
The queue M/G/1 with a round-robin type queueing discipline is considered. The overall processing ti...
Since worst case response times must be determined repeatedly during the interactive design of real-...
This paper compares the performance of three classes of scheduling algorithms for real-time systems ...
This paper focuses on the hierarchical scheduling of systems where a number of separate applications...
Hokstad recently published an approximate method for calculating the behaviour of an M/G/m queue. Th...
This paper presents a new schedulability analysis methodology for distributed hard real-time systems...
We consider the mean delay optimization in the M/G/1 queue for service time distributions that have ...
We consider a bene t model for on-line preemptive scheduling. In this model jobs arrive at the on-...
Abstract—In this paper, the author extends the traditional exact schedulability analysis for fixed p...
We investigate the use of priority mechanisms when assigning service engineers to customers as a too...
This paper describes a stochastic analysis framework for general priority-driven periodic real-time ...