1095 search results - page 56 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
149
Voted
JCM
2007
15 years 4 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
179
click to vote
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
110
click to vote
MICRO
1999
IEEE
15 years 8 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
161
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introd...
130
click to vote
GCC
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...