316 search results - page 48 / 64 » Period and Deadline Selection for Schedulability in Real-Tim... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
In the last years, a progressive migration from single processor chips to multi-core computing devices has taken place in the general-purpose and embedded system market. The devel...
ECRTS
1999
IEEE
13 years 11 months ago
1999
IEEE
The purpose of this paper is to investigate the issues related to task attribute assignment on an individual processor. The majority of papers on fixed priority scheduling make th...
TACAS
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
After having drawn up a state of the art on the theoretical feasibility of a system of periodic tasks scheduled by a preemptive algorithm at fixed priorities, we show in this art...