adressevedligehold/afstandandenrute/AfstandAndenRuteTask.java

package dk.daoas.adressevedligehold.afstandandenrute;

import java.sql.Connection;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Set;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.Executors;
import java.util.concurrent.ThreadFactory;
import java.util.concurrent.ThreadPoolExecutor;
import java.util.concurrent.atomic.AtomicInteger;

import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
import dk.daoas.adressevedligehold.ReloadHelper;
import dk.daoas.adressevedligehold.ServiceConfig;
import dk.daoas.adressevedligehold.beans.Address;
import dk.daoas.adressevedligehold.db.DBConnection;
import dk.daoas.adressevedligehold.tasks.Task;
import dk.daoas.adressevedligehold.tasks.TaskLogger;


public class AfstandAndenRuteTask extends Task {
        

        private TaskLogger logger = TaskLogger.getInstance();

        final static boolean VERBOSE = false;//
        
        public final static String INCREMENTAL = "INCREMENTAL";
        public final static String FULL = "FULL";


        static boolean test_mode;


        String distributor;
        int antalIkkeDaekkede = -1;
        
        AtomicInteger antalBeregnet = new AtomicInteger();


        ThreadPoolExecutor threadPool;

        boolean isIncremental;


        public AfstandAndenRuteTask(String distributor, String type) {
                this.distributor = distributor;
                
                type = type.toUpperCase();
                switch(type) {
                case FULL:
                        isIncremental = false;
                        break;
                case INCREMENTAL:
                        isIncremental = true;
                        break;
                default:
                        throw new RuntimeException("Unknown type" + type);                      
                }
        }


        @Override
        protected void taskRun() throws Exception {
                

                Constants.init(distributor);
                Constants consts = Constants.getInstance();

                int max_workers = ServiceConfig.getInstance().maxWorkers;        
                if (max_workers <= 0) {  
                        logger.info("!!! AUTO-DETECT MAX_WORKERS !!!");  
                        int cores = Runtime.getRuntime().availableProcessors();  
                        cores -= 1;//Efterlad 1 core/cpu i reserve til systemet  

                        max_workers = Math.max(1, cores); //Dog skal der som minimum være 1 core til beregning  

                }        
                if (test_mode) {
                        max_workers = 1;
                }
                logger.info("Starting with MAX_WORKERS:" + max_workers);         
                setupThreadPool(max_workers);
                
                logger.info("Starting with INCREMENTAL:" + isIncremental);


                try (Connection conn = DBConnection.getConnection() ) {
                        DatabaseRouteDistance db = new DatabaseRouteDistance(conn, isIncremental);
                        
                        db.prepareIncrementalSearch();

                        Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
                        antalIkkeDaekkede = ikkeDaekkede.size();
                        logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );


                        boolean testRun= false;

                        AtomicInteger antalFundne = new AtomicInteger(0);

                        long beregnStart =0;
                        long start = System.currentTimeMillis();
                        int antalDaekkedeAdresser = -1;

                        if (testRun == false) {

                                logger.info("Finder postnumre");
                                Set<Short> postnumre = db.hentPostnumreCache();

                                // Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
                                for(short postnr : postnumre) { //
                                        logger.info("Validerer BBox for " + postnr);
                                        BoundingBox bbox = db.getBoundingbox(postnr);
                                        bbox.validateBbox();
                                }


                                logger.info("Henter alle daekkede adresser");
                                antalDaekkedeAdresser = db.hentAlleDaekkedeAdresser(distributor);
                                logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );

                                Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO();

                                Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>();

                                for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) {
                                        short ho = entry.getKey();
                                        List<Address> geopoints = entry.getValue();

                                        logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );

                                        int bucketSize = 96*12;

                                        KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize );
                                        for(Address a: geopoints) {
                                                addressTree.addPoint(a.xyz, a);
                                        }

                                        hoTrees.put(ho, addressTree);                           
                                }

                                db.resetResultTable();

                                beregnStart = System.currentTimeMillis();
                                logger.info("Starter beregning");

                                //pre-check er ok - reset tmp tabel og start søgningen

                                CyclicBarrier barrier = new CyclicBarrier(max_workers + 1);

                                for (int i=0; i<max_workers; i++) {
                                        LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,VERBOSE,consts);
                                        threadPool.submit( worker );
                                }

                                barrier.await(); // Afvent at workerne bliver færdige

                                logger.info("Calc is done - cleaning up remaining bits");

                                threadPool.shutdown(); //Calc is done now


                                db.saveBatch();

                                if (test_mode == false && this.isAborted() == false) {
                                        db.renameResultTables();
                                        
                                        ReloadHelper.triggerReload( "AfstandAndenRute/" + distributor );


                                } else {
                                        logger.info( "Rename tables is disabled !!!" );
                                }


                        } /*else {
                                /// Test
                                
                                db.resetResultTable();


                                alleDaekkedeAdresser = db.hentAlleDaekkedeAdresser();
                                logger.info( "AlleDaekkedeAdresser.length=" + alleDaekkedeAdresser.size());

                                short post = (short) 2700;                      
                                Lookup lookup = new Lookup(post, db, threadPool);
                                lookup.doLookup();                                                              
                        } */


                        long now = System.currentTimeMillis();
                        long elapsed = now - start ;
                        long elapsedBeregn = now - beregnStart;


                        logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
                        logger.info("Fuld load done (beregning) : " + formatMilliSeconds(elapsedBeregn) );
                        logger.info("Antal daekkede : " + antalDaekkedeAdresser );
                        logger.info("Antal ikke-daekkede : " + antalIkkeDaekkede );
                        logger.info("Heraf, antal fundne : " + antalFundne );

                        logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) );
                }
        }


        static String formatMilliSeconds(long milliseconds) {
                int mseconds = (int) milliseconds % 1000;
                int seconds = (int) (milliseconds / 1000) % 60 ;
                int minutes = (int) ((milliseconds / (1000*60)) % 60);
                int hours   = (int) ((milliseconds / (1000*60*60)) % 24);

                return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
        }

        private void setupThreadPool(int max_workers) {  
                threadPool = (ThreadPoolExecutor) Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );         
        }

        static class WorkerThreadFactory implements ThreadFactory {      
                int count = 0;   

                @Override        
                public Thread newThread(Runnable r) {    
                        return new Thread(r, "lookupWorker/" + count++);         
                }
        }


        @Override
        public String getDescription() {
                return "Afstand anden rute/" + distributor;
        }


        @Override
        public String getDetail() {
                if (isIncremental) {
                        return "Type: incremental";
                } else {
                        return "Type: full";
                }
        }


        @Override
        public double getPercentCompleted() {
                return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
        }
}
1	package dk.daoas.adressevedligehold.afstandandenrute;
2
3	import java.sql.Connection;
4	import java.util.HashMap;
5	import java.util.List;
6	import java.util.Map;
7	import java.util.Queue;
8	import java.util.Set;
9	import java.util.concurrent.CyclicBarrier;
10	import java.util.concurrent.Executors;
11	import java.util.concurrent.ThreadFactory;
12	import java.util.concurrent.ThreadPoolExecutor;
13	import java.util.concurrent.atomic.AtomicInteger;
14
15	import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
16	import dk.daoas.adressevedligehold.ReloadHelper;
17	import dk.daoas.adressevedligehold.ServiceConfig;
18	import dk.daoas.adressevedligehold.beans.Address;
19	import dk.daoas.adressevedligehold.db.DBConnection;
20	import dk.daoas.adressevedligehold.tasks.Task;
21	import dk.daoas.adressevedligehold.tasks.TaskLogger;
22
23
24
25	public class AfstandAndenRuteTask extends Task {
26
27
28	private TaskLogger logger = TaskLogger.getInstance();
29
30	final static boolean VERBOSE = false;//
31
32	public final static String INCREMENTAL = "INCREMENTAL";
33	public final static String FULL = "FULL";
34
35
36	static boolean test_mode;
37
38
39	String distributor;
40	int antalIkkeDaekkede = -1;
41
42	AtomicInteger antalBeregnet = new AtomicInteger();
43
44
45
46	ThreadPoolExecutor threadPool;
47
48	boolean isIncremental;
49
50
51	public AfstandAndenRuteTask(String distributor, String type) {
52	this.distributor = distributor;
53
54	type = type.toUpperCase();
55	switch(type) {
56	case FULL:
57	isIncremental = false;
58	break;
59	case INCREMENTAL:
60	isIncremental = true;
61	break;
62	default:
63	throw new RuntimeException("Unknown type" + type);
64	}
65	}
66
67
68	@Override
69	protected void taskRun() throws Exception {
70
71
72	Constants.init(distributor);
73	Constants consts = Constants.getInstance();
74
75	int max_workers = ServiceConfig.getInstance().maxWorkers;
76	if (max_workers <= 0) {
77	logger.info("!!! AUTO-DETECT MAX_WORKERS !!!");
78	int cores = Runtime.getRuntime().availableProcessors();
79	cores -= 1;//Efterlad 1 core/cpu i reserve til systemet
80
81	max_workers = Math.max(1, cores); //Dog skal der som minimum være 1 core til beregning
82
83	}
84	if (test_mode) {
85	max_workers = 1;
86	}
87	logger.info("Starting with MAX_WORKERS:" + max_workers);
88	setupThreadPool(max_workers);
89
90	logger.info("Starting with INCREMENTAL:" + isIncremental);
91
92
93
94	try (Connection conn = DBConnection.getConnection() ) {
95	DatabaseRouteDistance db = new DatabaseRouteDistance(conn, isIncremental);
96
97	db.prepareIncrementalSearch();
98
99	Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
100	antalIkkeDaekkede = ikkeDaekkede.size();
101	logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
102
103
104	boolean testRun= false;
105
106	AtomicInteger antalFundne = new AtomicInteger(0);
107
108	long beregnStart =0;
109	long start = System.currentTimeMillis();
110	int antalDaekkedeAdresser = -1;
111
112	if (testRun == false) {
113
114	logger.info("Finder postnumre");
115	Set<Short> postnumre = db.hentPostnumreCache();
116
117	// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
118	for(short postnr : postnumre) { //
119	logger.info("Validerer BBox for " + postnr);
120	BoundingBox bbox = db.getBoundingbox(postnr);
121	bbox.validateBbox();
122	}
123
124
125	logger.info("Henter alle daekkede adresser");
126	antalDaekkedeAdresser = db.hentAlleDaekkedeAdresser(distributor);
127	logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
128
129	Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO();
130
131	Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>();
132
133	for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) {
134	short ho = entry.getKey();
135	List<Address> geopoints = entry.getValue();
136
137	logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
138
139	int bucketSize = 96*12;
140
141	KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize );
142	for(Address a: geopoints) {
143	addressTree.addPoint(a.xyz, a);
144	}
145
146	hoTrees.put(ho, addressTree);
147	}
148
149	db.resetResultTable();
150
151	beregnStart = System.currentTimeMillis();
152	logger.info("Starter beregning");
153
154	//pre-check er ok - reset tmp tabel og start søgningen
155
156	CyclicBarrier barrier = new CyclicBarrier(max_workers + 1);
157
158	for (int i=0; i<max_workers; i++) {
159	LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,VERBOSE,consts);
160	threadPool.submit( worker );
161	}
162
163	barrier.await(); // Afvent at workerne bliver færdige
164
165	logger.info("Calc is done - cleaning up remaining bits");
166
167	threadPool.shutdown(); //Calc is done now
168
169
170	db.saveBatch();
171
172	if (test_mode == false && this.isAborted() == false) {
173	db.renameResultTables();
174
175	ReloadHelper.triggerReload( "AfstandAndenRute/" + distributor );
176
177
178	} else {
179	logger.info( "Rename tables is disabled !!!" );
180	}
181
182
183
184	} /*else {
185	/// Test
186
187	db.resetResultTable();
188
189
190	alleDaekkedeAdresser = db.hentAlleDaekkedeAdresser();
191	logger.info( "AlleDaekkedeAdresser.length=" + alleDaekkedeAdresser.size());
192
193	short post = (short) 2700;
194	Lookup lookup = new Lookup(post, db, threadPool);
195	lookup.doLookup();
196	} */
197
198
199	long now = System.currentTimeMillis();
200	long elapsed = now - start ;
201	long elapsedBeregn = now - beregnStart;
202
203
204	logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
205	logger.info("Fuld load done (beregning) : " + formatMilliSeconds(elapsedBeregn) );
206	logger.info("Antal daekkede : " + antalDaekkedeAdresser );
207	logger.info("Antal ikke-daekkede : " + antalIkkeDaekkede );
208	logger.info("Heraf, antal fundne : " + antalFundne );
209
210	logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) );
211	}
212	}
213
214
215
216	static String formatMilliSeconds(long milliseconds) {
217	int mseconds = (int) milliseconds % 1000;
218	int seconds = (int) (milliseconds / 1000) % 60 ;
219	int minutes = (int) ((milliseconds / (1000*60)) % 60);
220	int hours = (int) ((milliseconds / (10006060)) % 24);
221
222	return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
223	}
224
225	private void setupThreadPool(int max_workers) {
226	threadPool = (ThreadPoolExecutor) Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );
227	}
228
229	static class WorkerThreadFactory implements ThreadFactory {
230	int count = 0;
231
232	@Override
233	public Thread newThread(Runnable r) {
234	return new Thread(r, "lookupWorker/" + count++);
235	}
236	}
237
238
239
240
241
242
243	@Override
244	public String getDescription() {
245	return "Afstand anden rute/" + distributor;
246	}
247
248
249
250	@Override
251	public String getDetail() {
252	if (isIncremental) {
253	return "Type: incremental";
254	} else {
255	return "Type: full";
256	}
257	}
258
259
260
261	@Override
262	public double getPercentCompleted() {
263	return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
264	}
265	}