#include <fstream>#include <ctime>#include <vector>#include "Zoltan2_AlgMultiJagged.hpp"#include "Teuchos_ArrayViewDecl.hpp"#include "Zoltan2_PartitionMapping.hpp"#include "Zoltan2_MachineRepresentation.hpp"#include "Teuchos_ReductionOp.hpp"#include "Zoltan2_XpetraMultiVectorAdapter.hpp"#include "Teuchos_ConfigDefs.hpp"#include "Teuchos_Comm.hpp"#include "Teuchos_DefaultSerialComm.hpp"
Include dependency graph for Zoltan2_TaskMapping.hpp:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| class | Teuchos::Zoltan2_ReduceBestMapping< Ordinal, T > |
| Zoltan2_ReduceBestMapping Class, reduces the minimum cost mapping, ties breaks with minimum proc id. More... | |
| class | Zoltan2::GNO_LNO_PAIR< gno_t, part_t > |
| class | Zoltan2::KmeansHeap< IT, WT > |
| KmeansHeap Class, max heap, but holds the minimum values. More... | |
| class | Zoltan2::KMeansCluster< IT, WT > |
| KMeansCluster Class. More... | |
| class | Zoltan2::KMeansAlgorithm< IT, WT > |
| KMeansAlgorithm Class that performs clustering of the coordinates, and returns the closest set of coordinates. Useful to filter the processors, when there are more processors than needed. More... | |
| class | Zoltan2::CommunicationModel< part_t, pcoord_t > |
| CommunicationModel Base Class that performs mapping between the coordinate partitioning result. More... | |
| class | Zoltan2::CoordinateCommunicationModel< pcoord_t, tcoord_t, part_t > |
| CoordinateModelInput Class that performs mapping between the coordinate partitioning result and mpi ranks base on the coordinate results and mpi physical coordinates. More... | |
| class | Zoltan2::CoordinateTaskMapper< Adapter, part_t > |
Namespaces | |
| namespace | Teuchos |
| namespace | Zoltan2 |
Defines | |
| #define | MINOF(a, b) (((a)<(b))?(a):(b)) |
Functions | |
| template<typename it > | |
| it | Zoltan2::z2Fact (it x) |
| template<typename IT > | |
| void | Zoltan2::ithPermutation (const IT n, IT i, IT *perm) |
| template<typename part_t > | |
| void | Zoltan2::getGridCommunicationGraph (part_t taskCount, part_t *&task_comm_xadj, part_t *&task_comm_adj, vector< int > grid_dims) |
| template<typename Adapter , typename scalar_t , typename part_t > | |
| void | Zoltan2::getSolutionCenterCoordinates (const Environment *envConst, const Teuchos::Comm< int > *comm, const Zoltan2::CoordinateModel< typename Adapter::base_adapter_t > *coords, const Zoltan2::PartitioningSolution< Adapter > *soln_, int coordDim, part_t ntasks, scalar_t **partCenters) |
| template<typename T > | |
| void | Zoltan2::fillContinousArray (T *arr, size_t arrSize, T *val) |
| fillContinousArray function | |
| template<typename part_t , typename pcoord_t , typename tcoord_t > | |
| void | Zoltan2::coordinateTaskMapperInterface (RCP< const Teuchos::Comm< int > > problemComm, int proc_dim, int num_processors, pcoord_t **machine_coords, int task_dim, part_t num_tasks, tcoord_t **task_coords, part_t *task_comm_xadj, part_t *task_comm_adj, pcoord_t *task_communication_edge_weight_, part_t *proc_to_task_xadj, part_t *proc_to_task_adj, int recursion_depth, part_t *part_no_array, part_t *machine_dimensions) |
| Constructor The interface function that calls CoordinateTaskMapper which will also perform the mapping operation. The result mapping can be obtained by. | |
Define Documentation
| #define MINOF | ( | a, | |
| b | |||
| ) | (((a)<(b))?(a):(b)) |
Definition at line 559 of file Zoltan2_TaskMapping.hpp.
