You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

LiebLin_DSF_MosesState_par.cc 4.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135
  1. /**********************************************************
  2. This software is part of J.-S. Caux's ABACUS library.
  3. Copyright (c) J.-S. Caux.
  4. -----------------------------------------------------------
  5. File: LiebLin_DSF_par.cc
  6. Purpose: Parallel version of ABACUS using MPICH.
  7. ***********************************************************/
  8. #include "ABACUS.h"
  9. #include "mpi.h"
  10. using namespace ABACUS;
  11. int main(int argc, char *argv[])
  12. {
  13. char whichDSF;
  14. DP c_int, L;
  15. int N, Nl, DIl, DIr, iKmin, iKmax, Max_Secs, supercycle_time;
  16. DP target_sumrule = 1.0e+6; // effectively deactivated here
  17. bool refine = true; // always true for parallel mode
  18. DP kBT = 0.0; // dummy
  19. if (argc != 12) { // provide some info
  20. cout << endl << "Welcome to ABACUS\t(copyright J.-S. Caux)." << endl;
  21. cout << endl << "Usage of LiebLin_DSF_MosesState_par executable: " << endl;
  22. cout << endl << "This function runs ABACUS in parallel mode, starting from a preexisting "
  23. "serial run (obtained using the LiebLin_DSF executable) using the same model parameters." << endl;
  24. cout << endl << "Provide the following arguments:" << endl << endl;
  25. cout << "char whichDSF \t\t Which structure factor should be calculated ? Options are: "
  26. "d for rho rho, g for psi psi{dagger}, o for psi{dagger} psi" << endl;
  27. cout << "DP c_int \t\t Value of the interaction parameter: use positive real values only" << endl;
  28. cout << "DP L \t\t\t Length of the system: use positive real values only" << endl;
  29. cout << "int N \t\t\t Number of particles: use positive integer values only" << endl;
  30. cout << "int Nl \t\t\t Number of particles in left Fermi sea (Nr is then N - Nl)" << endl;
  31. cout << "int DIl \t\t shift of left sea as compared to its ground state position" << endl;
  32. cout << "int DIr \t\t shift of right sea as compared to its ground state position" << endl;
  33. cout << "int iKmin" << endl << "int iKmax \t\t Min and max momentum integers to scan over: "
  34. "recommended values: -2*N and 2*N" << endl;
  35. cout << "int Max_Secs \t\t Allowed computational time: (in seconds)" << endl;
  36. cout << "int supercycle_time \t\t time for one supercycle (in seconds)" << endl;
  37. cout << endl << "EXAMPLE: " << endl << endl;
  38. cout << "mpiexec -np 8 LiebLin_DSF_MosesState_par d 1.0 100.0 100 50 -30 20 -400 400 3600 600" << endl << endl;
  39. return(0);
  40. }
  41. else { // (argc == 11) correct nr of arguments
  42. whichDSF = *argv[1];
  43. c_int = atof(argv[2]);
  44. L = atof(argv[3]);
  45. N = atoi(argv[4]);
  46. Nl = atoi(argv[5]);
  47. DIl = atoi(argv[6]);
  48. DIr = atoi(argv[7]);
  49. iKmin = atoi(argv[8]);
  50. iKmax = atoi(argv[9]);
  51. Max_Secs = atoi(argv[10]);
  52. supercycle_time = atoi(argv[11]);
  53. }
  54. if (Max_Secs <= supercycle_time) ABACUSerror("Please allow more time in LiebLin_DSF_par.");
  55. MPI::Init(argc, argv);
  56. DP tstart = MPI::Wtime();
  57. int rank = MPI::COMM_WORLD.Get_rank();
  58. int nr_processors = MPI::COMM_WORLD.Get_size();
  59. if (nr_processors < 2) ABACUSerror("Give at least 2 processors to ABACUS parallel !");
  60. refine = true;
  61. // ASSUMPTION: preexisting files (raw, thr, ...) exist for the run.
  62. DP tnow = MPI::Wtime();
  63. // Define the Moses state:
  64. LiebLin_Bethe_State MosesState (c_int, L, N);
  65. // Split the sea:
  66. for (int i = 0; i < Nl; ++i) MosesState.Ix2[i] += 2 * DIl;
  67. for (int i = Nl; i < N; ++i) MosesState.Ix2[i] += 2 * DIr;
  68. MosesState.Compute_All (true);
  69. // Handy default name:
  70. stringstream defaultScanStatename_strstream;
  71. defaultScanStatename_strstream << "Moses_Nl_" << Nl << "_DIl_" << DIl << "_DIr_" << DIr;
  72. string defaultScanStatename = defaultScanStatename_strstream.str();
  73. MPI_Barrier (MPI::COMM_WORLD);
  74. while (tnow - tstart < Max_Secs - supercycle_time - 120) { // space for one more supercycle, + 2 minutes safety
  75. if (rank == 0)
  76. // Split up thread list into chunks, one per processor
  77. Prepare_Parallel_Scan_LiebLin (whichDSF, c_int, L, N, iKmin, iKmax, kBT, defaultScanStatename, nr_processors);
  78. // Barrier synchronization, to make sure other processes wait for process of rank 0
  79. // to have finished splitting up the thr file into pieces before starting:
  80. MPI_Barrier (MPI::COMM_WORLD);
  81. // then everybody gets going on their own chunk !
  82. Scan_LiebLin (whichDSF, MosesState, defaultScanStatename, iKmin, iKmax, supercycle_time,
  83. target_sumrule, refine, rank, nr_processors);
  84. // Another barrier synchronization
  85. MPI_Barrier (MPI::COMM_WORLD);
  86. // Now that everybody is done, digest data into unique files
  87. if (rank == 0)
  88. Wrapup_Parallel_Scan_LiebLin (whichDSF, c_int, L, N, iKmin, iKmax, kBT, defaultScanStatename, nr_processors);
  89. // Another barrier synchronization
  90. MPI_Barrier (MPI::COMM_WORLD);
  91. tnow = MPI::Wtime();
  92. } // while (tnow - tstart...
  93. MPI::Finalize();
  94. return(0);
  95. }