1243 search results - page 44 / 249 » EDZL Scheduling Analysis |
RTSS
1995
IEEE
14 years 2 months ago
1995
IEEE
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to...
ESA
2008
Springer
14 years 23 days ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
IPCO
1998
14 years 10 days ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
IAJIT
2010
13 years 9 months ago
2010
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
RTSS
2002
IEEE
14 years 3 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...