A method of local corrections for computing the velocity field due to a distribution of vortex blobs
Journal of Computational Physics
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Computer simulation using particles
Computer simulation using particles
Local adaptive mesh refinement for shock hydrodynamics
Journal of Computational Physics
Spacefilling curves and the planar travelling salesman problem
Journal of the ACM (JACM)
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Scientific and Statistical Computing
The Stanford Dash Multiprocessor
Computer
Parallel hierarchical N-body methods and their implications for multiprocessors
Parallel hierarchical N-body methods and their implications for multiprocessors
A parallel hashed Oct-Tree N-body algorithm
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
A parallel adaptive fast multipole method
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Parallel physical optimization algorithms for allocating data to multicomputer nodes
The Journal of Supercomputing
Rectilinear partitioning of irregular data parallel computations
Journal of Parallel and Distributed Computing
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
Portable parallel programming of numerical problems under the LPAR system
Journal of Parallel and Distributed Computing
Application-specific protocols for user-level shared memory
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
A Comparison of Load Balancing Strategies for Particle Methods Running on MIMD Multiprocessors
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing
Parallel remapping algorithms for adaptive problems
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
A parallel software infrastructure for dynamic block-irregular scientific calculations
A parallel software infrastructure for dynamic block-irregular scientific calculations
IEEE Transactions on Parallel and Distributed Systems
Nonlinear array layouts for hierarchical memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
Recursive array layouts and fast parallel matrix multiplication
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids
The Journal of Supercomputing
Tuning Strassen's matrix multiplication for memory efficiency
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Topology preserving dynamic load balancing for parallel molecular simulations
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Efficient Parallel Algorithms for Solvent Accessible Surface Area of Proteins
IEEE Transactions on Parallel and Distributed Systems
Scalable Molecular-Dynamics, Visualization, and Data-Management Algorithms for Materials Simulations
Computing in Science and Engineering
Recursive Array Layouts and Fast Matrix Multiplication
IEEE Transactions on Parallel and Distributed Systems
An Application-Centric Characterization of Domain-Based SFC Partitioners for Parallel SAMR
IEEE Transactions on Parallel and Distributed Systems
Parallelization of Irregular Problems Based on Hierarchical Domain Representation
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
PIT: A Library for the Parallelization of Irregular Problems
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Neighbourhood Preserving Load Balancing: A Self-Organizing Approach
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
A Hierarchical Approach to Irregular Problems (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Adaptive Multigrid Methods in MPI
Proceedings of the 7th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Pattern Based Software Re-engineering: A Case Study
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
Fast optimal load balancing algorithms for 1D partitioning
Journal of Parallel and Distributed Computing
Performance of a new CFD flow solver using a hybrid programming paradigm
Journal of Parallel and Distributed Computing
A refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
Journal of Parallel and Distributed Computing
Mapping with Space Filling Surfaces
IEEE Transactions on Parallel and Distributed Systems
Hybrid Runtime Management of Space-Time Heterogeneity for Parallel Structured Adaptive Applications
IEEE Transactions on Parallel and Distributed Systems
One-dimensional partitioning for heterogeneous systems: Theory and practice
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
A parallel solution - adaptive method for three-dimensional turbulent non-premixed combusting flows
Journal of Computational Physics
A new scalable parallel method for molecular dynamics based on cell-block data structure
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
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
Load-balancing spatially located computations using rectangular partitions
Journal of Parallel and Distributed Computing
Hi-index | 0.01 |
We discuss Inverse Spacefilling Partitioning (ISP), a partitioning strategy for non-uniform scientific computations running on distributed memory MIMD parallel computers. We consider the case of a dynamic workload distributed on a uniform mesh, and compare ISP against Orthogonal Recursive Bisection (ORB) and a Median of Medians variant of ORB, ORB-MM. We present two results. First, ISP and ORB-MM are superior to ORB in rendering balanced workloads驴because they are more fine-grained驴and incur communication overheads that are comparable to ORB. Second, ISP is more attractive than ORB-MM from a software engineering standpoint because it avoids elaborate bookkeeping. Whereas ISP partitionings can be described succinctly as logically contiguous segments of the line, ORB-MM's partitionings are inherently unstructured. We describe the general d-dimensional ISP algorithm and report empirical results with two- and three-dimensional, non-hierarchical particle methods.