Sciweavers

1292 search results - page 27 / 259
» Revisiting the optimal scheduling problem
Sort
View
ECRTS
2003
IEEE
14 years 1 months ago
Using Supertasks to Improve Processor Utilization in Multiprocessor Real-Time Systems
We revisit the problem of supertasking in Pfair-scheduled multiprocessor systems. In this approach, a set of tasks, called component tasks, is assigned to a server task, called a ...
Philip Holman, James H. Anderson
PLDI
2004
ACM
14 years 1 months ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 8 months ago
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the exist...
Raphael Rom, Moshe Sidi, Hwee Pink Tan
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
Intransitivity revisited coevolutionary dynamics of numbers games
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
Pablo Funes, Enrique Pujals
CIKM
2009
Springer
14 years 1 months ago
Answering XML queries using materialized views revisited
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang