Sciweavers

1600 search results - page 135 / 320
» Clustering for opportunistic communication
Sort
View
IPPS
1999
IEEE
15 years 10 months ago
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan
CF
2005
ACM
15 years 8 months ago
Balancing clustering-induced stalls to improve performance in clustered processors
Clustered processors lose performance as a result of clusteringinduced stalls. Such stalls are the result of distributed resources and cluster communication delays. Our performanc...
Amirali Baniasadi
MASCOTS
2007
15 years 7 months ago
A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
— We propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connec...
Deniz Cokuslu, Kayhan Erciyes
HPCA
1998
IEEE
15 years 10 months ago
Challenging Applications on Fast Networks
Parallel computing on clusters of workstations is attractive because of the low costs in comparison to MPPs, but the speed of the local area network limits the class of applicatio...
Koen Langendoen, Rutger F. H. Hofman, Henri E. Bal
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
15 years 6 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen