Package org.encog.util.concurrency

Examples of org.encog.util.concurrency.TaskGroup

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
    int offspringIndex = getPopulation().getPopulationSize()
        - offspringCount;
    final int matingPopulationSize = (int) (getPopulation()
        .getPopulationSize() * getMatingPopulation());

    final TaskGroup group = EngineConcurrency.getInstance()
        .createTaskGroup();

    // mate and form the next generation
    for (int i = 0; i < countToMate; i++) {
      final Genome mother = getPopulation().getGenomes().get(i);
      final int fatherInt = (int) (Math.random() * matingPopulationSize);
      final Genome father = getPopulation().getGenomes().get(fatherInt);
      final Genome child1 = getPopulation().getGenomes().get(
          offspringIndex);
      final Genome child2 = getPopulation().getGenomes().get(
          offspringIndex + 1);

      final MateWorker worker = new MateWorker(mother, father, child1,
          child2);

      if( this.isMultiThreaded() ) {
        EngineConcurrency.getInstance().processTask(worker, group);
      } else {
        worker.run();
      }
     
      offspringIndex += 2;
    }

    if( this.isMultiThreaded() ) {
      group.waitForComplete();
    }

    // sort the next generation
    getPopulation().sort();
  }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
    Object task;

    this.running = true;
    this.totalTasks = loadWorkload();
    int currentTask = 0;
    TaskGroup group = EngineConcurrency.getInstance().createTaskGroup();

    while (((task = requestNextTask()) != null) && !shouldStop) {
      currentTask++;
      final JobUnitContext context = new JobUnitContext();
      context.setJobUnit(task);
      context.setOwner(this);
      context.setTaskNumber(currentTask);

      final JobUnitWorker worker = new JobUnitWorker(context);
      EngineConcurrency.getInstance().processTask(worker, group);
    }

    group.waitForComplete();
    this.running = false;
    EngineConcurrency.getInstance().checkError();   
  }
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
    this.totalError = 0;

    if (this.workers.length > 1) {

      final TaskGroup group = EngineConcurrency.getInstance()
          .createTaskGroup();

      for (final GradientWorker worker : this.workers) {
        EngineConcurrency.getInstance().processTask(worker, group);
      }

      group.waitForComplete();
    } else {
      this.workers[0].run();
    }

    this.currentError = this.totalError / this.workers.length;
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
        this.workers[0].getNetwork().clearContext();
      }

      if (this.workers.length > 1) {

        final TaskGroup group = EngineConcurrency.getInstance()
            .createTaskGroup();

        for (final ChainRuleWorker worker : this.workers) {
          worker.setOutputNeuron(outputNeuron);
          EngineConcurrency.getInstance().processTask(worker, group);
        }

        group.waitForComplete();
      } else {
        this.workers[0].setOutputNeuron(outputNeuron);
        this.workers[0].run();
      }
     
View Full Code Here
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
    this.totalError = 0;

    if (this.workers.length > 1) {

      final TaskGroup group = EngineConcurrency.getInstance()
          .createTaskGroup();

      for (final GradientWorker worker : this.workers) {
        EngineConcurrency.getInstance().processTask(worker, group);
      }

      group.waitForComplete();
    } else {
      this.workers[0].run();
    }

    this.setError(this.totalError / this.workers.length);
View Full Code Here
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
     * Internal method for the iteration of the swarm.
     *
     * @param init  true if this is an initialisation iteration.
     */
    protected void iterationPSO(boolean init) {
        final TaskGroup group = EngineConcurrency.getInstance().createTaskGroup();

        for (int i = 0; i < m_populationSize; i++) {
            NeuralPSOWorker worker = new NeuralPSOWorker(this, i, init);
            if (!init && this.isMultiThreaded()) {
                EngineConcurrency.getInstance().processTask(worker, group);
            } else {
                worker.run();
            }
        }
        if (this.isMultiThreaded()) {
            group.waitForComplete();
        }
        updateGlobalBestPosition();
    }
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
    EngineConcurrency.getInstance().setThreadCount(this.threadCount);

    this.running = true;
    this.totalTasks = loadWorkload();
    int currentTask = 0;
    TaskGroup group = EngineConcurrency.getInstance().createTaskGroup();

    while (((task = requestNextTask()) != null) && !shouldStop) {
      currentTask++;
      final JobUnitContext context = new JobUnitContext();
      context.setJobUnit(task);
      context.setOwner(this);
      context.setTaskNumber(currentTask);

      final JobUnitWorker worker = new JobUnitWorker(context);
      EngineConcurrency.getInstance().processTask(worker, group);
    }

    group.waitForComplete();
    this.running = false;
    EngineConcurrency.getInstance().checkError();   
  }
View Full Code Here
TOP

Related Classes of org.encog.util.concurrency.TaskGroup

  • org.encog.EncogError
  • org.encog.mathutil.matrices.hessian.HessianCR
  • org.encog.ml.genetic.BasicGeneticAlgorithm
  • org.encog.neural.flat.train.prop.TrainFlatNetworkProp
  • org.encog.neural.networks.training.propagation.Propagation
  • org.encog.neural.networks.training.pso.NeuralPSO
  • org.encog.util.concurrency.job.ConcurrentJob
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.