155 search results - page 17 / 31 » On Schedulability Bounds of Static Priority Schedulers |
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
RTSS
1996
IEEE
15 years 1 months ago
1996
IEEE
The well-known periodic task model of Liu and Layland 1] assumes a worst-case execution time bound for every task and may be too pessimistic if the worst-case execution time of a ...
75
Voted
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
ETT
2002
14 years 9 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
CODES
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we present an approach to performance estimation for hard real-time systems. We consider architectures consisting of multiple processors. The scheduling policy is ba...