9 search results - page 1 / 2 » Application-Bypass Reduction for Large-Scale Clusters |
CLUSTER
2003
IEEE
13 years 10 months ago
2003
IEEE
Process skew is an important factor in the performance of parallel applications, especially in large-scale clusters. Reduction is a common collective operation which, by its natur...
PAMI
1998
13 years 4 months ago
1998
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
HPCA
2001
IEEE
14 years 5 months ago
2001
IEEE
The memory overhead introduced by directories constitutes a major hurdle in the scalability of cc-NUMA architectures, which makes the shared-memory paradigm unfeasible for very la...
JCB
2007
13 years 4 months ago
2007
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...