Sciweavers

1600 search results - page 156 / 320
» Clustering for opportunistic communication
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
Task Pool Teams for Implementing Irregular Algorithms on Clusters of SMPs
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
Judith Hippold, Gudula Rünger
EUROPAR
2003
Springer
15 years 11 months ago
A Parallel Algorithm for Incremental Compact Clustering
In this paper we propose a new parallel clustering algorithm based on the incremental construction of the compact sets of a collection of objects. This parallel algorithm is portab...
Reynaldo Gil-García, José Manuel Bad...
CLUSTER
2002
IEEE
15 years 11 months ago
Compiling Tiled Iteration Spaces for Clusters
This paper presents a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. It considers general parallelepiped tiling transformatio...
Georgios I. Goumas, Nikolaos Drosinos, Maria Athan...
IPPS
2002
IEEE
15 years 11 months ago
Distribution Sweeping on Clustered Machines with Hierarchical Memories
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
INCDM
2010
Springer
251views Data Mining» more  INCDM 2010»
15 years 10 months ago
Multi-Agent Based Clustering: Towards Generic Multi-Agent Data Mining
Abstract. A framework for Multi Agent Data Mining (MADM) is described. The framework comprises a collection of agents cooperating to address given data mining tasks. The fundamenta...
Santhana Chaimontree, Katie Atkinson, Frans Coenen