88 search results - page 12 / 18 » Task Reweighting under Global Scheduling on Multiprocessors |
171
click to vote
RTSS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemp...
139
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
146
click to vote
ACMICEC
2007
ACM
15 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)...
131
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
117
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical impl...