6 search results - page 1 / 2 » Maximizing Contention-Free Executions in Multiprocessor Sche... |
RTAS
2011
IEEE
12 years 7 months ago
2011
IEEE
—It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with...
RTCSA
2005
IEEE
13 years 10 months ago
2005
IEEE
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
EUC
2006
Springer
13 years 8 months ago
2006
Springer
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activiti...
SOSP
1989
ACM
13 years 5 months ago
1989
ACM
Shared-memory multiprocessors are frequently used in a timesharing style with multiple parallel applications executing at the same time. In such an environment, where the machine ...
ACMICEC
2007
ACM
13 years 8 months ago
2007
ACM
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...