Sciweavers

2183 search results - page 111 / 437
» Generating Parallel Algorithms for Cluster and Grid Computin...
Sort
View
ICDM
2010
IEEE
216views Data Mining» more  ICDM 2010»
14 years 7 months ago
K-AP: Generating Specified K Clusters by Efficient Affinity Propagation
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
Xiangliang Zhang, Wei Wang, Kjetil Nørv&ari...
CCGRID
2003
IEEE
15 years 3 months ago
Evaluation of the inter-cluster data transfer on Grid environment
High-performance peer-to-peer transfer between clusters will be fundamental technology base for various Grid middleware, such as large-scale data transfer in DataGrid settings, or...
Shoji Ogura, Satoshi Matsuoka, Hidemoto Nakada
ICS
2010
Tsinghua U.
15 years 8 days ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
GRID
2006
Springer
14 years 9 months ago
A QoS-Aware Heuristic Algorithm for Replica Placement
This paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ign...
Hsiangkai Wang, Pangfeng Liu, Jan-Jan Wu
PDP
2006
IEEE
15 years 3 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller