2 * This file is part of the GROMACS molecular simulation package.
4 * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
5 * Copyright (c) 2001-2008, The GROMACS development team.
6 * Copyright (c) 2013,2014,2015,2016,2017,2018,2019, by the GROMACS development team, led by
7 * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
8 * and including many others, as listed in the AUTHORS file in the
9 * top-level source directory and at http://www.gromacs.org.
11 * GROMACS is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public License
13 * as published by the Free Software Foundation; either version 2.1
14 * of the License, or (at your option) any later version.
16 * GROMACS is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * Lesser General Public License for more details.
21 * You should have received a copy of the GNU Lesser General Public
22 * License along with GROMACS; if not, see
23 * http://www.gnu.org/licenses, or write to the Free Software Foundation,
24 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
26 * If you want to redistribute modifications to GROMACS, please
27 * consider that scientific software is very special. Version
28 * control is crucial - bugs must be traceable. We will be happy to
29 * consider code for inclusion in the official distribution, but
30 * derived work must not be called official GROMACS. Details are found
31 * in the README & COPYING files - if they are missing, get the
32 * official version at http://www.gromacs.org.
34 * To help us fund GROMACS development, we humbly ask that you cite
35 * the research papers on the package. Check out http://www.gromacs.org.
39 #include "wallcycle.h"
48 #include "gromacs/math/functions.h"
49 #include "gromacs/mdtypes/commrec.h"
50 #include "gromacs/timing/cyclecounter.h"
51 #include "gromacs/timing/gpu_timing.h"
52 #include "gromacs/timing/wallcyclereporting.h"
53 #include "gromacs/utility/cstringutil.h"
54 #include "gromacs/utility/gmxassert.h"
55 #include "gromacs/utility/gmxmpi.h"
56 #include "gromacs/utility/logger.h"
57 #include "gromacs/utility/smalloc.h"
58 #include "gromacs/utility/snprintf.h"
60 static const bool useCycleSubcounters = GMX_CYCLE_SUBCOUNTERS;
62 /* DEBUG_WCYCLE adds consistency checking for the counters.
63 * It checks if you stop a counter different from the last
64 * one that was opened and if you do nest too deep.
66 /* #define DEBUG_WCYCLE */
69 #include "gromacs/utility/fatalerror.h"
82 /* did we detect one or more invalid cycle counts */
83 gmx_bool haveInvalidCount;
84 /* variables for testing/debugging */
90 int counterlist[DEPTH_MAX];
94 gmx_cycles_t cycle_prev;
95 int64_t reset_counters;
97 MPI_Comm mpi_comm_mygroup;
102 /* Each name should not exceed 19 printing characters
103 (ie. terminating null can be twentieth) */
104 static const char *wcn[ewcNR] =
106 "Run", "Step", "PP during PME", "Domain decomp.", "DD comm. load",
107 "DD comm. bounds", "Vsite constr.", "Send X to PME", "Neighbor search", "Launch GPU ops.",
108 "Comm. coord.", "Force", "Wait + Comm. F", "PME mesh",
109 "PME redist. X/F", "PME spread", "PME gather", "PME 3D-FFT", "PME 3D-FFT Comm.", "PME solve LJ", "PME solve Elec",
110 "PME wait for PP", "Wait + Recv. PME F",
111 "Wait PME GPU spread", "PME 3D-FFT", "PME solve", /* the strings for FFT/solve are repeated here for mixed mode counters */
112 "Wait PME GPU gather", "Wait Bonded GPU", "Reduce GPU PME F",
113 "Wait GPU NB nonloc.", "Wait GPU NB local", "NB X/F buffer ops.",
114 "Vsite spread", "COM pull force", "AWH",
115 "Write traj.", "Update", "Constraints", "Comm. energies",
116 "Enforced rotation", "Add rot. forces", "Position swapping", "IMD", "Test"
119 static const char *wcsn[ewcsNR] =
121 "DD redist.", "DD NS grid + sort", "DD setup comm.",
122 "DD make top.", "DD make constr.", "DD top. other",
123 "NS grid local", "NS grid non-loc.", "NS search local", "NS search non-loc.",
127 "Listed buffer ops.",
129 "Nonbonded F kernel",
132 "Launch NB GPU tasks",
133 "Launch Bonded GPU tasks",
134 "Launch PME GPU tasks",
135 "Ewald F correction",
138 "Clear force buffer",
142 /* PME GPU timing events' names - correspond to the enum in the gpu_timing.h */
143 static const char *PMEStageNames[] =
147 "PME spline + spread",
154 gmx_bool wallcycle_have_counter()
156 return gmx_cycles_have_counter();
159 gmx_wallcycle_t wallcycle_init(FILE *fplog, int resetstep, t_commrec gmx_unused *cr)
164 if (!wallcycle_have_counter())
171 wc->haveInvalidCount = FALSE;
172 wc->wc_barrier = FALSE;
173 wc->wcc_all = nullptr;
176 wc->reset_counters = resetstep;
179 if (PAR(cr) && getenv("GMX_CYCLE_BARRIER") != nullptr)
183 fprintf(fplog, "\nWill call MPI_Barrier before each cycle start/stop call\n\n");
185 wc->wc_barrier = TRUE;
186 wc->mpi_comm_mygroup = cr->mpi_comm_mygroup;
190 snew(wc->wcc, ewcNR);
191 if (getenv("GMX_CYCLE_ALL") != nullptr)
195 fprintf(fplog, "\nWill time all the code during the run\n\n");
197 snew(wc->wcc_all, ewcNR*ewcNR);
200 if (useCycleSubcounters)
202 snew(wc->wcsc, ewcsNR);
212 void wallcycle_destroy(gmx_wallcycle_t wc)
219 if (wc->wcc != nullptr)
223 if (wc->wcc_all != nullptr)
227 if (wc->wcsc != nullptr)
234 static void wallcycle_all_start(gmx_wallcycle_t wc, int ewc, gmx_cycles_t cycle)
237 wc->cycle_prev = cycle;
240 static void wallcycle_all_stop(gmx_wallcycle_t wc, int ewc, gmx_cycles_t cycle)
242 wc->wcc_all[wc->ewc_prev*ewcNR+ewc].n += 1;
243 wc->wcc_all[wc->ewc_prev*ewcNR+ewc].c += cycle - wc->cycle_prev;
248 static void debug_start_check(gmx_wallcycle_t wc, int ewc)
250 /* fprintf(stderr,"wcycle_start depth %d, %s\n",wc->count_depth,wcn[ewc]); */
252 if (wc->count_depth < 0 || wc->count_depth >= DEPTH_MAX)
254 gmx_fatal(FARGS, "wallcycle counter depth out of range: %d",
257 wc->counterlist[wc->count_depth] = ewc;
261 static void debug_stop_check(gmx_wallcycle_t wc, int ewc)
265 /* fprintf(stderr,"wcycle_stop depth %d, %s\n",wc->count_depth,wcn[ewc]); */
267 if (wc->count_depth < 0)
269 gmx_fatal(FARGS, "wallcycle counter depth out of range when stopping %s: %d", wcn[ewc], wc->count_depth);
271 if (wc->counterlist[wc->count_depth] != ewc)
273 gmx_fatal(FARGS, "wallcycle mismatch at stop, start %s, stop %s",
274 wcn[wc->counterlist[wc->count_depth]], wcn[ewc]);
279 void wallcycle_start(gmx_wallcycle_t wc, int ewc)
291 MPI_Barrier(wc->mpi_comm_mygroup);
296 debug_start_check(wc, ewc);
299 cycle = gmx_cycles_read();
300 wc->wcc[ewc].start = cycle;
301 if (wc->wcc_all != nullptr)
306 wallcycle_all_start(wc, ewc, cycle);
308 else if (wc->wc_depth == 3)
310 wallcycle_all_stop(wc, ewc, cycle);
315 void wallcycle_start_nocount(gmx_wallcycle_t wc, int ewc)
322 wallcycle_start(wc, ewc);
326 double wallcycle_stop(gmx_wallcycle_t wc, int ewc)
328 gmx_cycles_t cycle, last;
338 MPI_Barrier(wc->mpi_comm_mygroup);
343 debug_stop_check(wc, ewc);
346 /* When processes or threads migrate between cores, the cycle counting
347 * can get messed up if the cycle counter on different cores are not
348 * synchronized. When this happens we expect both large negative and
349 * positive cycle differences. We can detect negative cycle differences.
350 * Detecting too large positive counts if difficult, since count can be
351 * large, especially for ewcRUN. If we detect a negative count,
352 * we will not print the cycle accounting table.
354 cycle = gmx_cycles_read();
355 if (cycle >= wc->wcc[ewc].start)
357 last = cycle - wc->wcc[ewc].start;
362 wc->haveInvalidCount = TRUE;
364 wc->wcc[ewc].c += last;
371 wallcycle_all_stop(wc, ewc, cycle);
373 else if (wc->wc_depth == 2)
375 wallcycle_all_start(wc, ewc, cycle);
382 void wallcycle_get(gmx_wallcycle_t wc, int ewc, int *n, double *c)
385 *c = static_cast<double>(wc->wcc[ewc].c);
388 void wallcycle_reset_all(gmx_wallcycle_t wc)
397 for (i = 0; i < ewcNR; i++)
402 wc->haveInvalidCount = FALSE;
406 for (i = 0; i < ewcNR*ewcNR; i++)
408 wc->wcc_all[i].n = 0;
409 wc->wcc_all[i].c = 0;
414 for (i = 0; i < ewcsNR; i++)
422 static gmx_bool is_pme_counter(int ewc)
424 return (ewc >= ewcPMEMESH && ewc <= ewcPMEWAITCOMM);
427 static gmx_bool is_pme_subcounter(int ewc)
429 return (ewc >= ewcPME_REDISTXF && ewc < ewcPMEWAITCOMM);
432 /* Subtract counter ewc_sub timed inside a timing block for ewc_main */
433 static void subtract_cycles(wallcc_t *wcc, int ewc_main, int ewc_sub)
435 if (wcc[ewc_sub].n > 0)
437 if (wcc[ewc_main].c >= wcc[ewc_sub].c)
439 wcc[ewc_main].c -= wcc[ewc_sub].c;
443 /* Something is wrong with the cycle counting */
449 void wallcycle_scale_by_num_threads(gmx_wallcycle_t wc, bool isPmeRank, int nthreads_pp, int nthreads_pme)
456 for (int i = 0; i < ewcNR; i++)
458 if (is_pme_counter(i) || (i == ewcRUN && isPmeRank))
460 wc->wcc[i].c *= nthreads_pme;
464 for (int j = 0; j < ewcNR; j++)
466 wc->wcc_all[i*ewcNR+j].c *= nthreads_pme;
472 wc->wcc[i].c *= nthreads_pp;
476 for (int j = 0; j < ewcNR; j++)
478 wc->wcc_all[i*ewcNR+j].c *= nthreads_pp;
483 if (useCycleSubcounters && wc->wcsc && !isPmeRank)
485 for (int i = 0; i < ewcsNR; i++)
487 wc->wcsc[i].c *= nthreads_pp;
492 /* TODO Make an object for this function to return, containing some
493 * vectors of something like wallcc_t for the summed wcc, wcc_all and
494 * wcsc, AND the original wcc for rank 0.
496 * The GPU timing is reported only for rank 0, so we want to preserve
497 * the original wcycle on that rank. Rank 0 also reports the global
498 * counts before that, so needs something to contain the global data
499 * without over-writing the rank-0 data. The current implementation
500 * uses cycles_sum to manage this, which works OK now because wcsc and
501 * wcc_all are unused by the GPU reporting, but it is not satisfactory
502 * for the future. Also, there's no need for MPI_Allreduce, since
503 * only MASTERRANK uses any of the results. */
504 WallcycleCounts wallcycle_sum(const t_commrec *cr, gmx_wallcycle_t wc)
506 WallcycleCounts cycles_sum;
508 double cycles[ewcNR+ewcsNR];
510 double cycles_n[ewcNR+ewcsNR+1];
517 /* Default construction of std::array of non-class T can leave
518 the values indeterminate, just like a C array, and icc
526 subtract_cycles(wcc, ewcDOMDEC, ewcDDCOMMLOAD);
527 subtract_cycles(wcc, ewcDOMDEC, ewcDDCOMMBOUND);
529 subtract_cycles(wcc, ewcPME_FFT, ewcPME_FFTCOMM);
531 if (cr->npmenodes == 0)
533 /* All nodes do PME (or no PME at all) */
534 subtract_cycles(wcc, ewcFORCE, ewcPMEMESH);
538 /* The are PME-only nodes */
539 if (wcc[ewcPMEMESH].n > 0)
541 /* This must be a PME only node, calculate the Wait + Comm. time */
542 GMX_ASSERT(wcc[ewcRUN].c >= wcc[ewcPMEMESH].c, "Total run ticks must be greater than PME-only ticks");
543 wcc[ewcPMEWAITCOMM].c = wcc[ewcRUN].c - wcc[ewcPMEMESH].c;
547 /* Store the cycles in a double buffer for summing */
548 for (i = 0; i < ewcNR; i++)
551 cycles_n[i] = static_cast<double>(wcc[i].n);
553 cycles[i] = static_cast<double>(wcc[i].c);
558 for (i = 0; i < ewcsNR; i++)
561 cycles_n[ewcNR+i] = static_cast<double>(wc->wcsc[i].n);
563 cycles[ewcNR+i] = static_cast<double>(wc->wcsc[i].c);
571 double buf[ewcNR+ewcsNR+1];
573 // TODO this code is used only at the end of the run, so we
574 // can just do a simple reduce of haveInvalidCount in
575 // wallcycle_print, and avoid bugs
576 cycles_n[nsum] = (wc->haveInvalidCount ? 1 : 0);
577 // TODO Use MPI_Reduce
578 MPI_Allreduce(cycles_n, buf, nsum + 1, MPI_DOUBLE, MPI_MAX,
580 for (i = 0; i < ewcNR; i++)
582 wcc[i].n = gmx::roundToInt(buf[i]);
584 wc->haveInvalidCount = (buf[nsum] > 0);
587 for (i = 0; i < ewcsNR; i++)
589 wc->wcsc[i].n = gmx::roundToInt(buf[ewcNR+i]);
593 // TODO Use MPI_Reduce
594 MPI_Allreduce(cycles, cycles_sum.data(), nsum, MPI_DOUBLE, MPI_SUM,
597 if (wc->wcc_all != nullptr)
599 double *buf_all, *cyc_all;
601 snew(cyc_all, ewcNR*ewcNR);
602 snew(buf_all, ewcNR*ewcNR);
603 for (i = 0; i < ewcNR*ewcNR; i++)
605 cyc_all[i] = wc->wcc_all[i].c;
607 // TODO Use MPI_Reduce
608 MPI_Allreduce(cyc_all, buf_all, ewcNR*ewcNR, MPI_DOUBLE, MPI_SUM,
610 for (i = 0; i < ewcNR*ewcNR; i++)
612 wc->wcc_all[i].c = static_cast<gmx_cycles_t>(buf_all[i]);
621 for (i = 0; i < nsum; i++)
623 cycles_sum[i] = cycles[i];
630 static void print_cycles(FILE *fplog, double c2t, const char *name,
631 int nnodes, int nthreads,
632 int ncalls, double c_sum, double tot)
634 char nnodes_str[STRLEN];
635 char nthreads_str[STRLEN];
636 char ncalls_str[STRLEN];
638 double percentage = (tot > 0.) ? (100. * c_sum / tot) : 0.;
644 snprintf(ncalls_str, sizeof(ncalls_str), "%10d", ncalls);
647 snprintf(nnodes_str, sizeof(nnodes_str), "N/A");
651 snprintf(nnodes_str, sizeof(nnodes_str), "%4d", nnodes);
655 snprintf(nthreads_str, sizeof(nthreads_str), "N/A");
659 snprintf(nthreads_str, sizeof(nthreads_str), "%4d", nthreads);
668 /* Convert the cycle count to wallclock time for this task */
671 fprintf(fplog, " %-19.19s %4s %4s %10s %10.3f %14.3f %5.1f\n",
672 name, nnodes_str, nthreads_str, ncalls_str, wallt,
673 c_sum*1e-9, percentage);
677 static void print_gputimes(FILE *fplog, const char *name,
678 int n, double t, double tot_t)
685 snprintf(num, sizeof(num), "%10d", n);
686 snprintf(avg_perf, sizeof(avg_perf), "%10.3f", t/n);
691 sprintf(avg_perf, " ");
693 if (t != tot_t && tot_t > 0)
695 fprintf(fplog, " %-29s %10s%12.3f %s %5.1f\n",
696 name, num, t/1000, avg_perf, 100 * t/tot_t);
700 fprintf(fplog, " %-29s %10s%12.3f %s %5.1f\n",
701 name, "", t/1000, avg_perf, 100.0);
705 static void print_header(FILE *fplog, int nrank_pp, int nth_pp, int nrank_pme, int nth_pme)
707 int nrank_tot = nrank_pp + nrank_pme;
710 fprintf(fplog, "On %d MPI rank%s", nrank_tot, nrank_tot == 1 ? "" : "s");
713 fprintf(fplog, ", each using %d OpenMP threads", nth_pp);
715 /* Don't report doing PP+PME, because we can't tell here if
716 * this is RF, etc. */
720 fprintf(fplog, "On %d MPI rank%s doing PP", nrank_pp, nrank_pp == 1 ? "" : "s");
723 fprintf(fplog, ",%s using %d OpenMP threads", nrank_pp > 1 ? " each" : "", nth_pp);
725 fprintf(fplog, ", and\non %d MPI rank%s doing PME", nrank_pme, nrank_pme == 1 ? "" : "s");
728 fprintf(fplog, ",%s using %d OpenMP threads", nrank_pme > 1 ? " each" : "", nth_pme);
732 fprintf(fplog, "\n\n");
733 fprintf(fplog, " Computing: Num Num Call Wall time Giga-Cycles\n");
734 fprintf(fplog, " Ranks Threads Count (s) total sum %%\n");
738 void wallcycle_print(FILE *fplog, const gmx::MDLogger &mdlog, int nnodes, int npme,
739 int nth_pp, int nth_pme, double realtime,
740 gmx_wallcycle_t wc, const WallcycleCounts &cyc_sum,
741 const gmx_wallclock_gpu_nbnxn_t *gpu_nbnxn_t,
742 const gmx_wallclock_gpu_pme_t *gpu_pme_t)
744 double tot, tot_for_pp, tot_for_rest, tot_cpu_overlap, gpu_cpu_ratio;
745 double c2t, c2t_pp, c2t_pme = 0;
746 int i, j, npp, nth_tot;
748 const char *hline = "-----------------------------------------------------------------------------";
755 GMX_ASSERT(nth_pp > 0, "Number of particle-particle threads must be >0");
756 GMX_ASSERT(nth_pme > 0, "Number of PME threads must be >0");
757 GMX_ASSERT(nnodes > 0, "Number of nodes must be >0");
758 GMX_ASSERT(npme >= 0, "Number of PME nodes cannot be negative");
760 /* npme is the number of PME-only ranks used, and we always do PP work */
761 GMX_ASSERT(npp > 0, "Number of particle-particle nodes must be >0");
763 nth_tot = npp*nth_pp + npme*nth_pme;
765 /* When using PME-only nodes, the next line is valid for both
766 PP-only and PME-only nodes because they started ewcRUN at the
768 tot = cyc_sum[ewcRUN];
773 /* TODO This is heavy handed, but until someone reworks the
774 code so that it is provably robust with respect to
775 non-positive values for all possible timer and cycle
776 counters, there is less value gained from printing whatever
777 timing data might still be sensible for some non-Jenkins
778 run, than is lost from diagnosing Jenkins FP exceptions on
779 runs about whose execution time we don't care. */
780 GMX_LOG(mdlog.warning).asParagraph().appendTextFormatted(
781 "WARNING: A total of %f CPU cycles was recorded, so mdrun cannot print a time accounting",
786 if (wc->haveInvalidCount)
788 GMX_LOG(mdlog.warning).asParagraph().appendText("NOTE: Detected invalid cycle counts, probably because threads moved between CPU cores that do not have synchronized cycle counters. Will not print the cycle accounting.");
793 /* Conversion factor from cycles to seconds */
795 c2t_pp = c2t * nth_tot / static_cast<double>(npp*nth_pp);
798 c2t_pme = c2t * nth_tot / static_cast<double>(npme*nth_pme);
805 fprintf(fplog, "\n R E A L C Y C L E A N D T I M E A C C O U N T I N G\n\n");
807 print_header(fplog, npp, nth_pp, npme, nth_pme);
809 fprintf(fplog, "%s\n", hline);
810 for (i = ewcPPDURINGPME+1; i < ewcNR; i++)
812 if (is_pme_subcounter(i))
814 /* Do not count these at all */
816 else if (npme > 0 && is_pme_counter(i))
818 /* Print timing information for PME-only nodes, but add an
819 * asterisk so the reader of the table can know that the
820 * walltimes are not meant to add up. The asterisk still
821 * fits in the required maximum of 19 characters. */
823 snprintf(buffer, STRLEN, "%s *", wcn[i]);
824 print_cycles(fplog, c2t_pme, buffer,
826 wc->wcc[i].n, cyc_sum[i], tot);
830 /* Print timing information when it is for a PP or PP+PME
832 print_cycles(fplog, c2t_pp, wcn[i],
834 wc->wcc[i].n, cyc_sum[i], tot);
835 tot_for_pp += cyc_sum[i];
838 if (wc->wcc_all != nullptr)
840 for (i = 0; i < ewcNR; i++)
842 for (j = 0; j < ewcNR; j++)
844 snprintf(buf, 20, "%-9.9s %-9.9s", wcn[i], wcn[j]);
845 print_cycles(fplog, c2t_pp, buf,
847 wc->wcc_all[i*ewcNR+j].n,
848 wc->wcc_all[i*ewcNR+j].c,
853 tot_for_rest = tot * npp * nth_pp / static_cast<double>(nth_tot);
854 print_cycles(fplog, c2t_pp, "Rest",
856 -1, tot_for_rest - tot_for_pp, tot);
857 fprintf(fplog, "%s\n", hline);
858 print_cycles(fplog, c2t, "Total",
861 fprintf(fplog, "%s\n", hline);
866 "(*) Note that with separate PME ranks, the walltime column actually sums to\n"
867 " twice the total reported, but the cycle count total and %% are correct.\n"
871 if (wc->wcc[ewcPMEMESH].n > 0)
873 // A workaround to not print breakdown when no subcounters were recorded.
874 // TODO: figure out and record PME GPU counters (what to do with the waiting ones?)
875 std::vector<int> validPmeSubcounterIndices;
876 for (i = ewcPPDURINGPME+1; i < ewcNR; i++)
878 if (is_pme_subcounter(i) && wc->wcc[i].n > 0)
880 validPmeSubcounterIndices.push_back(i);
884 if (!validPmeSubcounterIndices.empty())
886 fprintf(fplog, " Breakdown of PME mesh computation\n");
887 fprintf(fplog, "%s\n", hline);
888 for (auto i : validPmeSubcounterIndices)
890 print_cycles(fplog, npme > 0 ? c2t_pme : c2t_pp, wcn[i],
891 npme > 0 ? npme : npp, nth_pme,
892 wc->wcc[i].n, cyc_sum[i], tot);
894 fprintf(fplog, "%s\n", hline);
898 if (useCycleSubcounters && wc->wcsc)
900 fprintf(fplog, " Breakdown of PP computation\n");
901 fprintf(fplog, "%s\n", hline);
902 for (i = 0; i < ewcsNR; i++)
904 print_cycles(fplog, c2t_pp, wcsn[i],
906 wc->wcsc[i].n, cyc_sum[ewcNR+i], tot);
908 fprintf(fplog, "%s\n", hline);
911 /* print GPU timing summary */
912 double tot_gpu = 0.0;
915 for (size_t k = 0; k < gtPME_EVENT_COUNT; k++)
917 tot_gpu += gpu_pme_t->timing[k].t;
922 const char *k_log_str[2][2] = {
923 {"Nonbonded F kernel", "Nonbonded F+ene k."},
924 {"Nonbonded F+prune k.", "Nonbonded F+ene+prune k."}
926 tot_gpu += gpu_nbnxn_t->pl_h2d_t + gpu_nbnxn_t->nb_h2d_t + gpu_nbnxn_t->nb_d2h_t;
928 /* add up the kernel timings */
929 for (i = 0; i < 2; i++)
931 for (j = 0; j < 2; j++)
933 tot_gpu += gpu_nbnxn_t->ktime[i][j].t;
936 tot_gpu += gpu_nbnxn_t->pruneTime.t;
938 tot_cpu_overlap = wc->wcc[ewcFORCE].c;
939 if (wc->wcc[ewcPMEMESH].n > 0)
941 tot_cpu_overlap += wc->wcc[ewcPMEMESH].c;
943 tot_cpu_overlap *= realtime*1000/tot; /* convert s to ms */
945 fprintf(fplog, "\n GPU timings\n%s\n", hline);
946 fprintf(fplog, " Computing: Count Wall t (s) ms/step %c\n", '%');
947 fprintf(fplog, "%s\n", hline);
948 print_gputimes(fplog, "Pair list H2D",
949 gpu_nbnxn_t->pl_h2d_c, gpu_nbnxn_t->pl_h2d_t, tot_gpu);
950 print_gputimes(fplog, "X / q H2D",
951 gpu_nbnxn_t->nb_c, gpu_nbnxn_t->nb_h2d_t, tot_gpu);
953 for (i = 0; i < 2; i++)
955 for (j = 0; j < 2; j++)
957 if (gpu_nbnxn_t->ktime[i][j].c)
959 print_gputimes(fplog, k_log_str[i][j],
960 gpu_nbnxn_t->ktime[i][j].c, gpu_nbnxn_t->ktime[i][j].t, tot_gpu);
966 for (size_t k = 0; k < gtPME_EVENT_COUNT; k++)
968 if (gpu_pme_t->timing[k].c)
970 print_gputimes(fplog, PMEStageNames[k],
971 gpu_pme_t->timing[k].c,
972 gpu_pme_t->timing[k].t,
977 if (gpu_nbnxn_t->pruneTime.c)
979 print_gputimes(fplog, "Pruning kernel", gpu_nbnxn_t->pruneTime.c, gpu_nbnxn_t->pruneTime.t, tot_gpu);
981 print_gputimes(fplog, "F D2H", gpu_nbnxn_t->nb_c, gpu_nbnxn_t->nb_d2h_t, tot_gpu);
982 fprintf(fplog, "%s\n", hline);
983 print_gputimes(fplog, "Total ", gpu_nbnxn_t->nb_c, tot_gpu, tot_gpu);
984 fprintf(fplog, "%s\n", hline);
985 if (gpu_nbnxn_t->dynamicPruneTime.c)
987 /* We print the dynamic pruning kernel timings after a separator
988 * and avoid adding it to tot_gpu as this is not in the force
989 * overlap. We print the fraction as relative to the rest.
991 print_gputimes(fplog, "*Dynamic pruning", gpu_nbnxn_t->dynamicPruneTime.c, gpu_nbnxn_t->dynamicPruneTime.t, tot_gpu);
992 fprintf(fplog, "%s\n", hline);
994 gpu_cpu_ratio = tot_gpu/tot_cpu_overlap;
995 if (gpu_nbnxn_t->nb_c > 0 && wc->wcc[ewcFORCE].n > 0)
997 fprintf(fplog, "\nAverage per-step force GPU/CPU evaluation time ratio: %.3f ms/%.3f ms = %.3f\n",
998 tot_gpu/gpu_nbnxn_t->nb_c, tot_cpu_overlap/wc->wcc[ewcFORCE].n,
1002 /* only print notes related to CPU-GPU load balance with PME */
1003 if (wc->wcc[ewcPMEMESH].n > 0)
1005 fprintf(fplog, "For optimal resource utilization this ratio should be close to 1\n");
1007 /* print note if the imbalance is high with PME case in which
1008 * CPU-GPU load balancing is possible */
1009 if (gpu_cpu_ratio < 0.8 || gpu_cpu_ratio > 1.25)
1011 /* Only the sim master calls this function, so always print to stderr */
1012 if (gpu_cpu_ratio < 0.8)
1016 /* The user could have used -notunepme,
1017 * but we currently can't check that here.
1019 GMX_LOG(mdlog.warning).asParagraph().appendText(
1020 "NOTE: The CPU has >25% more load than the GPU. This imbalance wastes\n"
1021 " GPU resources. Maybe the domain decomposition limits the PME tuning.\n"
1022 " In that case, try setting the DD grid manually (-dd) or lowering -dds.");
1026 /* We should not end up here, unless the box is
1027 * too small for increasing the cut-off for PME tuning.
1029 GMX_LOG(mdlog.warning).asParagraph().appendText(
1030 "NOTE: The CPU has >25% more load than the GPU. This imbalance wastes\n"
1034 if (gpu_cpu_ratio > 1.25)
1036 GMX_LOG(mdlog.warning).asParagraph().appendText(
1037 "NOTE: The GPU has >25% more load than the CPU. This imbalance wastes\n"
1046 GMX_LOG(mdlog.warning).asParagraph().appendText(
1047 "MPI_Barrier was called before each cycle start/stop\n"
1048 "call, so timings are not those of real runs.");
1051 if (wc->wcc[ewcNB_XF_BUF_OPS].n > 0 &&
1052 (cyc_sum[ewcDOMDEC] > tot*0.1 ||
1053 cyc_sum[ewcNS] > tot*0.1))
1055 /* Only the sim master calls this function, so always print to stderr */
1056 if (wc->wcc[ewcDOMDEC].n == 0)
1058 GMX_LOG(mdlog.warning).asParagraph().appendTextFormatted(
1059 "NOTE: %d %% of the run time was spent in pair search,\n"
1060 " you might want to increase nstlist (this has no effect on accuracy)\n",
1061 gmx::roundToInt(100*cyc_sum[ewcNS]/tot));
1065 GMX_LOG(mdlog.warning).asParagraph().appendTextFormatted(
1066 "NOTE: %d %% of the run time was spent in domain decomposition,\n"
1067 " %d %% of the run time was spent in pair search,\n"
1068 " you might want to increase nstlist (this has no effect on accuracy)\n",
1069 gmx::roundToInt(100*cyc_sum[ewcDOMDEC]/tot),
1070 gmx::roundToInt(100*cyc_sum[ewcNS]/tot));
1074 if (cyc_sum[ewcMoveE] > tot*0.05)
1076 GMX_LOG(mdlog.warning).asParagraph().appendTextFormatted(
1077 "NOTE: %d %% of the run time was spent communicating energies,\n"
1078 " you might want to increase some nst* mdp options\n",
1079 gmx::roundToInt(100*cyc_sum[ewcMoveE]/tot));
1083 extern int64_t wcycle_get_reset_counters(gmx_wallcycle_t wc)
1090 return wc->reset_counters;
1093 extern void wcycle_set_reset_counters(gmx_wallcycle_t wc, int64_t reset_counters)
1100 wc->reset_counters = reset_counters;
1103 void wallcycle_sub_start(gmx_wallcycle_t wc, int ewcs)
1105 if (useCycleSubcounters && wc != nullptr)
1107 wc->wcsc[ewcs].start = gmx_cycles_read();
1111 void wallcycle_sub_start_nocount(gmx_wallcycle_t wc, int ewcs)
1113 if (useCycleSubcounters && wc != nullptr)
1115 wallcycle_sub_start(wc, ewcs);
1120 void wallcycle_sub_stop(gmx_wallcycle_t wc, int ewcs)
1122 if (useCycleSubcounters && wc != nullptr)
1124 wc->wcsc[ewcs].c += gmx_cycles_read() - wc->wcsc[ewcs].start;