Sciweavers

Share
6 search results - page 1 / 2
» Maximizing Contention-Free Executions in Multiprocessor Sche...
Sort
View
RTAS
2011
IEEE
11 years 4 months ago
Maximizing Contention-Free Executions in Multiprocessor Scheduling
—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...
Jinkyu Lee, Arvind Easwaran, Insik Shin
RTCSA
2005
IEEE
12 years 7 months ago
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
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...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
EUC
2006
Springer
12 years 5 months ago
On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances
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...
Hyeonjoong Cho, Haisang Wu, Binoy Ravindran, E. Do...
SOSP
1989
ACM
12 years 2 months ago
Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors
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 ...
Andrew Tucker, Anoop Gupta
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
12 years 5 months ago
Bid based scheduler with backfilling for a multiprocessor system
We consider a virtual computing environment that provides computational resources on demand to users with multiattribute task descriptions that include a valuation, resource (CPU)...
Inbal Yahav, Louiqa Raschid, Henrique Andrade
books