1064 search results - page 48 / 213 » Parallel Spectral Clustering in Distributed Systems |
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
CLUSTER
2006
IEEE
13 years 11 months ago
2006
IEEE
Efficient data movement is an important part of any highperformance I/O system, but it is especially critical for the current and next-generation of massively parallel processing ...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
ICPADS
1998
IEEE
13 years 12 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
CLUSTER
2007
IEEE
14 years 2 months ago
2007
IEEE
— A schedule is said robust if it is able to absorb some degree of uncertainty in tasks duration while maintaining a stable solution. This intuitive notion of robustness has led ...