Sciweavers

88 search results - page 12 / 18
» Task Reweighting under Global Scheduling on Multiprocessors
Sort
View
112
Voted
RTSS
1999
IEEE
15 years 1 months ago
Exploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
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...
José C. Palencia Gutiérrez, Michael ...
IPPS
2003
IEEE
15 years 2 months ago
The Case for Fair Multiprocessor Scheduling
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...
Anand Srinivasan, Philip Holman, James H. Anderson...
ACMICEC
2007
ACM
201views ECommerce» more  ACMICEC 2007»
15 years 1 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
IPPS
2003
IEEE
15 years 2 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
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...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
IPPS
2005
IEEE
15 years 3 months ago
Desynchronized Pfair Scheduling on Multiprocessors
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...
UmaMaheswari C. Devi, James H. Anderson