1534 search results - page 5 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
EGC
2005
Springer
14 years 1 months ago
2005
Springer
SAINT
2005
IEEE
14 years 1 months ago
2005
IEEE
Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, the...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
CLUSTER
2008
IEEE
14 years 2 months ago
2008
IEEE
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
RTAS
2010
IEEE
13 years 6 months ago
2010
IEEE
Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...