7 search results - page 1 / 2 » Task Partitioning upon Memory-Constrained Multiprocessors |
RTCSA
2005
IEEE
14 years 2 months ago
2005
IEEE
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
CORR
2010
Springer
13 years 4 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, ...
RTAS
2006
IEEE
14 years 3 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
ECRTS
2005
IEEE
14 years 2 months ago
2005
IEEE
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
29
Voted
RTCSA
2005
IEEE
14 years 2 months ago
2005
IEEE
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...