This repository has been archived by the owner on Jun 23, 2020. It is now read-only.
/
ParallelECF.java
77 lines (63 loc) · 2.28 KB
/
ParallelECF.java
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
/*
* Copyright (c) 2016.
*
* This file 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.
*
* This file 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 this file. If not, see <http://www.gnu.org/licenses/>.
*/
package drones;
import java.io.BufferedWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.*;
/**
* Parallelizes the core loop of EarliestCompletionFirst. Otherwise identical; should output the same schedule.
* @author Raphael Reitzig <reitzig@cs.uni-kl.de>
*/
public class ParallelECF extends EarliestCompletionFirst {
private ThreadPoolExecutor exec;
public ParallelECF(World world) {
super(world);
}
public ParallelECF(World world, boolean silent) {
super(world, silent);
}
@Override
OrderSchedule nextOrder() throws CloneNotSupportedException, ExecutionException, InterruptedException {
final Map<Order, Future<OrderSchedule>> bestSchedules = new HashMap<>();
for (final Order order : world.ordersById.values()) {
final RunnableFuture<OrderSchedule> fut = new FutureTask<>(new Callable<OrderSchedule>() {
@Override
public OrderSchedule call() throws Exception {
return fastestSolution(order);
}
});
bestSchedules.put(order, fut);
exec.execute(fut);
}
OrderSchedule min = new OrderSchedule(Integer.MAX_VALUE, -1);
for ( final Future<OrderSchedule> osfut : bestSchedules.values() ) {
if ( osfut.get().completionTime < min.completionTime) {
min = osfut.get();
}
}
return min;
}
@Override
public void computeSchedule(BufferedWriter out) throws Exception {
exec = new ThreadPoolExecutor(Runtime.getRuntime().availableProcessors(), Runtime.getRuntime().availableProcessors(),
1, TimeUnit.SECONDS, new ArrayBlockingQueue<Runnable>(world.ordersById.size()));
exec.prestartAllCoreThreads();
super.computeSchedule(out);
exec.shutdownNow();
}
}