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.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.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;
        int antalIkkeDaekkede = -1;
        
        AtomicInteger antalBeregnet = new AtomicInteger();


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


                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,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 ) );
                        //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/" + distributor;
        }


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


        @Override
        public double getPercentCompleted() {
                return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
        }
}
1	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.ReloadHelper;
20	import dk.daoas.adressevedligehold.ServiceConfig;
21	import dk.daoas.adressevedligehold.beans.Address;
22	import dk.daoas.adressevedligehold.db.DBConnection;
23	import dk.daoas.adressevedligehold.tasks.Task;
24	import dk.daoas.adressevedligehold.util.HttpUtil;
25
26
27
28	public class AfstandAndenRuteTask extends Task {
29
30	final Logger logger = Logger.getLogger( AfstandAndenRuteTask.class.toString() );
31
32	final boolean verbose = false;//
33
34
35	static boolean test_mode;
36
37
38	String distributor;
39	int antalIkkeDaekkede = -1;
40
41	AtomicInteger antalBeregnet = new AtomicInteger();
42
43
44
45	ThreadPoolExecutor threadPool;
46
47
48
49	public AfstandAndenRuteTask(String distributor) {
50	this.distributor = distributor;
51	}
52
53
54	@Override
55	protected void taskRun() throws Exception {
56
57
58
59
60	//Setup j.u.l Logger
61	//Logger root = Logger.getLogger("");
62	//FileHandler fhandler = new FileHandler("fulddaekning.log"); // Ingen max størrelse, ingen rotation og ingen append
63	//fhandler.setFormatter( new SimpleFormatter() );
64	//root.addHandler( fhandler );
65
66
67
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
86
87
88	try (Connection conn = DBConnection.getConnection() ) {
89	Database db = new Database(conn);
90
91	Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
92	antalIkkeDaekkede = ikkeDaekkede.size();
93	logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
94
95
96	boolean testRun= false;
97
98	AtomicInteger antalFundne = new AtomicInteger(0);
99
100	long beregnStart =0;
101	long start = System.currentTimeMillis();
102	int antalDaekkedeAdresser = -1;
103
104	if (testRun == false) {
105
106	logger.info("Finder postnumre");
107	Set<Short> postnumre = db.hentPostnumreCache();
108
109	// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
110	for(short postnr : postnumre) { //
111	logger.info("Validerer BBox for " + postnr);
112	BoundingBox bbox = db.getBoundingbox(postnr);
113	bbox.validateBbox();
114	}
115
116
117	logger.info("Henter alle daekkede adresser");
118	antalDaekkedeAdresser = db.hentAlleDaekkedeAdresser(distributor);
119	logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
120
121	Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO();
122
123	Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>();
124
125	for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) {
126	short ho = entry.getKey();
127	List<Address> geopoints = entry.getValue();
128
129	logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
130
131	int bucketSize = 96*12;
132
133	KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize );
134	for(Address a: geopoints) {
135	addressTree.addPoint(a.xyz, a);
136	}
137
138	hoTrees.put(ho, addressTree);
139	}
140
141	db.resetResultTable();
142
143	beregnStart = System.currentTimeMillis();
144	logger.info("Starter beregning");
145
146	//pre-check er ok - reset tmp tabel og start søgningen
147
148	CyclicBarrier barrier = new CyclicBarrier(max_workers + 1);
149
150	for (int i=0; i<max_workers; i++) {
151	LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,verbose,consts);
152	threadPool.submit( worker );
153	}
154
155	barrier.await(); // Afvent at workerne bliver færdige
156
157	logger.info("Calc is done - cleaning up remaining bits");
158
159	threadPool.shutdown(); //Calc is done now
160
161
162	db.saveBatch();
163
164	if (test_mode == false && this.isAborted() == false) {
165	db.renameResultTables();
166
167	ReloadHelper.triggerReload( "AfstandAndenRute/" + distributor );
168
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/" + distributor;
240	}
241
242
243
244	@Override
245	public String getDetail() {
246	// TODO Auto-generated method stub
247	return "";
248	}
249
250
251
252	@Override
253	public double getPercentCompleted() {
254	return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
255	}
256	}