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 com.jwetherell.algorithms.data_structures.KdTree;


public class LookupMain {


        static final String CONFIG_FILENAME = "fulddaekning.properties";

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

                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  

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

                                @SuppressWarnings("unchecked")
                                List<KdTree.XYZPoint> tmpPoints = (List<KdTree.XYZPoint>)(List<?>) geopoints;

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