#include <RecBisection.h>
Definition at line 103 of file RecBisection.h.
◆ RecBisection()
RecBisection::RecBisection |
( |
int |
numpartitions, |
|
|
PatchMap * |
thePatchMap |
|
) |
| |
Copyright (c) 1995, 1996, 1997, 1998, 1999, 2000 by The Board of Trustees of the University of Illinois. All rights reserved.
Definition at line 18 of file RecBisection.C.
References NAMD_die(), and PatchMap::numPatches().
20 patchMap = thePatchMap;
21 npartition = numpartitions;
23 partitions =
new Partition[npartition];
24 patchload =
new PatchLoad[numPatches];
27 if ( partitions == NULL ||
30 NAMD_die(
"memory allocation failed in RecBisection::RecBisection");
42 c_icompute1 = 0.000035;
int numPatches(void) const
void NAMD_die(const char *err_msg)
◆ ~RecBisection()
RecBisection::~RecBisection |
( |
| ) |
|
◆ partition()
int RecBisection::partition |
( |
int * |
dest_arr | ) |
|
Definition at line 293 of file RecBisection.C.
References PatchMap::gridsize_a(), PatchMap::gridsize_b(), and PatchMap::gridsize_c().
297 top_partition.origin.x = 0;
298 top_partition.origin.y = 0;
299 top_partition.origin.z = 0;
300 top_partition.corner.x = patchMap->
gridsize_a()-1;
301 top_partition.corner.y = patchMap->
gridsize_b()-1;
302 top_partition.corner.z = patchMap->
gridsize_c()-1;
303 top_partition.load = 0.0;
306 compute_patch_load();
308 for(i=0; i<numPatches; i++) top_partition.load += patchload[i].total;
311 rec_divide(npartition,top_partition);
313 if (currentp != npartition)
319 assign_nodes_arr(dest_arr);
int gridsize_c(void) const
int gridsize_a(void) const
int gridsize_b(void) const
The documentation for this class was generated from the following files: