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_GeneralState_par_Prepare.cc 3.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
  1. /**********************************************************
  2. This software is part of J.-S. Caux's ABACUS library.
  3. Copyright (c) J.-S. Caux.
  4. -----------------------------------------------------------
  5. File: LiebLin_DSF_GeneralState_par_Prepare.cc
  6. Purpose: Parallel version of ABACUS using MPICH.
  7. ***********************************************************/
  8. #include "ABACUS.h"
  9. //#include "mpi.h" // not needed for Prepare
  10. using namespace std;
  11. using namespace ABACUS;
  12. int main(int argc, char *argv[])
  13. {
  14. char whichDSF;
  15. DP c_int, L, kBT;
  16. int N, iKmin, iKmax, paralevel, nr_processors_at_newlevel;
  17. DP target_sumrule = 1.0e+6; // effectively deactivated here
  18. bool refine = true; // always true for parallel mode
  19. char* Ix2filenameprefix;
  20. if (argc < 10) { // provide some info
  21. cout << endl << "Welcome to ABACUS\t(copyright J.-S. Caux)." << endl;
  22. cout << endl << "Usage of LiebLin_DSF_par_Prepare executable: " << endl;
  23. cout << endl << "This function prepares an ABACUS parallel mode run, starting from a preexisting "
  24. "serial run (obtained using the LiebLin_DSF executable) using the same model parameters." << endl;
  25. cout << endl << "Provide the following arguments:" << endl << endl;
  26. cout << "char whichDSF \t\t Which structure factor should be calculated ? Options are: "
  27. "d for rho rho, g for psi psi{dagger}, o for psi{dagger} psi" << endl;
  28. cout << "DP c_int \t\t Value of the interaction parameter: use positive real values only" << endl;
  29. cout << "DP L \t\t\t Length of the system: use positive real values only" << endl;
  30. cout << "int N \t\t\t Number of particles: use positive integer values only" << endl;
  31. cout << "char* defaultScanStatename:\t\t file [].Ix2 contains the quantum numbers defining the "
  32. "AveragingState; used as defaultScanStatename" << 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 paralevel" << endl;
  36. cout << "rank[i], nr_processors[i] \t rank and nr_processors of each earlier paralevels." << endl;
  37. cout << "int nr_processors_at_new_level \t for this new parallelization level." << endl;
  38. return(0);
  39. }
  40. else { // correct nr of arguments
  41. int n = 1;
  42. whichDSF = *argv[n++];
  43. c_int = atof(argv[n++]);
  44. L = atof(argv[n++]);
  45. N = atoi(argv[n++]);
  46. Ix2filenameprefix = argv[n++];
  47. iKmin = atoi(argv[n++]);
  48. iKmax = atoi(argv[n++]);
  49. paralevel = atoi(argv[n++]); // paralevel == 1 means that we have one layer of parallelization, so no previous rank and nr_processors to specify
  50. if (argc != 10 + 2*(paralevel - 1)) ABACUSerror("Wrong nr of arguments in LiebLin_DSF_GeneralState_par_Prepare.");
  51. Vect<int> rank_lower_paralevels(paralevel - 1);
  52. Vect<int> nr_processors_lower_paralevels(paralevel - 1);
  53. for (int i = 0; i < paralevel - 1; ++i) {
  54. rank_lower_paralevels[i] = atoi(argv[n++]);
  55. nr_processors_lower_paralevels[i] = atoi(argv[n++]);
  56. }
  57. nr_processors_at_newlevel = atoi(argv[n++]);
  58. // Read the Ix2 from the file:
  59. Vect<int> Ix2_input(N);
  60. ifstream Ix2_input_file;
  61. stringstream filenamestrstream;
  62. filenamestrstream << Ix2filenameprefix;
  63. string defaultScanStatename = filenamestrstream.str();
  64. // Split up thread list into chunks, one per processor
  65. Prepare_Parallel_Scan_LiebLin (whichDSF, c_int, L, N, iKmin, iKmax, kBT, defaultScanStatename,
  66. paralevel, rank_lower_paralevels, nr_processors_lower_paralevels,
  67. nr_processors_at_newlevel);
  68. }
  69. return(0);
  70. }