500 search results - page 17 / 100 » Process Scheduling for the Parallel Desktop |
145
Voted
JSSPP
2004
Springer
15 years 8 months ago
2004
Springer
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...
142
Voted
COR
2011
14 years 9 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
123
Voted
CLUSTER
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
171
Voted
HIPEAC
2009
Springer
15 years 9 months ago
2009
Springer
Heterogeneous architectures are currently widespread. With the advent of easy-to-program general purpose GPUs, virtually every recent desktop computer is a heterogeneous system. Co...
136
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
1 Multi-paradigm, multi-threaded and multi-core computing devices available today provide several orders of magnitude performance improvement over mainstream microprocessors. These...