optimal PxQ jagged algorithm from "Ali Pinar and Cevdet Aykanat, Sparse Matrix Decomposition with Optimal Load Balancing, HiPC 1997" . It selects the main dimension to get the best possible load balance. More...
#include <twod/jag_pq_opt_interval.hpp>
optimal PxQ jagged algorithm from "Ali Pinar and Cevdet Aykanat, Sparse Matrix Decomposition with Optimal Load Balancing, HiPC 1997" . It selects the main dimension to get the best possible load balance.
This class is implemented as a wrapper to twod::JagPQOptIntervalHor and twod::jag_pq_opt_nicol_ver.
| T | type of the data in the prefix sum array | |
| Pr | type of the prefixsum array |
Public Member Functions | |
| virtual T | part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts) |
| Applies a 2d partitioning algorithm to a given 2d prefixSumArray . | |
| virtual | ~JagPQOptIntervalBest () |
| twod::JagPQOptIntervalBest< T, Pr >::~JagPQOptIntervalBest | ( | ) | [virtual] |
| T twod::JagPQOptIntervalBest< T, Pr >::part | ( | int | procCount, | |
| const Pr & | prefixSumArray, | |||
| util::RectList< T, Pr > & | parts | |||
| ) | [virtual] |
Applies a 2d partitioning algorithm to a given 2d prefixSumArray .
| [in] | procCount | is the number of processors |
| [in] | prefixSumArray | first column and first row consists of zero only. But the borders of rectangles in rect_list never touch this area (index 0 in row or column) |
| [out] | parts | must be empty before calling this function. It will contain the partition after the function return |
Implements twod::PartBase< T, Pr >.
1.7.1
