109 search results - page 7 / 22 » Convex programming for scheduling unrelated parallel machine... |
91
Voted
IPPS
2008
IEEE
15 years 6 months ago
2008
IEEE
—Scheduling and dispatching are two ways of solving production planning problems. In this work, based on preceding works, it is explained how these two approaches can be combined...
IPCO
1998
15 years 1 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
103
Voted
ICPP
1997
IEEE
15 years 4 months ago
1997
IEEE
r The lack of a versatile software tool for parallel program development has been one of the major obstacles for exploiting the potential of high-performance architectures. In this...
205
click to vote
HPDC
2012
IEEE
13 years 2 months ago
2012
IEEE
Recent advances in virtualization technologies have made it feasible to host multiple virtual machines (VMs) in the same physical host and even the same CPU core, with fair share ...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
VLIW machines possibly provide the most direct way to exploit instruction level parallelism; however, they cannot be used to emulate current general-purpose instruction set archit...