1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968
|
// ------------------------------------------------------------------------
//
// SPDX-License-Identifier: LGPL-2.1-or-later
// Copyright (C) 1998 - 2023 by the deal.II authors
//
// This file is part of the deal.II library.
//
// Part of the source code is dual licensed under Apache-2.0 WITH
// LLVM-exception OR LGPL-2.1-or-later. Detailed license information
// governing the source code and code contributions can be found in
// LICENSE.md and CONTRIBUTING.md at the top level directory of deal.II.
//
// ------------------------------------------------------------------------
#ifndef dealii_timer_h
#define dealii_timer_h
#include <deal.II/base/config.h>
#include <deal.II/base/conditional_ostream.h>
#include <deal.II/base/mpi.h>
#include <deal.II/base/mutex.h>
#include <chrono>
#include <list>
#include <map>
#include <string>
DEAL_II_NAMESPACE_OPEN
/**
* A clock, compatible with the <code>std::chrono</code> notion of a clock,
* whose now() method returns a time point indicating the amount of CPU time
* that the current process has used.
*/
struct CPUClock
{
/**
* Duration type. Windows measures CPU times, by default, in multiples of
* 1/64th of a second and POSIX uses microseconds, so go with microseconds
* for uniformity.
*/
using duration = std::chrono::microseconds;
/**
* Signed integral type used to store the value returned by count().
*/
using rep = duration::rep;
/**
* Ratio representing the length of a period (in seconds).
*/
using period = duration::period;
/**
* Time point type.
*/
using time_point = std::chrono::time_point<CPUClock, duration>;
/**
* Boolean indicating that the clock monotonically increases.
*/
static const bool is_steady = true;
/**
* Return the amount of CPU time that the current process has
* used. Unfortunately, this requires platform-specific calls, so this
* function returns 0 on platforms that are neither Windows nor POSIX.
*/
static time_point
now() noexcept;
};
/**
* The Timer class provides a way to measure both the amount of wall time
* (i.e., the amount of time elapsed on a wall clock) and the amount of CPU
* time that certain sections of an application have used. This class also
* offers facilities for synchronizing the elapsed time across an MPI
* communicator.
*
* <h3>Usage</h3>
*
* The Timer class can be started and stopped several times. It stores both
* the amount of time elapsed over the last start-stop cycle, or <em>lap</em>,
* as well as the total time elapsed over all laps. Here is an example:
*
* @code
* Timer timer; // creating a timer also starts it
*
* // do some complicated computations here
* // ...
*
* timer.stop();
*
* std::cout << "Elapsed CPU time: " << timer.cpu_time() << " seconds.\n";
* std::cout << "Elapsed wall time: " << timer.wall_time() << " seconds.\n";
*
* // reset timer for the next thing it shall do
* timer.reset();
* @endcode
*
* Alternatively, you can also restart the timer instead of resetting it. The
* times between successive calls to start() and stop() (i.e., the laps) will
* then be accumulated. The usage of this class is also explained in the
* step-28 tutorial program.
*
* @note The TimerOutput (combined with TimerOutput::Scope) class provide a
* convenient way to time multiple named sections and summarize the output.
*
* @note Implementation of this class is system dependent. In particular, CPU
* times are accumulated from summing across all threads and will usually
* exceed the wall times.
*
* @ingroup utilities
*/
class Timer
{
public:
/**
* Constructor. Sets the accumulated times at zero and calls Timer::start().
*/
Timer();
/**
* Constructor specifying that CPU times should be summed over the given
* communicator. If @p sync_lap_times is <code>true</code> then the Timer
* will set the elapsed wall and CPU times over the last lap to their
* maximum values across the provided communicator. This synchronization is
* only performed if Timer::stop() is called before the timer is queried for
* time duration values.
*
* This constructor calls Timer::start().
*
* @note The timer is stopped before the synchronization over the
* communicator occurs; the extra cost of the synchronization is not
* measured.
*/
Timer(const MPI_Comm mpi_communicator, const bool sync_lap_times = false);
/**
* Return a reference to the data structure containing basic statistics on
* the last lap's wall time measured across all MPI processes in the given
* communicator. This structure does not contain meaningful values until
* Timer::stop() has been called.
*/
const Utilities::MPI::MinMaxAvg &
get_last_lap_wall_time_data() const;
/**
* Return a reference to the data structure containing basic statistics on
* the accumulated wall time measured across all MPI processes in the given
* communicator. This structure does not contain meaningful values until
* Timer::stop() has been called.
*/
const Utilities::MPI::MinMaxAvg &
get_accumulated_wall_time_data() const;
/**
* Print the data returned by Timer::get_last_lap_wall_time_data() to the
* given stream.
*/
template <typename StreamType>
void
print_last_lap_wall_time_data(StreamType &stream) const;
/**
* Print the data returned by Timer::get_accumulated_wall_time_data() to the
* given stream.
*/
template <typename StreamType>
void
print_accumulated_wall_time_data(StreamType &stream) const;
/**
* Begin measuring a new lap. If <code>sync_lap_times</code> is
* <code>true</code> then an MPI barrier is used to ensure that all
* processes begin the lap at the same wall time.
*/
void
start();
/**
* Stop the timer. This updates the lap times and accumulated times. If
* <code>sync_lap_times</code> is <code>true</code> then the lap times are
* synchronized over all processors in the communicator (i.e., the lap times
* are set to the maximum lap time).
*
* Return the accumulated CPU time in seconds.
*/
double
stop();
/**
* Stop the timer, if it is running, and reset all measured values to their
* default states.
*/
void
reset();
/**
* Equivalent to calling Timer::reset() followed by calling Timer::start().
*/
void
restart();
/**
* Return the current accumulated wall time (including the current lap, if
* the timer is running) in seconds without stopping the timer.
*/
double
wall_time() const;
/**
* Return the wall time of the last lap in seconds. The timer is not stopped
* by this function.
*/
double
last_wall_time() const;
/**
* Return the accumulated CPU time (including the current lap, if the timer
* is running) in seconds without stopping the timer.
*
* If an MPI communicator is provided to the constructor then the returned
* value is the sum of all accumulated CPU times over all processors in the
* communicator.
*/
double
cpu_time() const;
/**
* Return the CPU time of the last lap in seconds. The timer is not stopped
* by this function.
*/
double
last_cpu_time() const;
private:
/**
* The Timer class stores timing information for two different clocks: a
* wall clock and a CPU usage clock. Since the logic for handling both
* clocks is, in most places, identical, we collect the relevant
* measurements for each clock into this <code>struct</code>.
*
* @tparam clock_type_ The type of the clock whose measurements are being
* stored. This class should conform to the usual clock interface expected
* by <code>std::chrono</code> (i.e., the correct alias and a static
* <code>now()</code> method).
*/
template <class clock_type_>
struct ClockMeasurements
{
/**
* Store the clock type.
*/
using clock_type = clock_type_;
/**
* The time point type of the provided clock.
*/
using time_point_type = typename clock_type::time_point;
/**
* The duration type of the provided clock.
*/
using duration_type = typename clock_type::duration;
/**
* The time point corresponding to the start of the current lap. This is
* obtained by calling <code>clock_type::now()</code>.
*/
time_point_type current_lap_start_time;
/**
* The accumulated time over several laps.
*/
duration_type accumulated_time;
/**
* The duration of the last lap.
*/
duration_type last_lap_time;
/**
* Constructor. Sets <code>current_lap_start_time</code> to the current
* clock time and the durations to zero.
*/
ClockMeasurements();
/**
* Reset the clock by setting <code>current_lap_start_time</code> to the
* current clock time and the durations to zero.
*/
void
reset();
};
/**
* Alias for the wall clock.
*/
using wall_clock_type = std::chrono::steady_clock;
/**
* Alias for the CPU clock.
*/
using cpu_clock_type = CPUClock;
/**
* Collection of wall time measurements.
*/
ClockMeasurements<wall_clock_type> wall_times;
/**
* Collection of CPU time measurements.
*/
ClockMeasurements<cpu_clock_type> cpu_times;
/**
* Whether or not the timer is presently running.
*/
bool running;
/**
* The communicator over which various time values are synchronized and
* combined: see the documentation of the relevant constructor for
* additional information.
*/
MPI_Comm mpi_communicator;
/**
* Store whether or not the wall time and CPU time are synchronized across
* the communicator in Timer::start() and Timer::stop().
*/
bool sync_lap_times;
/**
* A structure for parallel wall time measurement that includes the minimum,
* maximum, and average over all processors known to the MPI communicator of
* the last lap time.
*/
Utilities::MPI::MinMaxAvg last_lap_wall_time_data;
/**
* A structure for parallel wall time measurement that includes the minimum
* time recorded among all processes, the maximum time as well as the
* average time defined as the sum of all individual times divided by the
* number of MPI processes in the MPI_Comm for the total run time.
*/
Utilities::MPI::MinMaxAvg accumulated_wall_time_data;
};
// TODO: The following class is not thread-safe
/**
* This class can be used to generate formatted output from time measurements
* of different subsections in a program. It is possible to create several
* sections that perform certain aspects of the program. A section can be
* entered several times. By changing the options in OutputFrequency and
* OutputType, the user can choose whether output should be generated every
* time a section is joined or just in the end of the program. Moreover, it is
* possible to show CPU times, wall times, or both.
*
* The class is used in a substantial number of tutorial programs that collect
* timing data. step-77 is an example of a relatively simple sequential program
* that uses it. step-40 and several others mentioned below use it for parallel
* computations.
*
*
* <h3>Usage</h3>
*
* Use of this class could be as follows:
* @code
* TimerOutput timer (std::cout, TimerOutput::summary,
* TimerOutput::wall_times);
*
* timer.enter_subsection ("Setup dof system");
* setup_dofs();
* timer.leave_subsection();
*
* timer.enter_subsection ("Assemble");
* assemble_system_1();
* timer.leave_subsection();
*
* timer.enter_subsection ("Solve");
* solve_system_1();
* timer.leave_subsection();
*
* timer.enter_subsection ("Assemble");
* assemble_system_2();
* timer.leave_subsection();
*
* timer.enter_subsection ("Solve");
* solve_system_2();
* timer.leave_subsection();
*
* // do something else...
* @endcode
* When run, this program will return an output like this:
* @code
* +---------------------------------------------+------------+------------+
* | Total wallclock time elapsed since start | 88.8s | |
* | | | |
* | Section | no. calls | wall time | % of total |
* +---------------------------------+-----------+------------+------------+
* | Assemble | 2 | 19.7s | 22% |
* | Solve | 2 | 3.03s | 3.4% |
* | Setup dof system | 1 | 3.97s | 4.5% |
* +---------------------------------+-----------+------------+------------+
* @endcode
* The output will see that we entered the assembly and solve section twice,
* and reports how much time we spent there. Moreover, the class measures the
* total time spent from start to termination of the TimerOutput object. In
* this case, we did a lot of other stuff, so that the time proportions of the
* functions we measured are far away from 100 percent.
*
*
* <h3>Using scoped timers</h3>
*
* The scheme above where you have to have calls to
* TimerOutput::enter_subsection() and TimerOutput::leave_subsection() is
* awkward if the sections in between these calls contain <code>return</code>
* statements or may throw exceptions. In that case, it is easy to forget that
* one nevertheless needs to leave the section somehow, somewhere. An easier
* approach is to use "scoped" sections. This is a variable that when you
* create it enters a section, and leaves the section when you destroy it. If
* this is a variable local to a particular scope (a code block between curly
* braces) and you leave this scope due to a <code>return</code> statements or
* an exception, then the variable is destroyed and the timed section is left
* automatically. Consequently, we could have written the code piece above as
* follows, with exactly the same result but now exception-safe:
* @code
* TimerOutput timer (std::cout, TimerOutput::summary,
* TimerOutput::wall_times);
*
* {
* TimerOutput::Scope timer_section(timer, "Setup dof system");
* setup_dofs();
* }
*
* {
* TimerOutput::Scope timer_section(timer, "Assemble");
* assemble_system_1();
* }
*
* {
* TimerOutput::Scope timer_section(timer, "Solve");
* solve_system_1();
* }
*
* {
* TimerOutput::Scope timer_section(timer, "Assemble");
* assemble_system_2();
* }
*
* {
* TimerOutput::Scope timer_section(timer, "Solve");
* solve_system_2();
* }
*
* // do something else...
* @endcode
*
*
* <h3>Usage in parallel programs using MPI</h3>
*
* In a parallel program built on MPI, using the class in a way such as the
* one shown above would result in a situation where each process times the
* corresponding sections and then outputs the resulting timing information at
* the end. This is annoying since you'd get a lot of output -- one set of
* timing information from each processor.
*
* This can be avoided by only letting one processor generate screen output,
* typically by using an object of type ConditionalOStream instead of
* <code>std::cout</code> to write to screen (see, for example, step-17,
* step-18, step-32 and step-40, all of which use this method).
*
* This way, only a single processor outputs timing information, typically the
* first process in the MPI universe. However, if you take the above code
* snippet as an example, imagine what would happen if
* <code>setup_dofs()</code> is fast on processor zero and slow on at least
* one of the other processors; and if the first thing
* <code>assemble_system_1()</code> does is something that requires all
* processors to communicate. In this case, on processor zero, the timing
* section with name <code>"Setup dof system"</code> will yield a short run
* time on processor zero, whereas the section <code> "Assemble"</code> will
* take a long time: not because <code>assemble_system_1()</code> takes a
* particularly long time, but because on the processor on which we time (or,
* rather, the one on which we generate output) happens to have to wait for a
* long time till the other processor is finally done with
* <code>setup_dofs()</code> and starts to participate in
* <code>assemble_system_1()</code>. In other words, the timing that is
* reported is unreliable because it reflects run times from other processors.
* Furthermore, the run time of this section on processor zero has nothing to
* do with the run time of the section on other processors but instead with
* the run time of <i>the previous section</i> on another processor.
*
* The first way to avoid this is to introduce a barrier into the parallel
* code just before we start and stop timing sections. This ensures that all
* processes are at the same place and the timing information then reflects
* the maximal run time across all processors. To achieve this, you need to
* initialize the TimerOutput object with an MPI communicator object, for
* example as in the following code:
* @code
* TimerOutput timer (MPI_COMM_WORLD,
* pcout,
* TimerOutput::summary,
* TimerOutput::wall_times);
* @endcode
* Here, <code>pcout</code> is an object of type ConditionalOStream that makes
* sure that we only generate output on a single processor. See the step-32,
* step-40, and step-42 tutorial programs for this kind of usage of this class.
*
* The second variant to cope with this issue is print more information about
* the recorded times to be able to understand this kind of imbalances without
* actually adding the barriers. While this approach is still affected by
* imbalances between different MPI processes, its output is not the arbitrary
* time of rank 0, but the minimum, average and maximum of the MPI results,
* using information from Utilities::MPI::MinMaxAvg. As the data is also
* equipped with the rank id where the minimum and maximum are attained, this
* approach allows to identify on which ranks certain slowdowns occur. In case
* some imbalance between the MPI ranks from one section to the next can be
* tolerated, this strategy can hence be advantageous over the barrier variant
* as it does not synchronize the program in places where it is not necessary,
* and rather tries to display the imbalance observed in various phases. In
* order to use this variant initialize the output object without any native
* print settings and without communicator,
* @code
* TimerOutput timer (pcout,
* TimerOutput::never,
* TimerOutput::wall_times);
* @endcode
* and then call
* @code
* timer.print_wall_time_statistics(MPI_COMM_WORLD);
* @endcode
* where appropriate. Here, the output is written to the <code>pcout</code>
* object of type ConditionalOStream passed to the constructor, making sure
* the information is only printed once. See step-67 for an example usage of
* this variant. Besides the basic minimum, average, and maximum of times over
* all MPI ranks, the TimerOutput::print_wall_time_statistics() function also
* takes a second argument to specify output of quantiles, e.g., the time
* taken by the 10\% of the slowest and fastest ranks, respectively, to get
* additional insight into the statistical distribution.
*
* @ingroup utilities
*/
class TimerOutput
{
public:
/**
* Helper class to enter/exit sections in TimerOutput be constructing a
* simple scope-based object. The purpose of this class is explained in the
* documentation of TimerOutput.
*/
class Scope
{
public:
/**
* Enter the given section in the timer. Exit automatically when calling
* stop() or destructor runs.
*/
Scope(dealii::TimerOutput &timer_, const std::string §ion_name);
/**
* Destructor calls stop()
*/
~Scope();
/**
* In case you want to exit the scope before the destructor is executed,
* call this function.
*/
void
stop();
private:
/**
* Reference to the TimerOutput object
*/
dealii::TimerOutput &timer;
/**
* Name of the section we need to exit
*/
const std::string section_name;
/**
* Do we still need to exit the section we are in?
*/
bool in;
};
/**
* An enumeration data type that describes whether to generate output every
* time we exit a section, just in the end, both, or never.
*/
enum OutputFrequency
{
/**
* Generate output after every call.
*/
every_call,
/**
* Generate output in summary at the end.
*/
summary,
/**
* Generate output both after every call and in summary at the end.
*/
every_call_and_summary,
/**
* Never generate any output.
*/
never
};
/**
* An enumeration data type that describes the type of data to return
* when fetching the data from the timer.
*/
enum OutputData
{
/**
* Output CPU times.
*/
total_cpu_time,
/**
* Output wall clock times.
*/
total_wall_time,
/**
* Output number of calls.
*/
n_calls
};
/**
* An enumeration data type that describes whether to show CPU times, wall
* times, or both CPU and wall times whenever we generate output.
*/
enum OutputType
{
/**
* Output CPU times.
*/
cpu_times,
/**
* Output wall clock times.
*/
wall_times,
/**
* Output both CPU and wall clock times in separate tables.
*/
cpu_and_wall_times,
/**
* Output both CPU and wall clock times in a single table.
*/
cpu_and_wall_times_grouped
};
/**
* Constructor.
*
* @param stream The stream (of type std::ostream) to which output is
* written.
* @param output_frequency A variable indicating when output is to be
* written to the given stream.
* @param output_type A variable indicating what kind of timing the output
* should represent (CPU or wall time).
*/
TimerOutput(std::ostream &stream,
const OutputFrequency output_frequency,
const OutputType output_type);
/**
* Constructor.
*
* @param stream The stream (of type ConditionalOstream) to which output is
* written.
* @param output_frequency A variable indicating when output is to be
* written to the given stream.
* @param output_type A variable indicating what kind of timing the output
* should represent (CPU or wall time).
*/
TimerOutput(ConditionalOStream &stream,
const OutputFrequency output_frequency,
const OutputType output_type);
/**
* Constructor that takes an MPI communicator as input. A timer constructed
* this way will sum up the CPU times over all processors in the MPI network
* for calculating the CPU time, or take the maximum over all processors,
* depending on the value of @p output_type . See the documentation of this
* class for the rationale for this constructor and an example.
*
* @param mpi_comm An MPI communicator across which we should accumulate or
* otherwise synchronize the timing information we produce on every MPI
* process.
* @param stream The stream (of type std::ostream) to which output is
* written.
* @param output_frequency A variable indicating when output is to be
* written to the given stream.
* @param output_type A variable indicating what kind of timing the output
* should represent (CPU or wall time). In this parallel context, when this
* argument selects CPU time, then times are accumulated over all processes
* participating in the MPI communicator. If this argument selects wall
* time, then reported times are the maximum over all processors' run times
* for this section. (The latter is computed by placing an
* <code>MPI_Barrier</code> call before starting and stopping the timer for
* each section.
*/
TimerOutput(const MPI_Comm mpi_comm,
std::ostream &stream,
const OutputFrequency output_frequency,
const OutputType output_type);
/**
* Constructor that takes an MPI communicator as input. A timer constructed
* this way will sum up the CPU times over all processors in the MPI network
* for calculating the CPU time, or take the maximum over all processors,
* depending on the value of @p output_type . See the documentation of this
* class for the rationale for this constructor and an example.
*
* @param mpi_comm An MPI communicator across which we should accumulate or
* otherwise synchronize the timing information we produce on every MPI
* process.
* @param stream The stream (of type ConditionalOstream) to which output is
* written.
* @param output_frequency A variable indicating when output is to be
* written to the given stream.
* @param output_type A variable indicating what kind of timing the output
* should represent (CPU or wall time). In this parallel context, when this
* argument selects CPU time, then times are accumulated over all processes
* participating in the MPI communicator. If this argument selects wall
* time, then reported times are the maximum over all processors' run times
* for this section. (The latter is computed by placing an
* <code>MPI_Barrier</code> call before starting and stopping the timer for
* each section.)
*/
TimerOutput(const MPI_Comm mpi_comm,
ConditionalOStream &stream,
const OutputFrequency output_frequency,
const OutputType output_type);
/**
* Destructor. Calls print_summary() in case the option for writing the
* summary output is set.
*/
~TimerOutput();
/**
* Open a section by given a string name of it. In case the name already
* exists, that section is entered once again and times are accumulated.
*/
void
enter_subsection(const std::string §ion_name);
/**
* Leave a section. If no name is given, the last section that was entered
* is left.
*/
void
leave_subsection(const std::string §ion_name = "");
/**
* Get a map with the collected data of the specified type for each subsection
*/
std::map<std::string, double>
get_summary_data(const OutputData kind) const;
/**
* Print a formatted table that summarizes the time consumed in the various
* sections.
*/
void
print_summary() const;
/**
* Print a formatted table that summarizes the wall time consumed in the
* various sections, using statistics in terms of the minimum, average, and
* maximum of times in the various sections and the MPI ranks where the
* minimum and maximum are attained. Note that this call only provides
* useful information when the TimerOutput object is constructed without an
* MPI_Comm argument, to let individual sections run without being disturbed
* by barriers.
*
* The optional argument `quantile` allows to add two additional columns to
* the output in terms of the distribution of run times. If quantile = 0.1,
* the value and rank of the 10% lowest data is printed as well as the value
* and rank at 90% of the distribution function, in addition to the minimum
* and the maximum. The value of `quantile` needs to be between 0 (no
* quantiles are printed besides the minimum and maximum) and 0.5 (when the
* median is given).
*/
void
print_wall_time_statistics(const MPI_Comm mpi_comm,
const double print_quantile = 0.) const;
/**
* By calling this function, all output can be disabled. This function
* together with enable_output() can be useful if one wants to control the
* output in a flexible way without putting a lot of <tt>if</tt> clauses in
* the program.
*/
void
disable_output();
/**
* This function re-enables output of this class if it was previously
* disabled with disable_output(). This function together with
* disable_output() can be useful if one wants to control the output in a
* flexible way without putting a lot of <tt>if</tt> clauses in the program.
*/
void
enable_output();
/**
* Resets the recorded timing information.
*/
void
reset();
private:
/**
* When to output information to the output stream.
*/
OutputFrequency output_frequency;
/**
* Whether to show CPU times, wall times, or both CPU and wall times.
*/
OutputType output_type;
/**
* A timer object for the overall run time. If we are using MPI, this timer
* also accumulates over all MPI processes.
*/
Timer timer_all;
/**
* A structure that groups all information that we collect about each of the
* sections.
*/
struct Section
{
Timer timer;
double total_cpu_time;
double total_wall_time;
unsigned int n_calls;
};
/**
* A list of all the sections and their information.
*/
std::map<std::string, Section> sections;
/**
* The stream object to which we are to output.
*/
ConditionalOStream out_stream;
/**
* A boolean variable that sets whether output of this class is currently on
* or off.
*/
bool output_is_enabled;
/**
* A list of the sections that have been entered and not exited. The list is
* kept in the order in which sections have been entered, but elements may
* be removed in the middle if an argument is given to the leave_subsection()
* function.
*/
std::list<std::string> active_sections;
/**
* mpi communicator
*/
MPI_Comm mpi_communicator;
/**
* A lock that makes sure that this class gives reasonable results even when
* used with several threads.
*/
Threads::Mutex mutex;
};
/* ---------------- inline functions ----------------- */
inline void
Timer::restart()
{
reset();
start();
}
inline const Utilities::MPI::MinMaxAvg &
Timer::get_last_lap_wall_time_data() const
{
return last_lap_wall_time_data;
}
inline const Utilities::MPI::MinMaxAvg &
Timer::get_accumulated_wall_time_data() const
{
return accumulated_wall_time_data;
}
template <typename StreamType>
inline void
Timer::print_last_lap_wall_time_data(StreamType &stream) const
{
const Utilities::MPI::MinMaxAvg &statistic = get_last_lap_wall_time_data();
stream << statistic.max << " wall,"
<< " max @" << statistic.max_index << ", min=" << statistic.min << " @"
<< statistic.min_index << ", avg=" << statistic.avg << std::endl;
}
template <typename StreamType>
inline void
Timer::print_accumulated_wall_time_data(StreamType &stream) const
{
const Utilities::MPI::MinMaxAvg &statistic = get_accumulated_wall_time_data();
stream << statistic.max << " wall,"
<< " max @" << statistic.max_index << ", min=" << statistic.min << " @"
<< statistic.min_index << ", avg=" << statistic.avg << std::endl;
}
inline TimerOutput::Scope::Scope(dealii::TimerOutput &timer_,
const std::string §ion_name_)
: timer(timer_)
, section_name(section_name_)
, in(true)
{
timer.enter_subsection(section_name);
}
inline void
TimerOutput::Scope::stop()
{
if (!in)
return;
in = false;
timer.leave_subsection(section_name);
}
DEAL_II_NAMESPACE_CLOSE
#endif
|