1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkDistributedDataFilter.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*----------------------------------------------------------------------------
Copyright (c) Sandia Corporation
See Copyright.txt or http://www.paraview.org/HTML/Copyright.html for details.
----------------------------------------------------------------------------*/
/**
* @class vtkDistributedDataFilter
* @brief Distribute data among processors
*
*
* This filter redistributes data among processors in a parallel
* application into spatially contiguous vtkUnstructuredGrids.
* The execution model anticipated is that all processes read in
* part of a large vtkDataSet. Each process sets the input of
* filter to be that DataSet. When executed, this filter builds
* in parallel a k-d tree, decomposing the space occupied by the
* distributed DataSet into spatial regions. It assigns each
* spatial region to a processor. The data is then redistributed
* and the output is a single vtkUnstructuredGrid containing the
* cells in the process' assigned regions.
*
* This filter is sometimes called "D3" for "distributed data decomposition".
*
* Enhancement: You can set the k-d tree decomposition, rather than
* have D3 compute it. This allows you to divide a dataset using
* the decomposition computed for another dataset. Obtain a description
* of the k-d tree cuts this way:
*
* vtkBSPCuts *cuts = D3Object1->GetCuts()
*
* And set it this way:
*
* D3Object2->SetCuts(cuts)
*
* It is desirable to have a field array of global node IDs
* for two reasons:
*
* 1. When merging together sub grids that were distributed
* across processors, global node IDs can be used to remove
* duplicate points and significantly reduce the size of the
* resulting output grid. If no such array is available,
* D3 will use a tolerance to merge points, which is much
* slower.
*
* 2. If ghost cells have been requested, D3 requires a
* global node ID array in order to request and transfer
* ghost cells in parallel among the processors. If there
* is no global node ID array, D3 will in parallel create
* a global node ID array, and the time to do this can be
* significant.
*
* If you know the name of a global node ID array in the input
* dataset, set that name with this method. If you leave
* it unset, D3 will search the input data set for certain
* common names of global node ID arrays. If none is found,
* and ghost cells have been requested, D3 will create a
* temporary global node ID array before acquiring ghost cells.
* It is also desirable to have global element IDs. However,
* if they don't exist D3 can create them relatively quickly.
* Set the name of the global element ID array if you have it.
* If it is not set, D3 will search for it using common names.
* If still not found, D3 will create a temporary array of
* global element IDs.
*
* @warning
* The Execute() method must be called by all processes in the
* parallel application, or it will hang. If you are not certain
* that your pipeline will execute identically on all processors,
* you may want to use this filter in an explicit execution mode.
*
* @sa
* vtkKdTree vtkPKdTree vtkBSPCuts
*/
#ifndef vtkDistributedDataFilter_h
#define vtkDistributedDataFilter_h
#include "vtkFiltersParallelMPIModule.h" // For export macro
#include "vtkDataObjectAlgorithm.h"
class vtkBSPCuts;
class vtkDataArray;
class vtkDistributedDataFilterSTLCloak;
class vtkFloatArray;
class vtkIdList;
class vtkIdTypeArray;
class vtkIntArray;
class vtkMultiProcessController;
class vtkPKdTree;
class vtkUnstructuredGrid;
class VTKFILTERSPARALLELMPI_EXPORT vtkDistributedDataFilter: public vtkDataObjectAlgorithm
{
vtkTypeMacro(vtkDistributedDataFilter,
vtkDataObjectAlgorithm);
public:
void PrintSelf(ostream& os, vtkIndent indent);
static vtkDistributedDataFilter *New();
//@{
/**
* Set/Get the communicator object
*/
void SetController(vtkMultiProcessController *c);
vtkGetObjectMacro(Controller, vtkMultiProcessController);
//@}
/**
* Get a pointer to the parallel k-d tree object. Required for changing
* default behavior for region assignment, changing default depth of tree,
* or other tree building default parameters. See vtkPKdTree and
* vtkKdTree for more information about these options.
* NOTE: Changing the tree returned by this method does NOT change
* the d3 filter. Make sure to call Modified() on the d3 object if
* you want it to re-execute.
*/
vtkPKdTree *GetKdtree();
/**
* When this filter executes, it creates a vtkPKdTree (K-d tree)
* data structure in parallel which divides the total distributed
* data set into spatial regions. The K-d tree object also creates
* tables describing which processes have data for which
* regions. Only then does this filter redistribute
* the data according to the region assignment scheme. By default,
* the K-d tree structure and it's associated tables are deleted
* after the filter executes. If you anticipate changing only the
* region assignment scheme (input is unchanged) and explicitly
* re-executing, then RetainKdTreeOn, and the K-d tree structure and
* tables will be saved. Then, when you re-execute, this filter will
* skip the k-d tree build phase and go straight to redistributing
* the data according to region assignment. See vtkPKdTree for
* more information about region assignment.
*/
vtkBooleanMacro(RetainKdtree, int);
vtkGetMacro(RetainKdtree, int);
vtkSetMacro(RetainKdtree, int);
/**
* Each cell in the data set is associated with one of the
* spatial regions of the k-d tree decomposition. In particular,
* the cell belongs to the region that it's centroid lies in.
* When the new vtkUnstructuredGrid is created, by default it
* is composed of the cells associated with the region(s)
* assigned to this process. If you also want it to contain
* cells that intersect these regions, but have their centroid
* elsewhere, then set this variable on. By default it is off.
*/
vtkBooleanMacro(IncludeAllIntersectingCells, int);
vtkGetMacro(IncludeAllIntersectingCells, int);
vtkSetMacro(IncludeAllIntersectingCells, int);
/**
* Set this variable if you want the cells of the output
* vtkUnstructuredGrid to be clipped to the spatial region
* boundaries. By default this is off.
*/
vtkBooleanMacro(ClipCells, int);
vtkGetMacro(ClipCells, int);
vtkSetMacro(ClipCells, int);
enum BoundaryModes {
ASSIGN_TO_ONE_REGION=0,
ASSIGN_TO_ALL_INTERSECTING_REGIONS=1,
SPLIT_BOUNDARY_CELLS=2
};
//@{
/**
* Handling of ClipCells and IncludeAllIntersectingCells.
*/
void SetBoundaryMode(int mode);
void SetBoundaryModeToAssignToOneRegion()
{ this->SetBoundaryMode(vtkDistributedDataFilter::ASSIGN_TO_ONE_REGION); }
void SetBoundaryModeToAssignToAllIntersectingRegions()
{ this->SetBoundaryMode(
vtkDistributedDataFilter::ASSIGN_TO_ALL_INTERSECTING_REGIONS);
}
void SetBoundaryModeToSplitBoundaryCells()
{ this->SetBoundaryMode(vtkDistributedDataFilter::SPLIT_BOUNDARY_CELLS); }
int GetBoundaryMode();
//@}
/**
* Ensure previous filters don't send up ghost cells
*/
virtual int RequestUpdateExtent(vtkInformation *, vtkInformationVector **, vtkInformationVector *);
/**
* This class does a great deal of all-to-all communication
* when exchanging portions of data sets and building new sub
* grids.
* By default it will do fast communication. It can instead
* use communication routines that use the least possible
* amount of memory, but these are slower. Set this option
* ON to choose these latter routines.
*/
vtkBooleanMacro(UseMinimalMemory, int);
vtkGetMacro(UseMinimalMemory, int);
vtkSetMacro(UseMinimalMemory, int);
/**
* Turn on collection of timing data
*/
vtkBooleanMacro(Timing, int);
vtkSetMacro(Timing, int);
vtkGetMacro(Timing, int);
/**
* You can set the k-d tree decomposition, rather than
* have D3 compute it. This allows you to divide a dataset using
* the decomposition computed for another dataset. Obtain a description
* of the k-d tree cuts this way:
* vtkBSPCuts *cuts = D3Object1->GetCuts()
* And set it this way:
* D3Object2->SetCuts(cuts)
*/
vtkBSPCuts* GetCuts() {return this->UserCuts;}
void SetCuts(vtkBSPCuts* cuts);
/**
* vtkBSPCuts doesn't have information about process assignments for the cuts.
* Typically D3 filter simply reassigns the processes for each cut. However,
* that may not always work, sometimes the processes have be pre-assigned and
* we want to preserve that partitioning. In that case, one sets the region
* assignments explicitly. Look at vtkPKdTree::AssignRegions for details about
* the arguments. Calling SetUserRegionAssignments(NULL, 0) will revert to
* default behavior i.e. letting the KdTree come up with the assignments.
*/
void SetUserRegionAssignments(const int *map, int numRegions);
protected:
vtkDistributedDataFilter();
~vtkDistributedDataFilter();
/**
* Another way to set ClipCells and IncludeAllIntersectingCells.
* AssignBoundaryCellsToOneRegion turns off both ClipCells and
* IncludeAllIntersectingCells. Each cell will be included in
* exactly one process' output unstructured grid.
*/
void AssignBoundaryCellsToOneRegionOn();
void AssignBoundaryCellsToOneRegionOff();
void SetAssignBoundaryCellsToOneRegion(int val);
/**
* Another way to set ClipCells and IncludeAllIntersectingCells.
* AssignBoundaryCellsToAllIntersectingRegions turns off ClipCells
* turns on IncludeAllIntersectingCells. A cell will be included
* in the output unstructured grid built for every region that it
* intersects. If a cell intersects two process' spatial regions,
* both processes will have that cell in their output grid.
*/
void AssignBoundaryCellsToAllIntersectingRegionsOn();
void AssignBoundaryCellsToAllIntersectingRegionsOff();
void SetAssignBoundaryCellsToAllIntersectingRegions(int val);
/**
* Another way to set ClipCells and IncludeAllIntersectingCells.
* DivideBoundaryCells turns on both ClipCells and
* IncludeAllIntersectingCells. A cell that straddles a processor
* boundary will be split along the boundary, with each process
* getting the portion of the cell that lies in it's spatial region.
*/
void DivideBoundaryCellsOn();
void DivideBoundaryCellsOff();
void SetDivideBoundaryCells(int val);
/**
* Build a vtkUnstructuredGrid for a spatial region from the
* data distributed across processes. Execute() must be called
* by all processes, or it will hang.
*/
virtual int RequestData(vtkInformation *, vtkInformationVector **,
vtkInformationVector *);
void SingleProcessExecute(vtkDataSet *input, vtkUnstructuredGrid *output);
virtual int RequestInformation(vtkInformation *, vtkInformationVector **,
vtkInformationVector *);
virtual int FillInputPortInformation(int port, vtkInformation *info);
/**
* Overridden to create the correct type of data output. If input is dataset,
* output is vtkUnstructuredGrid. If input is composite dataset, output is
* vtkMultiBlockDataSet.
*/
virtual int RequestDataObject(vtkInformation*,
vtkInformationVector**,
vtkInformationVector*);
/**
* Implementation for request data.
*/
int RequestDataInternal(vtkDataSet* input, vtkUnstructuredGrid* output);
private:
enum{
DeleteNo = 0,
DeleteYes = 1
};
enum{
DuplicateCellsNo = 0,
DuplicateCellsYes = 1
};
enum{
GhostCellsNo = 0,
GhostCellsYes = 1
};
enum{
UnsetGhostLevel = 99
};
/**
* ?
*/
int PartitionDataAndAssignToProcesses(vtkDataSet *set);
/**
* ?
*/
vtkUnstructuredGrid *RedistributeDataSet(vtkDataSet *set, vtkDataSet *input);
/**
* ?
*/
int ClipGridCells(vtkUnstructuredGrid *grid);
/**
* ?
*/
vtkUnstructuredGrid * AcquireGhostCells(vtkUnstructuredGrid *grid);
/**
* ?
*/
void ComputeMyRegionBounds();
/**
* ?
*/
int CheckFieldArrayTypes(vtkDataSet *set);
/**
* If any processes have 0 cell input data sets, then
* spread the input data sets around (quickly) before formal
* redistribution.
*/
vtkDataSet *TestFixTooFewInputFiles(vtkDataSet *input);
/**
* ?
*/
vtkUnstructuredGrid *MPIRedistribute(vtkDataSet *in, vtkDataSet *input);
/**
* ?
*/
vtkIdList **GetCellIdsForProcess(int proc, int *nlists);
/**
* Fills in the Source and Target arrays which contain a schedule to allow
* each processor to talk to every other.
*/
void SetUpPairWiseExchange();
//@{
/**
* ?
*/
void FreeIntArrays(vtkIdTypeArray **ar);
static void FreeIdLists(vtkIdList**lists, int nlists);
static vtkIdType GetIdListSize(vtkIdList**lists, int nlists);
//@}
//@{
/**
* This transfers counts (array sizes) between processes.
*/
vtkIdTypeArray *ExchangeCounts(vtkIdType myCount, int tag);
vtkIdTypeArray *ExchangeCountsLean(vtkIdType myCount, int tag);
vtkIdTypeArray *ExchangeCountsFast(vtkIdType myCount, int tag);
//@}
//@{
/**
* This transfers id valued data arrays between processes.
*/
vtkIdTypeArray **ExchangeIdArrays(vtkIdTypeArray **arIn,
int deleteSendArrays, int tag);
vtkIdTypeArray **ExchangeIdArraysLean(vtkIdTypeArray **arIn,
int deleteSendArrays, int tag);
vtkIdTypeArray **ExchangeIdArraysFast(vtkIdTypeArray **arIn,
int deleteSendArrays, int tag);
//@}
//@{
/**
* This transfers float valued data arrays between processes.
*/
vtkFloatArray **ExchangeFloatArrays(vtkFloatArray **myArray,
int deleteSendArrays, int tag);
vtkFloatArray **ExchangeFloatArraysLean(vtkFloatArray **myArray,
int deleteSendArrays, int tag);
vtkFloatArray **ExchangeFloatArraysFast(vtkFloatArray **myArray,
int deleteSendArrays, int tag);
//@}
//@{
/**
* ?
*/
vtkUnstructuredGrid *ExchangeMergeSubGrids(vtkIdList **cellIds, int deleteCellIds,
vtkDataSet *myGrid, int deleteMyGrid,
int filterOutDuplicateCells, int ghostCellFlag, int tag);
vtkUnstructuredGrid *ExchangeMergeSubGrids(vtkIdList ***cellIds, int *numLists,
int deleteCellIds,
vtkDataSet *myGrid, int deleteMyGrid,
int filterOutDuplicateCells, int ghostCellFlag, int tag);
vtkUnstructuredGrid *ExchangeMergeSubGridsLean(
vtkIdList ***cellIds, int *numLists,
int deleteCellIds,
vtkDataSet *myGrid, int deleteMyGrid,
int filterOutDuplicateCells, int ghostCellFlag, int tag);
vtkUnstructuredGrid *ExchangeMergeSubGridsFast(
vtkIdList ***cellIds, int *numLists,
int deleteCellIds,
vtkDataSet *myGrid, int deleteMyGrid,
int filterOutDuplicateCells, int ghostCellFlag, int tag);
//@}
//@{
/**
* ?
*/
char *MarshallDataSet(vtkUnstructuredGrid *extractedGrid, int &size);
vtkUnstructuredGrid *UnMarshallDataSet(char *buf, int size);
//@}
//@{
/**
* ?
*/
void ClipCellsToSpatialRegion(vtkUnstructuredGrid *grid);
#if 0
void ClipWithVtkClipDataSet(vtkUnstructuredGrid *grid, double *bounds,
vtkUnstructuredGrid **outside, vtkUnstructuredGrid **inside);
#endif
//@}
void ClipWithBoxClipDataSet(vtkUnstructuredGrid *grid, double *bounds,
vtkUnstructuredGrid **outside, vtkUnstructuredGrid **inside);
//@{
/**
* Accessors to the "GLOBALID" point and cell arrays of the dataset.
* Global ids are used by D3 to uniquely name all points and cells
* so that after shuffling data between processors, redundant information
* can be quickly eliminated.
*/
vtkIdTypeArray *GetGlobalNodeIdArray(vtkDataSet *set);
vtkIdType *GetGlobalNodeIds(vtkDataSet *set);
vtkIdTypeArray *GetGlobalElementIdArray(vtkDataSet *set);
vtkIdType *GetGlobalElementIds(vtkDataSet *set);
int AssignGlobalNodeIds(vtkUnstructuredGrid *grid);
int AssignGlobalElementIds(vtkDataSet *in);
vtkIdTypeArray **FindGlobalPointIds(vtkFloatArray **ptarray,
vtkIdTypeArray *ids, vtkUnstructuredGrid *grid, vtkIdType &numUniqueMissingPoints);
//@}
/**
* ?
*/
vtkIdTypeArray **MakeProcessLists(vtkIdTypeArray **pointIds,
vtkDistributedDataFilterSTLCloak *procs);
/**
* ?
*/
vtkIdList **BuildRequestedGrids( vtkIdTypeArray **globalPtIds,
vtkUnstructuredGrid *grid,
vtkDistributedDataFilterSTLCloak *ptIdMap);
//@{
/**
* ?
*/
int InMySpatialRegion(float x, float y, float z);
int InMySpatialRegion(double x, double y, double z);
int StrictlyInsideMyBounds(float x, float y, float z);
int StrictlyInsideMyBounds(double x, double y, double z);
//@}
//@{
/**
* ?
*/
vtkIdTypeArray **GetGhostPointIds(int ghostLevel, vtkUnstructuredGrid *grid,
int AddCellsIAlreadyHave);
vtkUnstructuredGrid *AddGhostCellsUniqueCellAssignment(
vtkUnstructuredGrid *myGrid,
vtkDistributedDataFilterSTLCloak *globalToLocalMap);
vtkUnstructuredGrid *AddGhostCellsDuplicateCellAssignment(
vtkUnstructuredGrid *myGrid,
vtkDistributedDataFilterSTLCloak *globalToLocalMap);
vtkUnstructuredGrid *SetMergeGhostGrid(
vtkUnstructuredGrid *ghostCellGrid,
vtkUnstructuredGrid *incomingGhostCells,
int ghostLevel, vtkDistributedDataFilterSTLCloak *idMap);
//@}
//@{
/**
* ?
*/
vtkUnstructuredGrid *ExtractCells(vtkIdList *list,
int deleteCellLists, vtkDataSet *in);
vtkUnstructuredGrid *ExtractCells(vtkIdList **lists, int nlists,
int deleteCellLists, vtkDataSet *in);
vtkUnstructuredGrid *ExtractZeroCellGrid(vtkDataSet *in);
//@}
//@{
/**
* ?
*/
static int GlobalPointIdIsUsed(vtkUnstructuredGrid *grid,
int ptId, vtkDistributedDataFilterSTLCloak *globalToLocal);
static int LocalPointIdIsUsed(vtkUnstructuredGrid *grid, int ptId);
static vtkIdType FindId(vtkIdTypeArray *ids, vtkIdType gid, vtkIdType startLoc);
//@}
/**
* ?
*/
static vtkIdTypeArray *AddPointAndCells(vtkIdType gid,
vtkIdType localId,
vtkUnstructuredGrid *grid,
vtkIdType *gidCells,
vtkIdTypeArray *ids);
//@{
/**
* ?
*/
static void AddConstantUnsignedCharPointArray(vtkUnstructuredGrid *grid,
const char *arrayName, unsigned char val);
static void AddConstantUnsignedCharCellArray(vtkUnstructuredGrid *grid,
const char *arrayName, unsigned char val);
//@}
/**
* ?
*/
static void RemoveRemoteCellsFromList(vtkIdList *cellList,
vtkIdType *gidCells,
vtkIdType *remoteCells,
vtkIdType nRemoteCells);
/**
* ?
*/
static vtkUnstructuredGrid *MergeGrids(vtkDataSet **sets, int nsets,
int deleteDataSets,
int useGlobalNodeIds, float pointMergeTolerance,
int useGlobalCellIds);
vtkPKdTree *Kdtree;
vtkMultiProcessController *Controller;
int NumProcesses;
int MyId;
int *Target;
int *Source;
int NumConvexSubRegions;
double *ConvexSubRegionBounds;
int GhostLevel;
int RetainKdtree;
int IncludeAllIntersectingCells;
int ClipCells;
int AssignBoundaryCellsToOneRegion;
int AssignBoundaryCellsToAllIntersectingRegions;
int DivideBoundaryCells;
int Timing;
int NextProgressStep;
double ProgressIncrement;
int UseMinimalMemory;
vtkBSPCuts* UserCuts;
vtkDistributedDataFilter(const vtkDistributedDataFilter&) VTK_DELETE_FUNCTION;
void operator=(const vtkDistributedDataFilter&) VTK_DELETE_FUNCTION;
class vtkInternals;
vtkInternals* Internals;
};
#endif
|