Sciweavers

Share
7 search results - page 1 / 2
» Task Partitioning upon Memory-Constrained Multiprocessors
Sort
View
RTCSA
2005
IEEE
12 years 7 days ago
Task Partitioning upon Memory-Constrained Multiprocessors
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...
Nathan Fisher, James H. Anderson, Sanjoy K. Baruah
CORR
2010
Springer
217views Education» more  CORR 2010»
11 years 1 months ago
Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms
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, ...
François Dorin, Patrick Meumeu Yomsi, Jo&eu...
RTAS
2006
IEEE
12 years 20 days ago
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
Sathish Gopalakrishnan, Marco Caccamo
ECRTS
2005
IEEE
12 years 8 days ago
Task Assignment on Uniform Heterogeneous Multiprocessors
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...
Shelby Funk, Sanjoy K. Baruah
RTCSA
2005
IEEE
12 years 7 days ago
Real-Time Scheduling of Sporadic Task Systems When the Number of Distinct Task Types Is Small
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...
Sanjoy K. Baruah, Nathan Fisher
books