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

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

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

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

                
                Database db = new Database(conf);
                Queue<Adresse> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
                antalIkkeDaekkede = ikkeDaekkede.size();
                logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );


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

                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
                        
                        threadPool.shutdown(); //Calc is done now


                        db.saveBatch();

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