Sciweavers

120 search results - page 7 / 24
» Minimum-cost load-balancing partitions
Sort
View
CLUSTER
2011
IEEE
13 years 9 months ago
Dynamic Load Balance for Optimized Message Logging in Fault Tolerant HPC Applications
—Computing systems will grow significantly larger in the near future to satisfy the needs of computational scientists in areas like climate modeling, biophysics and cosmology. S...
Esteban Meneses, Laxmikant V. Kalé, Greg Br...
ISHPC
2000
Springer
15 years 1 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
CORR
2007
Springer
119views Education» more  CORR 2007»
14 years 9 months ago
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jun...
CLUSTER
2001
IEEE
15 years 1 months ago
Adaptive Runtime Partitioning of AMR Applications on Heterogeneous Clusters
This paper presents the design and evaluation of an adaptive, system sensitive partitioning and load balancing framework for distributed structured adaptive mesh refinement applic...
Shweta Sinha, Manish Parashar
CCGRID
2003
IEEE
15 years 3 months ago
Leveraging Non-Uniform Resources for Parallel Query Processing
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that customers can adapt the cluster configuration to the changing technologies and t...
Tobias Mayr, Philippe Bonnet, Johannes Gehrke, Pra...