97 printf(
"[%03d] Lower: %g\t%g\t%g\n", rank, verts[0], verts[1], verts[2]);
98 printf(
"[%03d] Upper: %g\t%g\t%g\n", rank, verts[3], verts[4], verts[5]);
120 MPI_Init(&argc,&argv);
122 const int NumberOfSteps = 50;
124 const int Dimensions = 3;
125 const int LoadbalancerGamma = 0;
127 int MyLocation[3] = {0};
129 MPI_Comm_rank(MPI_COMM_WORLD,&MyLocation[2]);
130 int MyRank = MyLocation[2];
132 int NumberOfProcesses[3] = {1,1,1};
133 MPI_Comm_size(MPI_COMM_WORLD, &NumberOfProcesses[2]);
134 int MaximumRank = NumberOfProcesses[2];
138 printf(
"Ranks: %d\nNumber of Steps: %d\n", MaximumRank, NumberOfSteps);
141 MPI_Barrier(MPI_COMM_WORLD);
146 std::vector<int> MyLocationVector(MyLocation, MyLocation+3);
147 std::vector<int> NumberOfProcessesVector(NumberOfProcesses, NumberOfProcesses+3);
167 const double DomainSize = 1.0;
169 for(
int VertexIndex=0; VertexIndex<2; VertexIndex++)
171 for(
int DimensionIndex=0; DimensionIndex<Dimensions; DimensionIndex++)
173 DomainVertices.at(VertexIndex)[DimensionIndex] = (MyLocation[DimensionIndex]+VertexIndex) * DomainSize;
176 double VertexArray[6];
182 double MyWork = (double) MyRank + 1.;
185 for(CurrentStep=0; CurrentStep<NumberOfSteps; CurrentStep++)
191 printf(
"Starting step: %d/%d\n", CurrentStep+1, NumberOfSteps);
194#ifdef ALL_VTK_OUTPUT_EXAMPLE
199 std::vector<ALL::Point<double>> NewVertices = jall->
getVertices();
207 MPI_Barrier(MPI_COMM_WORLD);
209#ifdef ALL_VTK_OUTPUT_EXAMPLE