RecBisection Class Reference

#include <RecBisection.h>

Public Member Functions
	RecBisection (int, PatchMap *)
	~RecBisection ()
int	partition (int *)

Detailed Description

Definition at line 103 of file RecBisection.h.

Constructor & Destructor Documentation

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().

{
    patchMap    = thePatchMap;
    npartition  = numpartitions;
    numPatches  = patchMap->numPatches();
    partitions  = new Partition[npartition];
    patchload   = new PatchLoad[numPatches];
    currentp    = 0;

    if ( partitions == NULL ||
         patchload == NULL )
    {
      NAMD_die("memory allocation failed in RecBisection::RecBisection");
    }


    // the cost coeffiencients that is used to compute the load introduced
    // to the processor by a patch

    c_local0    = 1;
    c_local1    = 0.015;
    c_edge0     = 0.001;
    c_edge1     = 0.001;
    c_icompute0 = 0.001;
    c_icompute1 = 0.000035;

    //c_local0    = 1.0;
    //c_local1    = 0.;
    //c_edge0     = 0.;
    //c_edge1     = 0.;
    //c_icompute0 = 0.;
    //c_icompute1 = 0.;
}

~RecBisection()

RecBisection::~RecBisection

(

)

Definition at line 56 of file RecBisection.C.

{
    delete [] partitions; 
    delete [] patchload;
}

Member Function Documentation

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().

{
    int i;
  
    top_partition.origin.x = 0; 
    top_partition.origin.y = 0; 
    top_partition.origin.z = 0; 
    top_partition.corner.x  = patchMap->gridsize_a()-1;
    top_partition.corner.y  = patchMap->gridsize_b()-1;
    top_partition.corner.z  = patchMap->gridsize_c()-1;
    top_partition.load      = 0.0;

    // calculate estimated computational load due to each patch
    compute_patch_load();

    for(i=0; i<numPatches; i++) top_partition.load += patchload[i].total;

    // divide into rectangular prisms with load as equal as possible
    rec_divide(npartition,top_partition);

    if (currentp != npartition) 
          return 0;
    else  {
      if (dest_arr==NULL)
          assignNodes();
      else
          assign_nodes_arr(dest_arr);
    }

    return 1;
}

---

The documentation for this class was generated from the following files:

• RecBisection.h
• RecBisection.C