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 java.util.logging.FileHandler;
import java.util.logging.Logger;
import java.util.logging.SimpleFormatter;

import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
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.util.HttpUtil;


public class AfstandAndenRuteTask extends Task {

        final Logger logger = Logger.getLogger( AfstandAndenRuteTask.class.toString() );

        final boolean verbose = false;//


        static boolean test_mode;


        String distributor;


        ThreadPoolExecutor threadPool;


        public AfstandAndenRuteTask(String distributor) {
                this.distributor = distributor;
        }


        @Override
        protected void taskRun() throws Exception {


                //Setup j.u.l Logger
                Logger root = Logger.getLogger("");
                FileHandler fhandler = new FileHandler("fulddaekning.log"); // Ingen max størrelse, ingen rotation og ingen append
                fhandler.setFormatter( new SimpleFormatter() );
                root.addHandler( fhandler );


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

                int antalIkkeDaekkede = -1;

                try (Connection conn = DBConnection.getConnection() ) {
                        Database db = new Database(conn);

                        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,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();

                                        String trigger_url = ServiceConfig.getInstance().trigger_url;

                                        logger.info("Calling trigger URL");
                                        String url = trigger_url + "&trigger=AfstandAndenRute/" + distributor;

                                        HttpUtil.getContentString(url, 500);

                                } 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 ) );
                        //logger.info("Fandt adresser til : " + (antalFundne*100.0)/ikkeDaekkede.length + "%" );

                }
        }


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


        @Override
        public String getDetail() {
                // TODO Auto-generated method stub
                return null;
        }


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