2010-10-08 16:15:50 +02:00
|
|
|
function [nCPU, totCPU, nBlockPerCPU, totSLAVES] = distributeJobs(Parallel, fBlock, nBlock)
|
2010-05-31 11:24:55 +02:00
|
|
|
% PARALLEL CONTEXT
|
|
|
|
% In parallel context this function is used to determine the total number of available CPUs,
|
|
|
|
% and the number of threads to run on each CPU.
|
|
|
|
%
|
|
|
|
% INPUTS
|
|
|
|
% o Parallel [struct vector] copy of options_.parallel
|
2010-09-06 16:59:57 +02:00
|
|
|
% o fBlock [int] index number of the first job (e.g. MC iteration or MH block)
|
2010-05-31 11:24:55 +02:00
|
|
|
% (between 1 and nBlock)
|
2010-09-06 16:59:57 +02:00
|
|
|
% o nBlock [int] index number of the last job.
|
2010-05-31 11:24:55 +02:00
|
|
|
%
|
|
|
|
% OUTPUT
|
|
|
|
% o nBlockPerCPU [int vector] for each CPU used, indicates the number of
|
|
|
|
% threads run on that CPU
|
|
|
|
% o totCPU [int] total number of CPU used (can be lower than
|
|
|
|
% the number of CPU declared in "Parallel", if
|
2010-10-22 11:27:26 +02:00
|
|
|
% the number of required threads is lower!)
|
|
|
|
% o nCPU the number of CPU in user format.
|
2010-02-15 16:52:36 +01:00
|
|
|
|
|
|
|
% Copyright (C) 2010 Dynare Team
|
|
|
|
%
|
|
|
|
% This file is part of Dynare.
|
|
|
|
%
|
|
|
|
% Dynare 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.
|
|
|
|
%
|
|
|
|
% Dynare 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 Dynare. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
totCPU=0;
|
|
|
|
for j=1:length(Parallel),
|
2010-10-22 11:27:26 +02:00
|
|
|
nCPU(j)=length(Parallel(j).CPUnbr);
|
2010-02-15 16:52:36 +01:00
|
|
|
totCPU=totCPU+nCPU(j);
|
|
|
|
end
|
|
|
|
|
|
|
|
nCPU=cumsum(nCPU);
|
|
|
|
offset0 = fBlock-1;
|
|
|
|
if (nBlock-offset0)>totCPU,
|
|
|
|
diff = mod((nBlock-offset0),totCPU);
|
|
|
|
nBlockPerCPU(1:diff) = ceil((nBlock-offset0)/totCPU);
|
|
|
|
nBlockPerCPU(diff+1:totCPU) = floor((nBlock-offset0)/totCPU);
|
2010-10-08 16:15:50 +02:00
|
|
|
totSLAVES=length(Parallel);
|
2010-02-15 16:52:36 +01:00
|
|
|
else
|
|
|
|
nBlockPerCPU(1:nBlock-offset0)=1;
|
|
|
|
totCPU = nBlock-offset0;
|
2010-10-08 16:15:50 +02:00
|
|
|
totSLAVES = min(find(cumsum(nCPU)>=totCPU));
|
2010-02-15 16:52:36 +01:00
|
|
|
end
|