67 search results - page 2 / 14 » Fixed-priority preemptive multiprocessor scheduling: to part... |
RTSS
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
RTAS
2011
IEEE
12 years 8 months ago
2011
IEEE
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
RTSS
1999
IEEE
13 years 9 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...
CORR
2010
Springer
12 years 12 months ago
2010
Springer
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
ICPPW
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...