Improved parallel data partitioning by nested dissection with applications to information retrieval.
- University of Illinois at Urbana-Champaign, Urbana, IL
The computational work in many information retrieval and analysis algorithms is based on sparse linear algebra. Sparse matrix-vector multiplication is a common kernel in many of these computations. Thus, an important related combinatorial problem in parallel computing is how to distribute the matrix and the vectors among processors so as to minimize the communication cost. We focus on minimizing the total communication volume while keeping the computation balanced across processes. In [1], the first two authors presented a new 2D partitioning method, the nested dissection partitioning algorithm. In this paper, we improve on that algorithm and show that it is a good option for data partitioning in information retrieval. We also show partitioning time can be substantially reduced by using the SCOTCH software, and quality improves in some cases, too.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 970310
- Report Number(s):
- SAND2008-7908J; TRN: US201003%%493
- Journal Information:
- Proposed for publication in Parallel Computing., Journal Name: Proposed for publication in Parallel Computing.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Block data distribution for parallel nested dissection
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks