A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
A parallel hashed Oct-Tree N-body algorithm
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Parallel adaptive hp-refinement techniques for conservation laws
Applied Numerical Mathematics - Special issue on adaptive mesh refinement methods for CFD applications
Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
Multilevel diffusion schemes for repartitioning of adaptive meshes
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
A parallel infrastructure for scalable adaptive finite element methods and its application to least squares C-infinity collocation
Parallel transient dynamics simulations
Journal of Parallel and Distributed Computing - Special issue on irregular problems in supercomputing applications
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Future Generation Computer Systems - Special issue on metacomputing
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
Design and implementation of move-based heuristics for VLSI hypergraph partitioning
Journal of Experimental Algorithmics (JEA)
Exploiting flexibly assignable work to improve load balance
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Zoltan Data Management Service for Parallel Dynamic Applications
Computing in Science and Engineering
Efficient Partitioning of Sequences
IEEE Transactions on Computers
The Design of a Parallel Adaptive Multi-level Code in Fortran 90
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
Graph Partitioning and Parallel Solvers: Has the Emperor No Clother? (Extended Abstract)
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Using Space-Filling Curves for Multi-dimensional Indexing
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
DRAMA: A Library for Parallel Dynamic Load Balancing of Finite Element Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Combinatorial algorithms in scientific computing
Combinatorial algorithms in scientific computing
Hypergraph Models and Algorithms for Data-Pattern-Based Clustering
Data Mining and Knowledge Discovery
Multi-Constraint Mesh Partitioning for Contact/Impact Computations
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Alternative Algorithm for Hilbert's Space-Filling Curve
IEEE Transactions on Computers
Tinkertoy parallel programming: a case study with Zoltan
International Journal of Computational Science and Engineering
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Dynamic load balancing for adaptive parallel flow problems
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Unbalanced tree search on a manycore system using the GPI programming model
Computer Science - Research and Development
Load balancing for sustainable ICT
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Executing association rule mining algorithms under a Grid computing environment
Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Periodic hierarchical load balancing for large supercomputers
International Journal of High Performance Computing Applications
p4est: Scalable Algorithms for Parallel Adaptive Mesh Refinement on Forests of Octrees
SIAM Journal on Scientific Computing
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
What MPI could (and cannot) do for mesh-partitioning on non-homogeneous networks
EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
Hierarchical partitioning and dynamic load balancing for scientific computation
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Object-oriented, parallel finite element framework with dynamic load balancing
Advances in Engineering Software
Quantifying the effectiveness of load balance algorithms
Proceedings of the 26th ACM international conference on Supercomputing
Heuristic static load-balancing algorithm applied to the fragment molecular orbital method
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
International Journal of High Performance Computing Applications
Hi-index | 0.00 |
Data partitioning and load balancing are important components of parallel computations. Many different partitioning strategies have been developed, with great effectiveness in parallel applications. But the load-balancing problem is not yet solved completely; new applications and architectures require new partitioning features. Existing algorithms must be enhanced to support more complex applications. New models are needed for non-square, non-symmetric, and highly connected systems arising from applications in biology, circuits, and materials simulations. Increased use of heterogeneous computing architectures requires partitioners that account for non-uniform computing, network, and memory resources. And, for greatest impact, these new capabilities must be delivered in toolkits that are robust, easy-to-use, and applicable to a wide range of applications. In this paper, we discuss our approaches to addressing these issues within the Zoltan Parallel Data Services toolkit.