254 search results - page 43 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
ATAL
2005
Springer
14 years 29 days ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
JSSPP
2005
Springer
14 years 27 days ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
STACS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
CLUSTER
2002
IEEE
14 years 11 days ago
2002
IEEE
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...