1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 | *
|
---|
5 | * This file is part of HeuristicLab.
|
---|
6 | *
|
---|
7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
8 | * it under the terms of the GNU General Public License as published by
|
---|
9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
10 | * (at your option) any later version.
|
---|
11 | *
|
---|
12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
15 | * GNU General Public License for more details.
|
---|
16 | *
|
---|
17 | * You should have received a copy of the GNU General Public License
|
---|
18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
19 | */
|
---|
20 | #endregion
|
---|
21 |
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Operators;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 | using HeuristicLab.Operators.MPISupport.BinaryTransport;
|
---|
29 | using System.Collections.Generic;
|
---|
30 | using MPI;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Operators.MPISupport {
|
---|
33 | [Item("MPISolutionsCreator", "An operator which creates new solutions in parallel using MPI.")]
|
---|
34 | [StorableClass]
|
---|
35 | public sealed class MPISolutionsCreator : SingleSuccessorOperator {
|
---|
36 | public ValueLookupParameter<IntValue> NumberOfSolutionsParameter {
|
---|
37 | get { return (ValueLookupParameter<IntValue>)Parameters["NumberOfSolutions"]; }
|
---|
38 | }
|
---|
39 | public ValueLookupParameter<IOperator> SolutionCreatorParameter {
|
---|
40 | get { return (ValueLookupParameter<IOperator>)Parameters["SolutionCreator"]; }
|
---|
41 | }
|
---|
42 | public ValueLookupParameter<IOperator> EvaluatorParameter {
|
---|
43 | get { return (ValueLookupParameter<IOperator>)Parameters["Evaluator"]; }
|
---|
44 | }
|
---|
45 | public ValueLookupParameter<BoolValue> ParallelParameter {
|
---|
46 | get { return (ValueLookupParameter<BoolValue>)Parameters["Parallel"]; }
|
---|
47 | }
|
---|
48 | private ScopeParameter CurrentScopeParameter {
|
---|
49 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
---|
50 | }
|
---|
51 | public IScope CurrentScope {
|
---|
52 | get { return CurrentScopeParameter.ActualValue; }
|
---|
53 | }
|
---|
54 | public IntValue NumberOfSolutions {
|
---|
55 | get { return NumberOfSolutionsParameter.Value; }
|
---|
56 | set { NumberOfSolutionsParameter.Value = value; }
|
---|
57 | }
|
---|
58 |
|
---|
59 | [StorableConstructor]
|
---|
60 | private MPISolutionsCreator(bool deserializing) : base(deserializing) { }
|
---|
61 | private MPISolutionsCreator(MPISolutionsCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
62 | public MPISolutionsCreator()
|
---|
63 | : base() {
|
---|
64 | Parameters.Add(new ValueLookupParameter<IntValue>("NumberOfSolutions", "The number of solutions that should be created."));
|
---|
65 | Parameters.Add(new ValueLookupParameter<IOperator>("SolutionCreator", "The operator which is used to create new solutions."));
|
---|
66 | Parameters.Add(new ValueLookupParameter<IOperator>("Evaluator", "The operator which is used to evaluate new solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
|
---|
67 | Parameters.Add(new ValueLookupParameter<BoolValue>("Parallel", "True if the operator should be applied in parallel on all sub-scopes, otherwise false.", new BoolValue(true)));
|
---|
68 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope to which the new solutions are added as sub-scopes."));
|
---|
69 | }
|
---|
70 | [StorableHook(HookType.AfterDeserialization)]
|
---|
71 | private void AfterDeserialization() {
|
---|
72 | if (!Parameters.ContainsKey("Parallel")) Parameters.Add(new ValueLookupParameter<BoolValue>("Parallel", "True if the operator should be applied in parallel on all sub-scopes, otherwise false.", new BoolValue(true))); // backwards compatibility
|
---|
73 | }
|
---|
74 |
|
---|
75 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
76 | return new MPISolutionsCreator(this, cloner);
|
---|
77 | }
|
---|
78 |
|
---|
79 | public override IOperation Apply() {
|
---|
80 | int scopeCount = NumberOfSolutionsParameter.ActualValue.Value;
|
---|
81 | IOperator creator = SolutionCreatorParameter.ActualValue;
|
---|
82 | IOperator evaluator = EvaluatorParameter.ActualValue;
|
---|
83 | bool parallel = ParallelParameter.ActualValue.Value;
|
---|
84 |
|
---|
85 | int current = CurrentScope.SubScopes.Count;
|
---|
86 | for (int i = 0; i < scopeCount; i++)
|
---|
87 | CurrentScope.SubScopes.Add(new Scope((current + i).ToString()));
|
---|
88 | ScopeList scopes = CurrentScope.SubScopes;
|
---|
89 |
|
---|
90 | OperationCollection next = new OperationCollection();
|
---|
91 | if (MPI.Communicator.world != null && MPI.Communicator.world.Size > 2) {
|
---|
92 | int rank = MPI.Communicator.world.Rank;
|
---|
93 | int size = MPI.Communicator.world.Size - 1;
|
---|
94 |
|
---|
95 | int count = scopes.Count / size;
|
---|
96 | int start = count * (rank - 1);
|
---|
97 | int end = (rank == size ? scopes.Count : start + count);
|
---|
98 |
|
---|
99 | List<Request> requests = new List<Request>();
|
---|
100 | IScope parent = new Scope();
|
---|
101 |
|
---|
102 | for (int i = start; i < end; i++) {
|
---|
103 | if (creator != null) {
|
---|
104 | IAtomicOperation op = ExecutionContext.CreateOperation(creator, scopes[i]);
|
---|
105 | MPIHelper.Execute(op, CancellationToken);
|
---|
106 | }
|
---|
107 |
|
---|
108 | if (evaluator != null) {
|
---|
109 | IAtomicOperation op = ExecutionContext.CreateOperation(evaluator, scopes[i]);
|
---|
110 | MPIHelper.Execute(op, CancellationToken);
|
---|
111 | }
|
---|
112 |
|
---|
113 | //SEND results to other clients
|
---|
114 | parent.SubScopes.Add(MPIHelper.ShallowCopy(scopes[i]));
|
---|
115 | }
|
---|
116 |
|
---|
117 | for (int dest = 1; dest <= size; dest++) {
|
---|
118 | if (dest != rank) {
|
---|
119 | var result = new MPIBinaryTransportWrapper(parent);
|
---|
120 | requests.Add(MPI.Communicator.world.ImmediateSend<MPIBinaryTransportWrapper>(result, dest, 0));
|
---|
121 | }
|
---|
122 | }
|
---|
123 |
|
---|
124 | IExecutionContext globalScope = ExecutionContext;
|
---|
125 | while (globalScope.Parent != null) {
|
---|
126 | globalScope = globalScope.Parent;
|
---|
127 | }
|
---|
128 |
|
---|
129 | //RECEIVE results from other clients
|
---|
130 | for (int source = 1; source <= size; source++) {
|
---|
131 | if (source != rank) {
|
---|
132 | var result = MPI.Communicator.world.Receive<MPIBinaryTransportWrapper>(source, 0).GetInnerItem(globalScope) as IScope;
|
---|
133 |
|
---|
134 | int offset = count * (source - 1);
|
---|
135 | for (int scopeIndex = 0; scopeIndex < result.SubScopes.Count; scopeIndex++) {
|
---|
136 | scopes[scopeIndex + offset] = result.SubScopes[scopeIndex];
|
---|
137 | }
|
---|
138 | }
|
---|
139 | }
|
---|
140 |
|
---|
141 | foreach (Request request in requests) {
|
---|
142 | request.Wait();
|
---|
143 | }
|
---|
144 | } else {
|
---|
145 | OperationCollection creation = new OperationCollection();
|
---|
146 | OperationCollection evaluation = new OperationCollection() { Parallel = parallel };
|
---|
147 | for (int i = 0; i < scopeCount; i++) {
|
---|
148 | if (creator != null) creation.Add(ExecutionContext.CreateOperation(creator, CurrentScope.SubScopes[current + i]));
|
---|
149 | if (evaluator != null) evaluation.Add(ExecutionContext.CreateOperation(evaluator, CurrentScope.SubScopes[current + i]));
|
---|
150 | }
|
---|
151 |
|
---|
152 | next.Add(creation);
|
---|
153 | next.Add(evaluation);
|
---|
154 | }
|
---|
155 | next.Add(base.Apply());
|
---|
156 | return next;
|
---|
157 | }
|
---|
158 | }
|
---|
159 | }
|
---|