Load-balancing spatially located computations using rectangular partitions
DOI10.1016/j.jpdc.2012.05.013zbMath1248.68101arXiv1104.2566OpenAlexW1982869108MaRDI QIDQ455987
Erik Saule, Ümit V. Çatalyürek, Erdeniz Ö. Baş
Publication date: 23 October 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.2566
heuristicsdynamic programmingload balancingoptimal algorithmsparticle-in-cellspatial partitioninghierarchical partitioningjagged partitioningmesh-based computationrectilinear partitioning
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- One-dimensional partitioning for heterogeneous systems: theory and practice
- Mapping a chain task to chained processors
- Graph partitioning models for parallel computing
- Fast optimal load balancing algorithms for 1D partitioning
- Image-space decomposition algorithms for sort-first parallel volume rendering of unstructured grids
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
- Efficient partitioning of sequences
- Approximation algorithms for array partitioning problems
- A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
- A New Approximation Algorithm for Multidimensional Rectangle Tiling
- Approximations for the general block distribution of a matrix
- Distributed processing of very large datasets with DataCutter
This page was built for publication: Load-balancing spatially located computations using rectangular partitions