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;//


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