TestForceMoments.cpp

//*************************************************************************
// Lattice Boltzmann Simulator for Single Phase Flow in Porous Media
// James E. McCLure
//*************************************************************************
#include <stdio.h>
#include <iostream>
#include <fstream>
#include "common/ScaLBL.h"
#include "common/MPI.h"

using namespace std;

extern void PrintNeighborList(int * neighborList, int Np, int rank) {
	if (rank == 0) {
		int neighbor;

		for (int i = 0; i < Np; i++) {
			printf("idx=%d: ",i);
			for (int l = 0; l < 10; l++) {   // was 18
				neighbor = neighborList[l*Np + i];
				printf("%d ",neighbor);
			}
			printf("\n");
		}
		printf("\n\n");
	}
}


std::shared_ptr<Database> loadInputs( int nprocs )
{
    auto db = std::make_shared<Database>( "Domain.in" );

    db->putScalar<int>( "BC", 0 );
    if ( nprocs == 1 ){
        db->putVector<int>( "nproc", { 1, 1, 1 } );
        db->putVector<int>( "n", { 3, 3, 3 } );
        db->putScalar<int>( "nspheres", 0 );
        db->putVector<double>( "L", { 1, 1, 1 } );
    }
    return db;
}


//***************************************************************************************
int main(int argc, char **argv)
{
	// Initialize MPI
    Utilities::startup( argc, argv );
	Utilities::MPI comm( MPI_COMM_WORLD );
    int rank = comm.getRank();
    int nprocs = comm.getSize();
	int check=0;
	{
		// parallel domain size (# of sub-domains)
		int iproc,jproc,kproc;

		if (rank == 0){
			printf("********************************************************\n");
			printf("Running Unit Test: TestForceMoments	\n");
			printf("********************************************************\n");
		}

		// BGK Model parameters
		double tau,Fx,Fy,Fz;
		// Domain variables
		int i,j,k,n;
		int dim = 3; if (rank == 0) printf("dim=%d\n",dim);
		int timestep = 0;
		int timesteps = 2;

		tau =1.0;
		double rlx_setA=1.0/tau;
		double rlx_setB = 8.f*(2.f-rlx_setA)/(8.f-rlx_setA);
		Fx = Fy = 1.0;
		Fz = 1.0;

        // Load inputs
		string FILENAME = argv[1];
        // Load inputs
		if (rank==0)	printf("Loading input database \n");
        auto db = std::make_shared<Database>( FILENAME );
        auto domain_db = db->getDatabase( "Domain" );
        int Nx = domain_db->getVector<int>( "n" )[0];
        int Ny = domain_db->getVector<int>( "n" )[1];
        int Nz = domain_db->getVector<int>( "n" )[2];
        int nprocx = domain_db->getVector<int>( "nproc" )[0];
        int nprocy = domain_db->getVector<int>( "nproc" )[1];
        int nprocz = domain_db->getVector<int>( "nproc" )[2];
		if (rank==0){
			printf("********************************************************\n");
			printf("Sub-domain size = %i x %i x %i\n",Nx,Ny,Nz);
			printf("********************************************************\n");
		}

		comm.barrier();
		kproc = rank/(nprocx*nprocy);
		jproc = (rank-nprocx*nprocy*kproc)/nprocx;
		iproc = rank-nprocx*nprocy*kproc-nprocz*jproc;

		if (rank == 0) {
			printf("i,j,k proc=%d %d %d \n",iproc,jproc,kproc);
		}
		comm.barrier();
		if (rank == 1){
			printf("i,j,k proc=%d %d %d \n",iproc,jproc,kproc);
			printf("\n\n");
		}

		std::shared_ptr<Domain> Dm(new Domain(domain_db,comm));

		Nx += 2;
		Ny += 2;
		Nz += 2;
		int N = Nx*Ny*Nz;

		//.......................................................................
		// Assign the phase ID field
		//.......................................................................
		char LocalRankString[8];
		sprintf(LocalRankString,"%05d",rank);
		char LocalRankFilename[40];
		sprintf(LocalRankFilename,"ID.%05i",rank);
		/*
		FILE *IDFILE = fopen(LocalRankFilename,"rb");
		if (IDFILE==NULL) ERROR("Error opening file: ID.xxxxx");
		fread(Dm->id,1,N,IDFILE);
		fclose(IDFILE);
		 */

		// initialize empty domain
		for (k=0;k<Nz;k++){
			for (j=0;j<Ny;j++){
				for (i=0;i<Nx;i++){
					n = k*Nx*Ny+j*Nx+i;
					Dm->id[n]=1;
				}
			}
		}
		Dm->CommInit();
		comm.barrier();
		if (rank == 0) cout << "Domain set." << endl;

		int Np=0;  // number of local pore nodes
		for (k=1;k<Nz-1;k++){
			for (j=1;j<Ny-1;j++){
				for (i=1;i<Nx-1;i++){
					n = k*Nx*Ny+j*Nx+i;
					if (Dm->id[n] > 0){
						Np++;
					}
				}
			}
		}

		if (rank==0)	printf ("Create ScaLBL_Communicator \n");
		auto ScaLBL_Comm  = std::shared_ptr<ScaLBL_Communicator>(new ScaLBL_Communicator(Dm));

		//...........device phase ID.................................................
		if (rank==0)	printf ("Copying phase ID to device \n");
		char *ID;
		ScaLBL_AllocateDeviceMemory((void **) &ID, N);						// Allocate device memory
		// Copy to the device
		ScaLBL_CopyToDevice(ID, Dm->id.data(), N);
		//...........................................................................

		if (rank==0){
			printf("Total domain size = %i \n",N);
			printf("Reduced domain size = %i \n",Np);
		}


		// LBM variables
		if (rank==0)	printf ("Allocating distributions \n");

		int neighborSize=18*Np*sizeof(int);
		int *neighborList;
		IntArray Map(Nx,Ny,Nz);

		neighborList= new int[18*Np];
		ScaLBL_Comm->MemoryOptimizedLayoutAA(Map,neighborList,Dm->id.data(),Np,1);

	        if (rank == 0) PrintNeighborList(neighborList,Np, rank);

		comm.barrier();

		//......................device distributions.................................
		int dist_mem_size = Np*sizeof(double);

		int *NeighborList;
		//		double *f_even,*f_odd;
		double * dist;
		double * Velocity;
		//...........................................................................
		ScaLBL_AllocateDeviceMemory((void **) &dist, 19*dist_mem_size);
		ScaLBL_AllocateDeviceMemory((void **) &NeighborList, neighborSize);
		ScaLBL_AllocateDeviceMemory((void **) &Velocity, 3*sizeof(double)*Np);
		ScaLBL_CopyToDevice(NeighborList,     neighborList, neighborSize);
		//...........................................................................

		/*
		 *  AA Algorithm begins here
		 *
		 */
		ScaLBL_D3Q19_Init(dist, Np);

		//.......create and start timer............
		double starttime,stoptime,cputime;

		ScaLBL_DeviceBarrier(); comm.barrier();
		starttime = Utilities::MPI::time();

		/************ MAIN ITERATION LOOP (timing communications)***************************************/
		//ScaLBL_Comm->SendD3Q19(dist, &dist[10*Np]);
		//ScaLBL_Comm->RecvD3Q19(dist, &dist[10*Np]);
		ScaLBL_DeviceBarrier(); comm.barrier();

		if (rank==0) printf("Beginning AA timesteps...\n");
		if (rank==0) printf("********************************************************\n");
		if (rank==0) printf("No. of timesteps for timing: %i \n", timesteps);

		while (timestep < 2) {

			ScaLBL_Comm->SendD3Q19AA(dist); //READ FROM NORMAL
			ScaLBL_D3Q19_AAodd_MRT(NeighborList, dist,  ScaLBL_Comm->first_interior, ScaLBL_Comm->last_interior, Np, rlx_setA, rlx_setB, Fx, Fy, Fz);
			ScaLBL_Comm->RecvD3Q19AA(dist); //WRITE INTO OPPOSITE
			ScaLBL_D3Q19_AAodd_MRT(NeighborList, dist, 0, ScaLBL_Comm->next, Np, rlx_setA, rlx_setB, Fx, Fy, Fz);
			ScaLBL_DeviceBarrier(); comm.barrier();
			timestep++;

			ScaLBL_Comm->SendD3Q19AA(dist); //READ FORM NORMAL
			ScaLBL_D3Q19_AAeven_MRT(dist, ScaLBL_Comm->first_interior, ScaLBL_Comm->last_interior, Np, rlx_setA, rlx_setB, Fx, Fy, Fz);
			ScaLBL_Comm->RecvD3Q19AA(dist); //WRITE INTO OPPOSITE
			ScaLBL_D3Q19_AAeven_MRT(dist, 0, ScaLBL_Comm->next, Np, rlx_setA, rlx_setB, Fx, Fy, Fz);
			ScaLBL_DeviceBarrier(); comm.barrier();
			timestep++;
			//************************************************************************/
			
			timestep++;

		}


		//************************************************************************/
		stoptime = Utilities::MPI::time();
		//	cout << "CPU time: " << (stoptime - starttime) << " seconds" << endl;
		cputime = stoptime - starttime;
		//	cout << "Lattice update rate: "<< double(Nx*Ny*Nz*timestep)/cputime/1000000 <<  " MLUPS" << endl;
		double MLUPS = double(Np*timestep)/cputime/1000000;
		if (rank==0) printf("********************************************************\n");
		if (rank==0) printf("CPU time = %f \n", cputime);
		if (rank==0) printf("Lattice update rate (per process)= %f MLUPS \n", MLUPS);
		MLUPS *= nprocs;
		if (rank==0) printf("Lattice update rate (process)= %f MLUPS \n", MLUPS);
		if (rank==0) printf("********************************************************\n");
		
		int SIZE=Np*sizeof(double);
		double *DIST;
		DIST= new double [19*Np];
		ScaLBL_CopyToHost(&DIST[0],&dist[0],19*SIZE);
		
		i=Nx/2;
		printf("x = constant \n");
		for (int q=0; q<9; q++){
			int a = 2*q+1;
			int b = 2*(q+1);
			printf("************* \n");
			printf("print slice for distribution pair %i,%i \n",a,b);
			for (k=1;k<Nz-1;k++){
				for (j=1;j<Ny-1;j++){
					n = k*Nx*Ny+j*Nx+i;
					//printf("%i ",Dm->id[n]);
					n = Map(i,j,k);
					double fa = DIST[(2*q+1)*Np+n];
					double fb = DIST[2*(q+1)*Np+n];
					printf("%f,%f  ",fa,fb);
				}
				printf("\n");
			}
			printf("************* \n");
		}

		printf("y = constant \n");
		j=Ny/2;
		for (int q=0; q<9; q++){
			int a = 2*q+1;
			int b = 2*(q+1);
			printf("************* \n");
			printf("print slice for distribution pair %i,%i \n",a,b);
			for (k=1;k<Nz-1;k++){
				for (i=1;i<Nx-1;i++){
					n = k*Nx*Ny+j*Nx+i;
					//printf("%i ",Dm->id[n]);
					n = Map(i,j,k);
					double fa = DIST[(2*q+1)*Np+n];
					double fb = DIST[2*(q+1)*Np+n];
					printf("%f,%f  ",fa,fb);
				}
				printf("\n");
			}
			printf("************* \n");
		}
		k=Nz/2;
		printf("z = constant \n");
		for (int q=0; q<9; q++){
			int a = 2*q+1;
			int b = 2*(q+1);
			printf("************* \n");
			printf("print slice for distribution pair %i,%i \n",a,b);
			for (j=1;j<Ny-1;j++){
				for (i=1;i<Nx-1;i++){
					n = k*Nx*Ny+j*Nx+i;
					//printf("%i ",Dm->id[n]);
					n = Map(i,j,k);
					double fa = DIST[(2*q+1)*Np+n];
					double fb = DIST[2*(q+1)*Np+n];
					printf("%f,%f  ",fa,fb);
				}
				printf("\n");
			}
			printf("************* \n");
		}



	}
    Utilities::shutdown();

	return check;
}