2355 search results - page 39 / 471 » Scheduling in the Z-Polyhedral Model |
FLAIRS
2008
14 years 7 days ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper, we start from an assigned control law with known probability distributions of its execution time. Our goal is to identify an optimised scheduling policy that allows ...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
RTSS
2002
IEEE
14 years 2 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...
JCM
2007
13 years 9 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...