Results 1 
6 of
6
A Dynamic Priority Assignment Technique for Streams with (m,k)Firm Deadlines
 IEEE Transactions on Computers
, 1994
"... The problem of scheduling multiple streams of realtime customers is addressed in this paper. The paper first introduces the notion of (m; k)firm deadlines to better characterize the timing constraints of realtime streams. More specifically, a stream is said to have (m; k)firm deadlines if at lea ..."
Abstract

Cited by 178 (2 self)
 Add to MetaCart
(Show Context)
The problem of scheduling multiple streams of realtime customers is addressed in this paper. The paper first introduces the notion of (m; k)firm deadlines to better characterize the timing constraints of realtime streams. More specifically, a stream is said to have (m; k)firm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m; k)firm deadlines experiences a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines. The paper then proposes a prioritybased policy for scheduling N such streams on a single server to reduce the probability of dynamic failure. The basic idea is to assign higher priorities to customers from streams that are closer to a dynamic failure so as to improve their chances of meeting their deadlines. The paper proposes a heuristic for assigning these priorities. The effectiveness of this approach is evaluated through simulation under various customer arrival and service patterns....
V.Pratt Modeling Concurrency with Partial Orders
 International Journal of Parallel Programming, Vol 15, No
, 1995
"... ..."
The Application Of A Structured Markovian Traffic Source Model To ATM Networks
"... In this paper a structured Markovian model is developed and adapted to allow it to describe common ATM traffic properties and an investigation is carried out into the behaviour of this model under a range of different parameter conditions. 1. INTRODUCTION The production of ATM traffic using Monte C ..."
Abstract
 Add to MetaCart
In this paper a structured Markovian model is developed and adapted to allow it to describe common ATM traffic properties and an investigation is carried out into the behaviour of this model under a range of different parameter conditions. 1. INTRODUCTION The production of ATM traffic using Monte Carlo techniques has proved to be a difficult task due to the nature of the variable bit rate services that such networks are expected to provide (see, e.g,[1]). Markovian models have proved very popular with researchers as they provide a compromise between accuracy and complexity. Examples of the use of a variety of Markov models can be found in [2]  [3]. One difficulty that must be overcome when modelling ATM traffic is how to define it within a model. The probability distribution function (PDF) of VBR traffic is not normally known a priori and is probably not definable in a closed form. There are however some features of the traffic that are often known in advance. This paper presents a s...
A Service Policy for RealTime Customers with (m, k)Firm Deadlines
 Proceedings of Fault Tolerant Computing Systems
, 1994
"... The problem of scheduling multiple streams of realtime customers is addressed in this paper. The paper first introduces the notion of (m; k)firm deadlines to better characterize the timing constraints of realtime streams. More specifically, a stream is said to have (m; k)firm deadlines if at leas ..."
Abstract
 Add to MetaCart
The problem of scheduling multiple streams of realtime customers is addressed in this paper. The paper first introduces the notion of (m; k)firm deadlines to better characterize the timing constraints of realtime streams. More specifically, a stream is said to have (m; k)firm deadlines if at least m out of any k consecutive customers must meet their deadlines. Note that, the notion of (m; k)firm deadlines is a generalization of firm and soft deadlines. In particular, m = k = 1 characterizes a stream with firm deadlines. A large value for k with (k \Gamma m)=k equal to the maximum allowable loss rate can be used to represent a stream with soft deadlines. A stream with (m; k)firm deadlines will experience a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines. The paper proposes a policy for scheduling N such streams on a single server to reduce the probability of dynamic failure. The basic idea of the proposed policy is to assign higher prioritie...
Deferring RealTime Traffic for Improved ime Communication in FDDI Networks
, 1995
"... The fiber distributed data interface VDDQ is suitable for realtime communication because of the high speed and the performance guarantees it provides. However, these guarantees are achieved at the expense of nonrealtime traffic because the realtime messages are given higher priority over nonre ..."
Abstract
 Add to MetaCart
The fiber distributed data interface VDDQ is suitable for realtime communication because of the high speed and the performance guarantees it provides. However, these guarantees are achieved at the expense of nonrealtime traffic because the realtime messages are given higher priority over nonredtime messages, resulting in excessive delays for nonrealtime messages. In this paper, we propose a scheme for reducing the response time of nonrealtime messages while still providing the same guarantees to realtime messages. In particular, the proposed approach gives higher priority to realtime messages only when it is absolutely necessary in order for them to meet their deadlines. Nonrealtime messages are thus transmitted ahead of realtime messages whenever possible. We present an algorithm for determining when and by how much the transmission of a realtime message can be deferred without jeopardizing its deadline. The proposed approach is evaluated through simulation. The simulation results show that a substantial reduction in the mean response time of nonrealtime messages is achieved when using the proposed approach.