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.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.ThreadFactory;
import java.util.concurrent.atomic.AtomicInteger;

import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
import dk.daoas.adressevedligehold.ReloadTask;
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 = 0;
        
        AtomicInteger antalBeregnet = new AtomicInteger();


        ExecutorService 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);         

                threadPool = Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );
                
                logger.info("Starting with INCREMENTAL:" + isIncremental);


                AtomicInteger antalFundne = new AtomicInteger(0);

                long start = System.currentTimeMillis();
                AtomicInteger antalDaekkedeAdresser = new AtomicInteger(-1);


                // MAIN RUN START

                logger.info("======================================================================");
                
                mainRun(consts, isIncremental, "ruteMa", max_workers,  antalFundne, antalDaekkedeAdresser);
                
                logger.info("======================================================================");
                
                mainRun(consts, true, "ruteLo", max_workers,  antalFundne, antalDaekkedeAdresser);
                
                logger.info("======================================================================");
                
                mainRun(consts, true, "ruteSo", max_workers,  antalFundne, antalDaekkedeAdresser);
                
                logger.info("======================================================================");

                // END OF MAIN run
                
                threadPool.shutdown(); //Calc is done now
                threadPool = null;//release early for GC
                         

                manager.submitTask( new ReloadTask("AfstandAndenRute/" + distributor) );
                

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


                logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
                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 ) );
        }


        private void mainRun(Constants consts, boolean localIsIncremental, String ugedag, int max_workers, AtomicInteger antalFundne, AtomicInteger antalDaekkedeAdresser) throws Exception {
                
                logger.info("MainRun() isIncremental=" + localIsIncremental + " ugedag=" + ugedag);
                
                try (Connection conn = DBConnection.getConnection() ) {
                        DatabaseRouteDistance db = new DatabaseRouteDistance(conn, localIsIncremental, ugedag);
                        
                        if (localIsIncremental) {
                                db.prepareIncrementalSearch();
                        }

                        Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
                        antalIkkeDaekkede += ikkeDaekkede.size();
                        logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
                
                
                        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");
                        int tmpAntalDaekkede = db.hentAlleDaekkedeAdresser(distributor);
                        antalDaekkedeAdresser.set(tmpAntalDaekkede); 
                        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();
        

                        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");
        
        
                        db.saveBatch();
        
                        if (test_mode == false && this.isAborted() == false) {
                                db.renameResultTables();                                
        
        
                        } else {
                                logger.info( "Rename tables is disabled !!!" );
                        }

                }
        }


        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);
        }


        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() {
                if (antalIkkeDaekkede == 0) {//avoid division by zero
                        return -1;
                }
                
                return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
        }
}
1	torben	2878	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	torben	2976	import java.util.concurrent.ExecutorService;
11	torben	2878	import java.util.concurrent.Executors;
12			import java.util.concurrent.ThreadFactory;
13			import java.util.concurrent.atomic.AtomicInteger;
14
15			import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
16	torben	2993	import dk.daoas.adressevedligehold.ReloadTask;
17	torben	2878	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	torben	2903	import dk.daoas.adressevedligehold.tasks.TaskLogger;
22	torben	2878
23
24
25			public class AfstandAndenRuteTask extends Task {
26	torben	2954
27	torben	2878
28	torben	2903	private TaskLogger logger = TaskLogger.getInstance();
29	torben	2878
30	torben	2908	final static boolean VERBOSE = false;//
31	torben	2954
32			public final static String INCREMENTAL = "INCREMENTAL";
33			public final static String FULL = "FULL";
34	torben	2878
35
36			static boolean test_mode;
37
38
39			String distributor;
40	torben	2972	int antalIkkeDaekkede = 0;
41	torben	2891
42			AtomicInteger antalBeregnet = new AtomicInteger();
43	torben	2878
44
45
46	torben	2976	ExecutorService threadPool;
47	torben	2878
48	torben	2927	boolean isIncremental;
49	torben	2878
50
51	torben	2927	public AfstandAndenRuteTask(String distributor, String type) {
52	torben	2878	this.distributor = distributor;
53	torben	2927
54			type = type.toUpperCase();
55			switch(type) {
56	torben	2954	case FULL:
57	torben	2927	isIncremental = false;
58			break;
59	torben	2954	case INCREMENTAL:
60	torben	2927	isIncremental = true;
61			break;
62			default:
63			throw new RuntimeException("Unknown type" + type);
64			}
65	torben	2878	}
66
67
68			@Override
69			protected void taskRun() throws Exception {
70	torben	2927
71	torben	2878
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	torben	2994
89			threadPool = Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );
90	torben	2927
91			logger.info("Starting with INCREMENTAL:" + isIncremental);
92	torben	2878
93
94	torben	2891
95	torben	2972
96	torben	2878
97
98
99	torben	2972	AtomicInteger antalFundne = new AtomicInteger(0);
100	torben	2878
101	torben	2972	long start = System.currentTimeMillis();
102			AtomicInteger antalDaekkedeAdresser = new AtomicInteger(-1);
103	torben	2878
104
105	torben	2972	// MAIN RUN START
106	torben	2878
107	torben	2972	logger.info("======================================================================");
108
109			mainRun(consts, isIncremental, "ruteMa", max_workers, antalFundne, antalDaekkedeAdresser);
110
111			logger.info("======================================================================");
112
113			mainRun(consts, true, "ruteLo", max_workers, antalFundne, antalDaekkedeAdresser);
114
115			logger.info("======================================================================");
116
117			mainRun(consts, true, "ruteSo", max_workers, antalFundne, antalDaekkedeAdresser);
118
119			logger.info("======================================================================");
120	torben	2878
121	torben	2972	// END OF MAIN run
122
123			threadPool.shutdown(); //Calc is done now
124	torben	2994	threadPool = null;//release early for GC
125	torben	2972
126	torben	2878
127	torben	2993	manager.submitTask( new ReloadTask("AfstandAndenRute/" + distributor) );
128	torben	2975
129	torben	2878
130	torben	2972	long now = System.currentTimeMillis();
131			long elapsed = now - start ;
132	torben	2878
133
134
135	torben	2972	logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
136			logger.info("Antal daekkede : " + antalDaekkedeAdresser );
137			logger.info("Antal ikke-daekkede : " + antalIkkeDaekkede );
138			logger.info("Heraf, antal fundne : " + antalFundne );
139	torben	2878
140	torben	2972	logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) );
141			}
142	torben	2878
143
144	torben	2972	private void mainRun(Constants consts, boolean localIsIncremental, String ugedag, int max_workers, AtomicInteger antalFundne, AtomicInteger antalDaekkedeAdresser) throws Exception {
145
146			logger.info("MainRun() isIncremental=" + localIsIncremental + " ugedag=" + ugedag);
147
148			try (Connection conn = DBConnection.getConnection() ) {
149			DatabaseRouteDistance db = new DatabaseRouteDistance(conn, localIsIncremental, ugedag);
150
151			if (localIsIncremental) {
152			db.prepareIncrementalSearch();
153			}
154	torben	2878
155	torben	2972	Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
156			antalIkkeDaekkede += ikkeDaekkede.size();
157			logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
158
159
160	torben	2878
161	torben	2972	logger.info("Finder postnumre");
162			Set<Short> postnumre = db.hentPostnumreCache();
163
164			// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
165			for(short postnr : postnumre) { //
166			logger.info("Validerer BBox for " + postnr);
167			BoundingBox bbox = db.getBoundingbox(postnr);
168			bbox.validateBbox();
169			}
170
171
172			logger.info("Henter alle daekkede adresser");
173			int tmpAntalDaekkede = db.hentAlleDaekkedeAdresser(distributor);
174			antalDaekkedeAdresser.set(tmpAntalDaekkede);
175			logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
176
177			Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO();
178
179			Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>();
180
181			for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) {
182			short ho = entry.getKey();
183			List<Address> geopoints = entry.getValue();
184
185			logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
186
187			int bucketSize = 96*12;
188
189			KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize );
190			for(Address a: geopoints) {
191			addressTree.addPoint(a.xyz, a);
192	torben	2878	}
193	torben	2972
194			hoTrees.put(ho, addressTree);
195			}
196
197			db.resetResultTable();
198
199	torben	2878
200	torben	2972	logger.info("Starter beregning");
201
202			//pre-check er ok - reset tmp tabel og start søgningen
203
204			CyclicBarrier barrier = new CyclicBarrier(max_workers + 1);
205
206			for (int i=0; i<max_workers; i++) {
207			LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,VERBOSE,consts);
208			threadPool.submit( worker );
209			}
210
211			barrier.await(); // Afvent at workerne bliver færdige
212
213			logger.info("Calc is done - cleaning up remaining bits");
214
215
216			db.saveBatch();
217
218			if (test_mode == false && this.isAborted() == false) {
219	torben	2975	db.renameResultTables();
220	torben	2972
221
222			} else {
223			logger.info( "Rename tables is disabled !!!" );
224			}
225	torben	2878
226			}
227			}
228
229
230
231			static String formatMilliSeconds(long milliseconds) {
232			int mseconds = (int) milliseconds % 1000;
233			int seconds = (int) (milliseconds / 1000) % 60 ;
234			int minutes = (int) ((milliseconds / (1000*60)) % 60);
235			int hours = (int) ((milliseconds / (10006060)) % 24);
236
237			return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
238			}
239
240
241			static class WorkerThreadFactory implements ThreadFactory {
242			int count = 0;
243
244			@Override
245			public Thread newThread(Runnable r) {
246			return new Thread(r, "lookupWorker/" + count++);
247			}
248			}
249
250
251
252
253
254
255			@Override
256			public String getDescription() {
257	torben	2891	return "Afstand anden rute/" + distributor;
258	torben	2878	}
259
260
261
262			@Override
263			public String getDetail() {
264	torben	2927	if (isIncremental) {
265			return "Type: incremental";
266			} else {
267			return "Type: full";
268			}
269	torben	2878	}
270
271
272
273			@Override
274	torben	2891	public double getPercentCompleted() {
275	torben	2972	if (antalIkkeDaekkede == 0) {//avoid division by zero
276			return -1;
277			}
278
279	torben	2891	return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
280	torben	2878	}
281			}