Sciweavers

196 search results - page 18 / 40
» SMP PCs: A Case Study on Cluster Computing
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Performance Evaluation of two Parallel Programming Paradigms Applied to the Symplectic Integrator Running on COTS PC Cluster
There are two popular parallel programming paradigms available to high performance computing users such as engineering and physics professionals: message passing and distributed s...
Lorena B. C. Passos, Gerson H. Pfitscher, Tarcisio...
ICDCS
2006
IEEE
14 years 1 months ago
PRINS: Optimizing Performance of Reliable Internet Storages
Distributed storage systems employ replicas or erasure code to ensure high reliability and availability of data. Such replicas create great amount of network traffic that negative...
Qing Yang, Weijun Xiao, Jin Ren
DIS
2006
Springer
13 years 11 months ago
Clustering Pairwise Distances with Missing Data: Maximum Cuts Versus Normalized Cuts
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
Jan Poland, Thomas Zeugmann
WG
2007
Springer
14 years 1 months ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
ACSC
2005
IEEE
14 years 1 months ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai