File size: 8,197 Bytes
5a600cf | 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 | /*---------------------------------------------------------------------------*\
========= |
\\ / F ield | OpenFOAM: The Open Source CFD Toolbox
\\ / O peration | Website: https://openfoam.org
\\ / A nd | Copyright (C) 2011-2022 OpenFOAM Foundation
\\/ M anipulation |
-------------------------------------------------------------------------------
License
This file is part of OpenFOAM.
OpenFOAM is free software: you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
\*---------------------------------------------------------------------------*/
#include "commSchedule.H"
#include "SortableList.H"
#include "boolList.H"
#include "IOstreams.H"
#include "IOmanip.H"
#include "OStringStream.H"
#include "Pstream.H"
// * * * * * * * * * * * * * * Static Data Members * * * * * * * * * * * * * //
namespace Foam
{
defineTypeNameAndDebug(commSchedule, 0);
}
// * * * * * * * * * * * * * Private Member Functions * * * * * * * * * * * //
Foam::label Foam::commSchedule::outstandingComms
(
const labelList& commToSchedule,
DynamicList<label>& procComms
) const
{
label nOutstanding = 0;
forAll(procComms, i)
{
if (commToSchedule[procComms[i]] == -1)
{
nOutstanding++;
}
}
return nOutstanding;
}
// * * * * * * * * * * * * * * * * Constructors * * * * * * * * * * * * * * //
Foam::commSchedule::commSchedule
(
const label nProcs,
const List<labelPair>& comms
)
:
schedule_(comms.size()),
procSchedule_(nProcs)
{
// Determine comms per processor.
List<DynamicList<label>> procToComms(nProcs);
forAll(comms, commI)
{
label proc0 = comms[commI][0];
label proc1 = comms[commI][1];
if (proc0 < 0 || proc0 >= nProcs || proc1 < 0 || proc1 >= nProcs)
{
FatalErrorInFunction
<< "Illegal processor " << comms[commI] << abort(FatalError);
}
procToComms[proc0].append(commI);
procToComms[proc1].append(commI);
}
// Note: no need to shrink procToComms. Are small.
if (debug && Pstream::master())
{
Pout<< "commSchedule::commSchedule : Wanted communication:" << endl;
forAll(comms, i)
{
const labelPair& twoProcs = comms[i];
Pout<< i << ": "
<< twoProcs[0] << " with " << twoProcs[1] << endl;
}
Pout<< endl;
Pout<< "commSchedule::commSchedule : Schedule:" << endl;
// Print header. Use buffered output to prevent parallel output messing
// up.
{
OStringStream os;
os << "iter|";
for (int i = 0; i < nProcs; i++)
{
os << setw(3) << i;
}
Pout<< os.str().c_str() << endl;
}
{
OStringStream os;
os << "----+";
for (int i = 0; i < nProcs; i++)
{
os << "---";
}
Pout<< os.str().c_str() << endl;
}
}
// Schedule all. Note: crap scheduler. Assumes all communication takes
// equally long.
label nScheduled = 0;
label iter = 0;
// Per index into comms the time when it was scheduled
labelList commToSchedule(comms.size(), -1);
while (nScheduled < comms.size())
{
label oldNScheduled = nScheduled;
// Find unscheduled comms. This is the comms where the two processors
// still have the most unscheduled comms.
boolList busy(nProcs, false);
while (true)
{
label maxCommI = -1;
label maxNeed = labelMin;
forAll(comms, commI)
{
label proc0 = comms[commI][0];
label proc1 = comms[commI][1];
if
(
commToSchedule[commI] == -1 // unscheduled
&& !busy[proc0]
&& !busy[proc1]
)
{
label need =
outstandingComms(commToSchedule, procToComms[proc0])
+ outstandingComms(commToSchedule, procToComms[proc1]);
if (need > maxNeed)
{
maxNeed = need;
maxCommI = commI;
}
}
}
if (maxCommI == -1)
{
// Found no unscheduled procs.
break;
}
// Schedule commI in this iteration
commToSchedule[maxCommI] = nScheduled++;
busy[comms[maxCommI][0]] = true;
busy[comms[maxCommI][1]] = true;
}
if (debug && Pstream::master())
{
label nIterComms = nScheduled-oldNScheduled;
if (nIterComms > 0)
{
labelList procToComm(nProcs, -1);
forAll(commToSchedule, commI)
{
label sched = commToSchedule[commI];
if (sched >= oldNScheduled && sched < nScheduled)
{
label proc0 = comms[commI][0];
procToComm[proc0] = commI;
label proc1 = comms[commI][1];
procToComm[proc1] = commI;
}
}
// Print it
OStringStream os;
os << setw(3) << iter << " |";
forAll(procToComm, proci)
{
if (procToComm[proci] == -1)
{
os << " ";
}
else
{
os << setw(3) << procToComm[proci];
}
}
Pout<< os.str().c_str() << endl;
}
}
iter++;
}
if (debug && Pstream::master())
{
Pout<< endl;
}
// Sort commToSchedule and obtain order in comms
schedule_ = SortableList<label>(commToSchedule).indices();
// Sort schedule_ by processor
labelList nProcScheduled(nProcs, 0);
// Count
forAll(schedule_, i)
{
label commI = schedule_[i];
const labelPair& twoProcs = comms[commI];
nProcScheduled[twoProcs[0]]++;
nProcScheduled[twoProcs[1]]++;
}
// Allocate
forAll(procSchedule_, proci)
{
procSchedule_[proci].setSize(nProcScheduled[proci]);
}
nProcScheduled = 0;
// Fill
forAll(schedule_, i)
{
label commI = schedule_[i];
const labelPair& twoProcs = comms[commI];
label proc0 = twoProcs[0];
procSchedule_[proc0][nProcScheduled[proc0]++] = commI;
label proc1 = twoProcs[1];
procSchedule_[proc1][nProcScheduled[proc1]++] = commI;
}
if (debug && Pstream::master())
{
Pout<< "commSchedule::commSchedule : Per processor:" << endl;
forAll(procSchedule_, proci)
{
const labelList& procComms = procSchedule_[proci];
Pout<< "Processor " << proci << " talks to processors:" << endl;
forAll(procComms, i)
{
const labelPair& twoProcs = comms[procComms[i]];
label nbr = (twoProcs[1] == proci ? twoProcs[0] : twoProcs[1]);
Pout<< " " << nbr << endl;
}
}
Pout<< endl;
}
}
// ************************************************************************* //
|