Line data Source code
1 : /*
2 : * Copyright (c) 2011-2015: G-CSC, Goethe University Frankfurt
3 : * Author: Markus Breit
4 : *
5 : * This file is part of UG4.
6 : *
7 : * UG4 is free software: you can redistribute it and/or modify it under the
8 : * terms of the GNU Lesser General Public License version 3 (as published by the
9 : * Free Software Foundation) with the following additional attribution
10 : * requirements (according to LGPL/GPL v3 §7):
11 : *
12 : * (1) The following notice must be displayed in the Appropriate Legal Notices
13 : * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
14 : *
15 : * (2) The following notice must be displayed at a prominent place in the
16 : * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
17 : *
18 : * (3) The following bibliography is recommended for citation and must be
19 : * preserved in all covered files:
20 : * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
21 : * parallel geometric multigrid solver on hierarchically distributed grids.
22 : * Computing and visualization in science 16, 4 (2013), 151-164"
23 : * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
24 : * flexible software system for simulating pde based models on high performance
25 : * computers. Computing and visualization in science 16, 4 (2013), 165-179"
26 : *
27 : * This program is distributed in the hope that it will be useful,
28 : * but WITHOUT ANY WARRANTY; without even the implied warranty of
29 : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
30 : * GNU Lesser General Public License for more details.
31 : */
32 :
33 : #include "mem_info.h"
34 :
35 : #ifdef UG_PARALLEL
36 : #include "pcl/pcl_base.h" // for NumProcs
37 : #include "pcl/pcl_process_communicator.h" // for NumProcs
38 : #endif
39 :
40 : namespace ug {
41 :
42 :
43 0 : void MemInfo::communicate_process_values()
44 : {
45 : #ifdef UG_PARALLEL
46 : if (pcl::NumProcs() > 1)
47 : {
48 : pcl::ProcessCommunicator pc;
49 : pc.allreduce(&m_locRes, &m_gloRes, 1, PCL_RO_SUM);
50 : pc.allreduce(&m_locVirt, &m_gloVirt, 1, PCL_RO_SUM);
51 : pc.allreduce(&m_locRes, &m_maxRes, 1, PCL_RO_MAX);
52 : pc.allreduce(&m_locVirt, &m_maxVirt, 1, PCL_RO_MAX);
53 : return;
54 : }
55 : #endif
56 :
57 0 : m_gloRes = m_locRes;
58 0 : m_gloVirt = m_locVirt;
59 0 : m_maxRes = m_locRes;
60 0 : m_maxVirt = m_locVirt;
61 0 : }
62 :
63 0 : number MemInfo::local_resident_memory() const
64 : {
65 0 : return m_locRes;
66 : }
67 :
68 0 : number MemInfo::local_virtual_memory() const
69 : {
70 0 : return m_locVirt;
71 : }
72 :
73 0 : number MemInfo::global_resident_memory() const
74 : {
75 0 : return m_gloRes;
76 : }
77 :
78 0 : number MemInfo::global_virtual_memory() const
79 : {
80 0 : return m_gloVirt;
81 : }
82 :
83 0 : number MemInfo::max_resident_memory() const
84 : {
85 0 : return m_maxRes;
86 : }
87 :
88 0 : number MemInfo::max_virtual_memory() const
89 : {
90 0 : return m_maxVirt;
91 : }
92 :
93 :
94 : } // namespace ug
|