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.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.ThreadFactory;
import java.util.concurrent.atomic.AtomicInteger;

import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
import dk.daoas.adressevedligehold.ReloadTask;
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.tasks.TaskLogger;


public class AfstandAndenRuteTask extends Task {
        

        private TaskLogger logger = TaskLogger.getInstance();

        final static boolean VERBOSE = false;//
        
        public final static String INCREMENTAL = "INCREMENTAL";
        public final static String FULL = "FULL";


        static boolean test_mode;


        String distributor;
        int antalIkkeDaekkede = 0;
        
        AtomicInteger antalBeregnet = new AtomicInteger();


        ExecutorService threadPool;

        final boolean isIncremental;    
        final int max_workers;


        public AfstandAndenRuteTask(String distributor, String type) {
                this.distributor = distributor;
                
                type = type.toUpperCase();
                switch(type) {
                case FULL:
                        isIncremental = false;
                        break;
                case INCREMENTAL:
                        isIncremental = true;
                        break;
                default:
                        throw new RuntimeException("Unknown type" + type);                      
                }
                
                int tmp_max_workers = ServiceConfig.getInstance().maxWorkers;    
                if (tmp_max_workers <= 0) {      
                        logger.info("!!! AUTO-DETECT MAX_WORKERS !!!");  
                        int cores = Runtime.getRuntime().availableProcessors();  
                        cores -= 1;//Efterlad 1 core/cpu i reserve til systemet  

                        tmp_max_workers = Math.max(1, cores); //Dog skal der som minimum være 1 core til beregning      

                }        
                if (test_mode) {
                        tmp_max_workers = 1;
                }
                
                max_workers = tmp_max_workers;
        }


        @Override
        protected void taskRun() throws Exception {
                

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

                
                logger.info("Starting with MAX_WORKERS:" + max_workers);         

                threadPool = Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );
                
                logger.info("Starting with INCREMENTAL:" + isIncremental);


                AtomicInteger antalFundne = new AtomicInteger(0);

                long start = System.currentTimeMillis();
                AtomicInteger antalDaekkedeAdresser = new AtomicInteger(-1);


                // MAIN RUN START

                logger.info("======================================================================");
                
                mainRun(consts, isIncremental, "ruteMa", antalFundne, antalDaekkedeAdresser);
                
                logger.info("======================================================================");
                
                mainRun(consts, true, "ruteLo", antalFundne, antalDaekkedeAdresser);
                
                logger.info("======================================================================");
                
                mainRun(consts, true, "ruteSo",  antalFundne, antalDaekkedeAdresser);
                
                logger.info("======================================================================");

                // END OF MAIN run
                
                threadPool.shutdown(); //Calc is done now
                threadPool = null;//release early for GC
                         

                manager.submitTask( new ReloadTask("AfstandAndenRute/" + distributor) );
                

                long now = System.currentTimeMillis();
                long elapsed = now - start ;


                logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
                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 ) );
        }


        private void mainRun(Constants consts, boolean localIsIncremental, String ugedag, AtomicInteger antalFundne, AtomicInteger antalDaekkedeAdresser) throws Exception {
                
                logger.info("MainRun() isIncremental=" + localIsIncremental + " ugedag=" + ugedag);
                
                try (Connection conn = DBConnection.getConnection() ) {
                        DatabaseRouteDistance db = new DatabaseRouteDistance(conn, localIsIncremental, ugedag);
                        
                        if (localIsIncremental) {
                                db.prepareIncrementalSearch();
                        }

                        Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
                        antalIkkeDaekkede += ikkeDaekkede.size();
                        logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
                
                
                        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");
                        int tmpAntalDaekkede = db.hentAlleDaekkedeAdresser(distributor);
                        antalDaekkedeAdresser.set(tmpAntalDaekkede); 
                        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();
        

                        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");
        
        
                        db.saveBatch();
        
                        if (test_mode == false && this.isAborted() == false) {
                                db.renameResultTables();                                
        
        
                        } else {
                                logger.info( "Rename tables is disabled !!!" );
                        }

                }
        }


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


        @Override
        public String getDescription() {
                return "Afstand anden rute/" + distributor;
        }


        @Override
        public String getDetail() {
                if (isIncremental) {
                        return "Type: incremental";
                } else {
                        return "Type: full";
                }
        }


        @Override
        public double getPercentCompleted() {
                if (antalIkkeDaekkede == 0) {//avoid division by zero
                        return -1;
                }
                
                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.ExecutorService;
11	import java.util.concurrent.Executors;
12	import java.util.concurrent.ThreadFactory;
13	import java.util.concurrent.atomic.AtomicInteger;
14
15	import ags.utils.dataStructures.trees.thirdGenKD.KdTree;
16	import dk.daoas.adressevedligehold.ReloadTask;
17	import dk.daoas.adressevedligehold.ServiceConfig;
18	import dk.daoas.adressevedligehold.beans.Address;
19	import dk.daoas.adressevedligehold.db.DBConnection;
20	import dk.daoas.adressevedligehold.tasks.Task;
21	import dk.daoas.adressevedligehold.tasks.TaskLogger;
22
23
24
25	public class AfstandAndenRuteTask extends Task {
26
27
28	private TaskLogger logger = TaskLogger.getInstance();
29
30	final static boolean VERBOSE = false;//
31
32	public final static String INCREMENTAL = "INCREMENTAL";
33	public final static String FULL = "FULL";
34
35
36	static boolean test_mode;
37
38
39	String distributor;
40	int antalIkkeDaekkede = 0;
41
42	AtomicInteger antalBeregnet = new AtomicInteger();
43
44
45
46	ExecutorService threadPool;
47
48	final boolean isIncremental;
49	final int max_workers;
50
51
52	public AfstandAndenRuteTask(String distributor, String type) {
53	this.distributor = distributor;
54
55	type = type.toUpperCase();
56	switch(type) {
57	case FULL:
58	isIncremental = false;
59	break;
60	case INCREMENTAL:
61	isIncremental = true;
62	break;
63	default:
64	throw new RuntimeException("Unknown type" + type);
65	}
66
67	int tmp_max_workers = ServiceConfig.getInstance().maxWorkers;
68	if (tmp_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	tmp_max_workers = Math.max(1, cores); //Dog skal der som minimum være 1 core til beregning
74
75	}
76	if (test_mode) {
77	tmp_max_workers = 1;
78	}
79
80	max_workers = tmp_max_workers;
81	}
82
83
84	@Override
85	protected void taskRun() throws Exception {
86
87
88	Constants.init(distributor);
89	Constants consts = Constants.getInstance();
90
91
92	logger.info("Starting with MAX_WORKERS:" + max_workers);
93
94	threadPool = Executors.newFixedThreadPool(max_workers, new WorkerThreadFactory() );
95
96	logger.info("Starting with INCREMENTAL:" + isIncremental);
97
98
99
100
101
102
103
104	AtomicInteger antalFundne = new AtomicInteger(0);
105
106	long start = System.currentTimeMillis();
107	AtomicInteger antalDaekkedeAdresser = new AtomicInteger(-1);
108
109
110	// MAIN RUN START
111
112	logger.info("======================================================================");
113
114	mainRun(consts, isIncremental, "ruteMa", antalFundne, antalDaekkedeAdresser);
115
116	logger.info("======================================================================");
117
118	mainRun(consts, true, "ruteLo", antalFundne, antalDaekkedeAdresser);
119
120	logger.info("======================================================================");
121
122	mainRun(consts, true, "ruteSo", antalFundne, antalDaekkedeAdresser);
123
124	logger.info("======================================================================");
125
126	// END OF MAIN run
127
128	threadPool.shutdown(); //Calc is done now
129	threadPool = null;//release early for GC
130
131
132	manager.submitTask( new ReloadTask("AfstandAndenRute/" + distributor) );
133
134
135	long now = System.currentTimeMillis();
136	long elapsed = now - start ;
137
138
139
140	logger.info("Fuld load done : " + formatMilliSeconds(elapsed) );
141	logger.info("Antal daekkede : " + antalDaekkedeAdresser );
142	logger.info("Antal ikke-daekkede : " + antalIkkeDaekkede );
143	logger.info("Heraf, antal fundne : " + antalFundne );
144
145	logger.info( String.format("Fandt adresser til : %.2f %%", (antalFundne.get() *100.0)/antalIkkeDaekkede ) );
146	}
147
148
149	private void mainRun(Constants consts, boolean localIsIncremental, String ugedag, AtomicInteger antalFundne, AtomicInteger antalDaekkedeAdresser) throws Exception {
150
151	logger.info("MainRun() isIncremental=" + localIsIncremental + " ugedag=" + ugedag);
152
153	try (Connection conn = DBConnection.getConnection() ) {
154	DatabaseRouteDistance db = new DatabaseRouteDistance(conn, localIsIncremental, ugedag);
155
156	if (localIsIncremental) {
157	db.prepareIncrementalSearch();
158	}
159
160	Queue<Address> ikkeDaekkede = db.hentAlleIkkedaekkedeAdresser(consts.getMinPostnr(), consts.getMaxPostnr() );
161	antalIkkeDaekkede += ikkeDaekkede.size();
162	logger.info("Antal ikke-daekkede: " + antalIkkeDaekkede );
163
164
165
166	logger.info("Finder postnumre");
167	Set<Short> postnumre = db.hentPostnumreCache();
168
169	// Først validerer vi BBox på alle postnummre, for at undgå fuldt stop midt i beregningen
170	for(short postnr : postnumre) { //
171	logger.info("Validerer BBox for " + postnr);
172	BoundingBox bbox = db.getBoundingbox(postnr);
173	bbox.validateBbox();
174	}
175
176
177	logger.info("Henter alle daekkede adresser");
178	int tmpAntalDaekkede = db.hentAlleDaekkedeAdresser(distributor);
179	antalDaekkedeAdresser.set(tmpAntalDaekkede);
180	logger.info( "AlleDaekkedeAdresser.length=" + antalDaekkedeAdresser );
181
182	Map<Short, List<Address>> addrHoList = db.getDaekkedeAdresserHO();
183
184	Map<Short, KdTree<Address>> hoTrees = new HashMap<Short,KdTree<Address>>();
185
186	for ( Map.Entry<Short, List<Address>> entry : addrHoList.entrySet() ) {
187	short ho = entry.getKey();
188	List<Address> geopoints = entry.getValue();
189
190	logger.info("Opbygger KDTree for " + ho + " - antal=" + geopoints.size() );
191
192	int bucketSize = 96*12;
193
194	KdTree<Address> addressTree = new KdTree<Address>( 3, bucketSize );
195	for(Address a: geopoints) {
196	addressTree.addPoint(a.xyz, a);
197	}
198
199	hoTrees.put(ho, addressTree);
200	}
201
202	db.resetResultTable();
203
204
205	logger.info("Starter beregning");
206
207	//pre-check er ok - reset tmp tabel og start søgningen
208
209	CyclicBarrier barrier = new CyclicBarrier(max_workers + 1);
210
211	for (int i=0; i<max_workers; i++) {
212	LookupWorker worker = new LookupWorker(i, this, barrier, ikkeDaekkede, hoTrees,antalFundne,antalBeregnet,db,VERBOSE,consts);
213	threadPool.submit( worker );
214	}
215
216	barrier.await(); // Afvent at workerne bliver færdige
217
218	logger.info("Calc is done - cleaning up remaining bits");
219
220
221	db.saveBatch();
222
223	if (test_mode == false && this.isAborted() == false) {
224	db.renameResultTables();
225
226
227	} else {
228	logger.info( "Rename tables is disabled !!!" );
229	}
230
231	}
232	}
233
234
235
236	static String formatMilliSeconds(long milliseconds) {
237	int mseconds = (int) milliseconds % 1000;
238	int seconds = (int) (milliseconds / 1000) % 60 ;
239	int minutes = (int) ((milliseconds / (1000*60)) % 60);
240	int hours = (int) ((milliseconds / (10006060)) % 24);
241
242	return String.format("%02d:%02d:%02d.%03d", hours, minutes, seconds, mseconds);
243	}
244
245
246	static class WorkerThreadFactory implements ThreadFactory {
247	int count = 0;
248
249	@Override
250	public Thread newThread(Runnable r) {
251	return new Thread(r, "lookupWorker/" + count++);
252	}
253	}
254
255
256
257
258
259
260	@Override
261	public String getDescription() {
262	return "Afstand anden rute/" + distributor;
263	}
264
265
266
267	@Override
268	public String getDetail() {
269	if (isIncremental) {
270	return "Type: incremental";
271	} else {
272	return "Type: full";
273	}
274	}
275
276
277
278	@Override
279	public double getPercentCompleted() {
280	if (antalIkkeDaekkede == 0) {//avoid division by zero
281	return -1;
282	}
283
284	return (antalBeregnet.get() / ((float)antalIkkeDaekkede)) * 100.0;
285	}
286	}