8 search results - page 1 / 2 » rtss 1997 |
RTSS
1997
IEEE
13 years 8 months ago
1997
IEEE
RTSS
1997
IEEE
13 years 8 months ago
1997
IEEE
Several new wait-free object-sharing schemes for realtime uniprocessors and multiprocessors are presented. These schemes have characteristics in common with the priority inheritan...
RTSS
1997
IEEE
13 years 8 months ago
1997
IEEE
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For exampl...
RTSS
1997
IEEE
13 years 8 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
RTSS
1997
IEEE
13 years 8 months ago
1997
IEEE
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...