controller_main.cc 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. #include <NTL/ZZ.h>
  2. #include <iostream>
  3. #include <string.h>
  4. #include <stdlib.h>
  5. #include "controller.h"
  6. NTL_CLIENT
  7. // The total number of nodes (that is, dpnodes)
  8. static unsigned short total_nodes = 0;
  9. // The amount of memory we can use per dpnode
  10. static unsigned short GB_mem_per_node = 0;
  11. void desired_resources(const ZZ &order, unsigned short &desired_dpnodes,
  12. unsigned int &max_workers, unsigned int &dpfreq)
  13. {
  14. // One point in how many is a DP by default?
  15. unsigned int dpscale = 1000;
  16. ZZ sorder = SqrRoot(order);
  17. // How many DPnodes should we use for a problem of this size?
  18. desired_dpnodes = 1;
  19. // 338 is bytes per DP in the table. 10 is a safety factor.
  20. ZZ dpnumerator = sorder * 338 * 10;
  21. ZZ dpdenominator;
  22. dpdenominator = dpscale;
  23. dpdenominator *= GB_mem_per_node;
  24. dpdenominator *= 1000000000UL; // Convert the above line to GB
  25. ZZ dpnodes = (dpnumerator / dpdenominator) + 1;
  26. if (dpnodes > total_nodes) {
  27. desired_dpnodes = total_nodes;
  28. } else {
  29. desired_dpnodes = trunc_long(dpnodes, 31);
  30. }
  31. // How many workers would we like to use?
  32. ZZ sorder23 = sorder >> 23;
  33. if (NumBits(sorder23) > 30) {
  34. // Just use all the workers we can find
  35. max_workers = 4294967295U; // 2^32 - 1
  36. } else {
  37. max_workers = trunc_long(sorder23,31) + 1;
  38. }
  39. // By default, 1 in dpscale points are distinguished points.
  40. dpfreq = 4294967295U / dpscale;
  41. // Orders smaller than 100*scale^2 behave specially, in order to
  42. // avoid DP-free cycles
  43. ZZ orderlimit;
  44. orderlimit = 100;
  45. orderlimit *= dpscale;
  46. orderlimit *= dpscale;
  47. if (order < 1000) {
  48. // Just make every point a DP
  49. dpfreq = 4294967295U;
  50. } else if (order < orderlimit) {
  51. // The frequency of DPs should be 10/sqrt(order) to avoid
  52. // a DP-free cycle, so dpfreq = (10*2^32)/sqrt(order)
  53. ZZ f = (to_ZZ(10) << 32) / SqrRoot(order);
  54. dpfreq = trunc_long(f, 31);
  55. }
  56. }
  57. static void boundcb(const char *boundaddr, unsigned short boundport)
  58. {
  59. cout << "Listening on " << boundaddr << ":" << boundport << "\n";
  60. const char *fdenv = getenv("CONTROLLER_BOUNDCB_FD");
  61. if (fdenv) {
  62. int fd = atoi(fdenv);
  63. if (fd > 2) {
  64. write(fd, &boundport, 2);
  65. write(fd, boundaddr, strlen(boundaddr));
  66. close(fd);
  67. }
  68. }
  69. }
  70. #ifdef TEST_DESIRED_RESOURCES
  71. int main(int argc, char **argv)
  72. {
  73. if (argc != 3) {
  74. std::cerr << "Usage: " << argv[0] << " num_nodes GB_mem_per_node\n";
  75. return 1;
  76. }
  77. total_nodes = strtoul(argv[1], NULL, 10);
  78. GB_mem_per_node = strtoul(argv[2], NULL, 10);
  79. cout << "# log_2(order) dpnodes workers dpfreq\n";
  80. for (int i=44; i<=90; ++i) {
  81. unsigned short desired_dpnodes;
  82. unsigned int max_workers;
  83. unsigned int dpfreq;
  84. ZZ order;
  85. order = 1;
  86. order <<= i;
  87. order += 1;
  88. desired_resources(order, desired_dpnodes, max_workers, dpfreq);
  89. cout << i << " " << desired_dpnodes << " " << max_workers << " "
  90. << dpfreq << "\n";
  91. }
  92. }
  93. #else
  94. int main(int argc, char **argv)
  95. {
  96. unsigned short bindport = 0;
  97. Worklist worklist;
  98. if (controller_parse_args(argc, argv, bindport, worklist,
  99. total_nodes, GB_mem_per_node)) {
  100. std::cerr << "Usage: " << argv[0] << " [-p listenport] [-n num_nodes] [-m GB_mem_per_node] [-r reps] N1 iter1 N2 iter2 ...\n";
  101. return 1;
  102. }
  103. return controller_main(worklist, bindport, boundcb);
  104. }
  105. #endif