Results 1 - 10 of 51,217

A Dynamic Priority Assignment Technique for Streams with (m,k)-Firm Deadlines

by Moncef Hamdaoui, Parameswaran Ramanathan - IEEE Transactions on Computers , 1994
"... The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper first introduces the notion of (m; k)-firm deadlines to better characterize the timing constraints of real-time 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
The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper first introduces the notion of (m; k)-firm deadlines to better characterize the timing constraints of real-time streams. More specifically, a stream is said to have (m; k)-firm deadlines

Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines

by In Fixed Priority, Robert Davis, Alan Burns - Information Processing Letters , 1995
"... An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to ..."
Abstract - Add to MetaCart
An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according

Heuristic Scheduling for Multimedia Streams with Firm Deadlines

by Jinsung Cho, Heonshik Shin - In Procs. of the 4th International Workshop on Real-Time Computing Systems and Applications , 1997
"... Multimediastreams such as audio and video require realtime manipulation. Unlike hard real-time tasks, however, they have firm deadlines since the loss of a few frames does not lead to a significant degradation in quality. In this paper, we propose a simple but efficient scheduling scheme for multime ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Multimediastreams such as audio and video require realtime manipulation. Unlike hard real-time tasks, however, they have firm deadlines since the loss of a few frames does not lead to a significant degradation in quality. In this paper, we propose a simple but efficient scheduling scheme

Heuristic Scheduling for Multimedia Streams with Firm Deadlines

by unknown authors
"... Multimediastreams such as audio and video require realtime manipulation. Unlike hard real-time tasks, however, they have firm deadlines since the loss of a few frames does not lead to a significantdegradation in quality. In this paper, we propose a simple but efficient scheduling scheme for multimed ..."
Abstract - Add to MetaCart
Multimediastreams such as audio and video require realtime manipulation. Unlike hard real-time tasks, however, they have firm deadlines since the loss of a few frames does not lead to a significantdegradation in quality. In this paper, we propose a simple but efficient scheduling scheme

A Service Policy for Real-Time Customers with (m, k)-Firm Deadlines

by Moncef Hamdaoui, Parameswaran Ramanathan - 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 real-time 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 real-time streams. More specifically, a stream is said to have (m; k)-firm deadlines

Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines

by Moncef Hamdaoui, Parameswaran Ramanathan, Immeuble Jugurtha , 1997
"... A real-time stream is said to have (m; k)-firm deadlines if at least m out of any k consecutive customers from the stream must meet their respective deadlines. Such a stream is said to have encountered a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines. Hamdaou ..."
Abstract - Cited by 18 (0 self) - Add to MetaCart
A real-time stream is said to have (m; k)-firm deadlines if at least m out of any k consecutive customers from the stream must meet their respective deadlines. Such a stream is said to have encountered a dynamic failure if fewer than m out of any k consecutive customers meet their deadlines

A Generalized Guarantee Model for Servicing Sporadic Tasks with Firm Deadlines

by Parameswaran Ramanathan , Daniel Kang , 1994
"... A new guarantee model for accepting dynamically arriving sporadic tasks is presented in this paper. In this model, sporadic tasks have two costs associated with them. The costs represent the overheads a system will incur if the task is rejected and/or misses its deadline. The basic idea of the propo ..."
Abstract - Add to MetaCart
A new guarantee model for accepting dynamically arriving sporadic tasks is presented in this paper. In this model, sporadic tasks have two costs associated with them. The costs represent the overheads a system will incur if the task is rejected and/or misses its deadline. The basic idea

Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-emptive Systems

by Robert Davis, Alan Burns - Information Processing Letters
"... An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according to some ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
An optimal priority assignment policy is presented for independent aperiodic tasks with arbitrary ready times and firm deadlines, scheduled on a uniprocessor along with a set of hard periodic/sporadic tasks. The latter tasks are assumed to have been assigned unique fixed priorities according

Scheduling Multiple Streams with (m, k)-firm Deadlines having Different Importance over Markovian Channels

by Andreas Willig
"... There are several (not only industrial) applications which can tolerate some losses. A concise way to distinguish between allowed and forbidden loss patterns are (m, k)-firm deadlines, which state that at most m out of k consecutive packets may get lost. An obstacle to the fulfillment of even the re ..."
Abstract - Add to MetaCart
There are several (not only industrial) applications which can tolerate some losses. A concise way to distinguish between allowed and forbidden loss patterns are (m, k)-firm deadlines, which state that at most m out of k consecutive packets may get lost. An obstacle to the fulfillment of even

S.: “A clone-pair approach for the determination of the itinerary of imprecise mobile agents with firm deadlines

by Luciana Rech, Carlos Montez, Rômulo De Oliveira - Proc. 11th IEEE International Conference on Emerging Technologies and Factory Automation , 2006
"... Abstract- In some applications, as part of a mobile agent mission, there may be the necessity of meeting a firm end-to-end deadline, although with some itinerary flexibility due to optional resources. In this paper it is considered an execution model where agents do not previously know their itinera ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract- In some applications, as part of a mobile agent mission, there may be the necessity of meeting a firm end-to-end deadline, although with some itinerary flexibility due to optional resources. In this paper it is considered an execution model where agents do not previously know
Results 1 - 10 of 51,217