3 |
import java.util.Map; |
import java.util.Map; |
4 |
import java.util.Queue; |
import java.util.Queue; |
5 |
import java.util.concurrent.ConcurrentHashMap; |
import java.util.concurrent.ConcurrentHashMap; |
6 |
|
import java.util.concurrent.CyclicBarrier; |
7 |
|
import java.util.concurrent.ThreadPoolExecutor; |
8 |
import java.util.logging.Level; |
import java.util.logging.Level; |
9 |
import java.util.logging.Logger; |
import java.util.logging.Logger; |
10 |
|
|
24 |
|
|
25 |
Map<Integer, LookupWorker> workers = new ConcurrentHashMap<Integer, LookupWorker>(); |
Map<Integer, LookupWorker> workers = new ConcurrentHashMap<Integer, LookupWorker>(); |
26 |
|
|
27 |
|
ThreadPoolExecutor threadPool; |
28 |
|
|
29 |
|
CyclicBarrier barrier; |
30 |
|
|
31 |
|
|
32 |
|
|
33 |
public Lookup(String postnr, Database db) { |
public Lookup(String postnr, Database db, ThreadPoolExecutor threadPool) { |
34 |
this.postnr = postnr; |
this.postnr = postnr; |
35 |
this.db = db; |
this.db = db; |
36 |
|
this.threadPool = threadPool; |
37 |
} |
} |
38 |
|
|
39 |
|
|
46 |
long start1 = System.currentTimeMillis(); |
long start1 = System.currentTimeMillis(); |
47 |
long start2 = 0; |
long start2 = 0; |
48 |
|
|
49 |
|
barrier = new CyclicBarrier(LookupMain.max_workers + 1); |
50 |
|
|
51 |
try { |
try { |
52 |
|
|
53 |
logger.info("Henter _ikke_ daekkede adresser i " + postnr); |
logger.info("Henter _ikke_ daekkede adresser i " + postnr); |
65 |
logger.info("Bbox Adjusted=" + bbox); |
logger.info("Bbox Adjusted=" + bbox); |
66 |
|
|
67 |
logger.info("Henter daekkede adresser i " + postnr); |
logger.info("Henter daekkede adresser i " + postnr); |
68 |
daekkedeAdresser = db.hentDaekkedeAdresser(bbox); |
daekkedeAdresser = db.hentDaekkedeAdresserCache(bbox); |
69 |
|
|
70 |
|
|
71 |
stat.postnr = postnr; |
stat.postnr = postnr; |
72 |
stat.antalDaekkede = daekkedeAdresser.length; |
stat.antalDaekkede = daekkedeAdresser.length; |
78 |
start2 = System.currentTimeMillis(); |
start2 = System.currentTimeMillis(); |
79 |
|
|
80 |
for (int i =0; i < LookupMain.max_workers; i++) { |
for (int i =0; i < LookupMain.max_workers; i++) { |
81 |
LookupWorker worker = new LookupWorker(i, this); |
LookupWorker worker = new LookupWorker(i, this, barrier); |
82 |
Thread t = new Thread(worker); |
threadPool.submit(worker); |
|
t.start(); |
|
|
|
|
|
workers.put(i, worker); |
|
83 |
} |
} |
84 |
|
|
85 |
while (workers.size() > 0) { |
barrier.await(); |
|
Thread.sleep(10);//wait for worker threads |
|
|
} |
|
86 |
|
|
87 |
db.saveBatch();//Save any unsaved rows |
db.saveBatch();//Save any unsaved rows |
88 |
|
|
105 |
logger.info("Done! elapsed=" + (now-start1) + "/" + (now-start2) + " postnr=" + postnr); |
logger.info("Done! elapsed=" + (now-start1) + "/" + (now-start2) + " postnr=" + postnr); |
106 |
} |
} |
107 |
|
|
|
public void shutdownWorker(int workerid) { |
|
|
//logger.info("Shutting down worker: " + workerid); |
|
|
LookupWorker key = workers.remove(workerid); |
|
|
|
|
|
if (key == null) { |
|
|
System.out.println("Error removing worker from set " + workerid); |
|
|
System.exit(0); |
|
|
} |
|
|
} |
|
108 |
|
|
109 |
// Getters and setters |
// Getters and setters |
110 |
|
|