187 search results - page 20 / 38 » Approximation Algorithms for Multiprocessor Scheduling under... |
BMCBI
2010
13 years 7 months ago
2010
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priori...
SAGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
EUC
2007
Springer
14 years 1 months ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...