An ensemble of clustering solutions or partitions may be generated for a number of reasons. If the data set is very large, clustering may be done on tractable size disjoint subsets. The data may be distributed at different sites for which a distributed clustering solution with a final merging of par
A framework for scalable, parallel performance monitoring
โ Scribed by Aroon Nataraj; Allen D. Malony; Alan Morris; Dorian C. Arnold; Barton P. Miller
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 343 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.1544
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The IBM System/390 Parallel Sysplex allows a parallel server to grow from a single system to a configuration of 32 systems, and appear as a single image to the end user and applications. It can provide capacity growth for today's largest commercial workloads by enabling a workload to be spread trans
Long reconstruction times in three-dimensional (3D) positron emission tomography (PET) have long remained an obstacle to its routine clinical use. This article presents an experimental study of various algorithms on a compact parallel platform consisting of five hybrid nodes, each equipped with a Tr
A two-dimensional \((h, p)\) finite element scheme for distributed parallel computation is developed. The approach is based on an element-by-element domain decomposition and is implemented on the nCUBE2 system. Example problems are used to demonstrate performance of the algorithm for a range of \((h
A full-approximation storage multigrid method for solving the steady-state 2-d incompressible Navier-Stokes equations on stag-solved problem. gered grids has been implemented in Fortran on the CM-5,using Parallel computing is advantageous because of the large the array aliasing feature in CM-Fortr