64 search results - page 13 / 13 » Preemptive Scheduling of Equal-Length Jobs in Polynomial Tim... |
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
IPPS
2007
IEEE
14 years 17 days ago
2007
IEEE
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...
CORR
2009
Springer
13 years 4 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
MFCS
2009
Springer
14 years 24 days ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...