1758 search results - page 45 / 352 » Schedule processes, not VCPUs |
202
click to vote
DATE
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
162
click to vote
IPL
2006
15 years 6 months ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
176
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
150
click to vote
AIPS
2000
15 years 8 months ago
2000
The majority of planning and scheduling research has focused on batch-oriented models of planning. This paper discusses the use of iterative repair techniques to support a continu...
141
click to vote
COR
2008
15 years 6 months ago
2008
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...