252 search results - page 17 / 51 » Task Assignment and Scheduling under Memory Constraints |
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
CP
2005
Springer
14 years 28 days ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
RTSS
2005
IEEE
14 years 29 days ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
DAGSTUHL
2008
13 years 8 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...