daoas/fulddaekning/LookupMain.java

package dk.daoas.fulddaekning;

import java.io.File;
import java.io.FileReader;
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;


public class LookupMain {


        static final String CONFIG_FILENAME = "fulddaekning.properties";

        static boolean use_osrm;
        static boolean test_mode;
        static SafeProperties conf;

        static int max_workers;
        static boolean verbose;

        static String distributor;

        final static Logger logger = Logger.getLogger( LookupMain.class.toString() );


        static ThreadPoolExecutor threadPool;

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


        public static void main(String[] args) 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 );


                File confFile = new File( CONFIG_FILENAME );
                if (! confFile.exists() ) {
                        logger.warning("Config file not found: " + CONFIG_FILENAME);
                        System.exit(1);
                }

                int antalIkkeDaekkede = -1;
                
                conf = new SafeProperties();
                conf.load( new FileReader(confFile) );


                verbose = Boolean.parseBoolean( conf.getSafeProperty("VERBOSE") );
                logger.info("Starting with VERBOSE:" + verbose);

                test_mode = Boolean.parseBoolean( conf.getSafeProperty("TEST") );
                logger.info("Starting with TEST:" + test_mode);

                use_osrm = Boolean.parseBoolean( conf.getSafeProperty("USE_OSRM") );
                logger.info("Starting with USE_OSRM:" + use_osrm);

                distributor = conf.getSafeProperty("DISTRIBUTOR");
                distributor = distributor.toUpperCase();
                logger.info("Starting for DISTRIBUTOR:" + distributor);

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

                max_workers = Integer.parseInt( conf.getSafeProperty("MAX_WORKERS") );   
                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();

                
                Database db = new Database(conf);
                Queue<Adresse> 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();
                        logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );

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

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

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

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

                                int bucketSize = 96*12;

                                KdTree<Adresse> addressTree = new KdTree<Adresse>( 3, bucketSize );
                                for(Adresse 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(LookupMain.max_workers + 1);
                        
                        for (int i=0; i<max_workers; i++) {
                                LookupWorker worker = new LookupWorker(i, 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) {
                                db.renameResultTables();
                        } 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);
        }


        static class WorkerThreadFactory implements ThreadFactory {      
                int count = 0;   

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