Skip to Main content Skip to Navigation
Conference papers

On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers

Abstract : We investigate the problem of partitioning finite difference meshes in two dimensions among the processors of a parallel computer. The objective is to achieve a perfect load balance while minimizing the communication cost. There are well-known graph, hypergraph, and geometry-based partitioning algorithms for this problem. The known geometric algorithms have linear running time and obtain the best results for very special mesh sizes and processor numbers. We propose another geometric algorithm. The proposed algorithm is linear; is ap-plicable to much more cases than some well-known alternatives; obtains better results than the graph partitioning algorithms; ob-tains better results than the hypergraph partitioning algorithms almost always. Our algorithm also obtains better results than a known asymptotically-optimal algorithm for some small number of processors. We also catalog related theoretical results.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01111292
Contributor : Equipe Roma <>
Submitted on : Friday, January 30, 2015 - 9:39:04 AM
Last modification on : Wednesday, November 20, 2019 - 3:18:42 AM
Long-term archiving on: : Saturday, September 12, 2015 - 6:25:46 AM

File

anaelpdp.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Anael Grandjean, Bora Uçar. On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers. 22nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2014), Feb 2014, Turin, Italy. pp.9 - 16, ⟨10.1109/PDP.2014.10⟩. ⟨hal-01111292⟩

Share

Metrics

Record views

389

Files downloads

545