RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and a...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarant...
RTSS
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we present a framework integrating speci cation and scheduler generation for real-time systems. In a rst step, the system, which can include arbitrarily designed tas...
RSP
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper analyzes the performance of two different real-time operating systems. Therefore, we used a real benchmark embedded system design with fast external reaction times of a...
RSP
1999
IEEE
13 years 11 months ago
1999
IEEE