spmd/split/SplitMap1DHorizontal.java

package appl.parallel.spmd.split;

import java.awt.Rectangle;

import de.schmitzm.geotools.data.WritableGrid;

/**
 * Responsible for splitting a 2D Area (e.g a {@link WritableGrid}) in a 
 * 1D fashion, which means in this case horizontal (by rows). This is only a
 * a virtual split (a map of a split). 
 * 
 * A neighborhood range can be specified to create partitions that
 * overlap each other. This overlapping can be done in two different
 * ways: <br><br>
 * 
 * <b>Inboxing</b>(default):<br><br>
 * Inboxing means, that the neighborhood area is not part of the calculation
 * area. 
 * <br> <br>
 * <b>Outboxing:</b><br>
 * Outboxing means that the neighborhood area is part of the calculation area.
 *  <br> <br>
 * 
 *
 * Note that this class is flexible. It may also be applied 
 * to one dimensional data structures like for example arrays. 
 * If u want to do this, simply choose one of the dimensions as 1. <br>
 * 
 * @author Dominik Appl
 */

public class SplitMap1DHorizontal extends AbstractSplitMap implements SplitMap {


        public SplitMap1DHorizontal(int width, int height, int neighborhoodRange, int noOfPartitions,
                        NeighborhoodBoxingMode boxingMode) {
                
                super(width,height,neighborhoodRange, noOfPartitions, boxingMode);
        }
        

        /**
         * needed for serialization
         */
        public SplitMap1DHorizontal(){
                
        }
        
        /* (non-Javadoc)
         * @see appl.parallel.spmd.split.DataSplitter#getDescription()
         */
        public String getDescription() {
                return "1D-GridSplitter";
        }

        /* (non-Javadoc)
         * @see appl.parallel.spmd.split.DataSplitter#split(appl.parallel.spmd.split.SplittableRessource)
         */
        public void makeMap() {
                        //the local calculation area is partitioned
                        int nextUpperLeftCorner = (int) globalBounds.getY(); //next y-value (will be 0)
                        for (int i = 0; i < noOfPartitions; i++) {
                                
                                //calculate length based on weights
                                int pHeight = (int) (globalBounds.getHeight() * weights[i]);
                                
                                //for the last position make sure, that ALL data is used 
                                //and no line is lost due to rounding errors in weight calculation
                                if(i==noOfPartitions-1)
                                        pHeight = (int) globalBounds.getHeight() - nextUpperLeftCorner;
                                
                                //create inboxing(!) partition 
                                partitionCalculationBounds[i] = new Rectangle(
                                                (int) globalBounds.getX(), nextUpperLeftCorner, (int)globalBounds.getWidth(),
                                                pHeight);
                                
                                //if there is only one partition there are no explicit neighborhood bounds
                                if(noOfPartitions==1)
                                        partitionNeighborhoodBounds[i]=partitionCalculationBounds[i];
                                //else simply calculate the neighborhood bounds out of the previosly 
                                //created calculation Area (@see AbstractSplitMap)
                                else 
                                        partitionNeighborhoodBounds[i] = new Rectangle(
                                                        (int) globalBounds.getX(),
                                                        (int) partitionCalculationBounds[i].getY() - neighborhoodRange,
                                                        (int)(partitionCalculationBounds[i].getWidth()),
                                                    (int)(partitionCalculationBounds[i].getHeight()+ 2 * neighborhoodRange));
                                
                            //the first and the last partition have a neighborhood area only on one side of 
                            //the calculation area:
                            partitionNeighborhoodBounds[i] = partitionNeighborhoodBounds[i].intersection(globalBounds);
                                nextUpperLeftCorner += pHeight; //+1 not required - the partitions will not overlap
                                
                                //the partitionCalculation bounds were created for inboxing:
                                if(boxingMode==NeighborhoodBoxingMode.outBoxing)
                                        partitionCalculationBounds[i]=partitionNeighborhoodBounds[i];                   
                }
        }
        
        /* (non-Javadoc)
         * @see appl.parallel.spmd.split.SplitMap#getNeighborsForPosition(int)
         */
        public int[] getNeighborsForPosition(int pos) {
                int[] oneReturn = new int[1];
                int[] twoReturns = new int[2];

                //this is very simple in one 1D case, of course:
                //if only one Partition return null
                if (noOfPartitions == 1)
                        return new int[0];
                
                //for first partition
                if ((pos == 0)) {
                        oneReturn[0] = 1;
                        return oneReturn;
                }
                //for last partition
                if (pos == noOfPartitions - 1) {
                        oneReturn[0] = noOfPartitions - 2;
                        return oneReturn;
                }
                //for every other partition
                twoReturns[0] = pos - 1;
                twoReturns[1] = pos + 1;
                return twoReturns;
        }

}
1	package appl.parallel.spmd.split;
2
3	import java.awt.Rectangle;
4
5	import de.schmitzm.geotools.data.WritableGrid;
6
7	/**
8	* Responsible for splitting a 2D Area (e.g a {@link WritableGrid}) in a
9	* 1D fashion, which means in this case horizontal (by rows). This is only a
10	* a virtual split (a map of a split).
11	*
12	* A neighborhood range can be specified to create partitions that
13	* overlap each other. This overlapping can be done in two different
14	* ways: <br><br>
15	*
16	* <b>Inboxing</b>(default):<br><br>
17	* Inboxing means, that the neighborhood area is not part of the calculation
18	* area.
19	* <br> <br>
20	* <b>Outboxing:</b><br>
21	* Outboxing means that the neighborhood area is part of the calculation area.
22	* <br> <br>
23	*
24	*
25	* Note that this class is flexible. It may also be applied
26	* to one dimensional data structures like for example arrays.
27	* If u want to do this, simply choose one of the dimensions as 1. <br>
28	*
29	* @author Dominik Appl
30	*/
31
32	public class SplitMap1DHorizontal extends AbstractSplitMap implements SplitMap {
33
34
35
36	public SplitMap1DHorizontal(int width, int height, int neighborhoodRange, int noOfPartitions,
37	NeighborhoodBoxingMode boxingMode) {
38
39	super(width,height,neighborhoodRange, noOfPartitions, boxingMode);
40	}
41
42
43	/**
44	* needed for serialization
45	*/
46	public SplitMap1DHorizontal(){
47
48	}
49
50	/* (non-Javadoc)
51	* @see appl.parallel.spmd.split.DataSplitter#getDescription()
52	*/
53	public String getDescription() {
54	return "1D-GridSplitter";
55	}
56
57	/* (non-Javadoc)
58	* @see appl.parallel.spmd.split.DataSplitter#split(appl.parallel.spmd.split.SplittableRessource)
59	*/
60	public void makeMap() {
61	//the local calculation area is partitioned
62	int nextUpperLeftCorner = (int) globalBounds.getY(); //next y-value (will be 0)
63	for (int i = 0; i < noOfPartitions; i++) {
64
65	//calculate length based on weights
66	int pHeight = (int) (globalBounds.getHeight() * weights[i]);
67
68	//for the last position make sure, that ALL data is used
69	//and no line is lost due to rounding errors in weight calculation
70	if(i==noOfPartitions-1)
71	pHeight = (int) globalBounds.getHeight() - nextUpperLeftCorner;
72
73	//create inboxing(!) partition
74	partitionCalculationBounds[i] = new Rectangle(
75	(int) globalBounds.getX(), nextUpperLeftCorner, (int)globalBounds.getWidth(),
76	pHeight);
77
78	//if there is only one partition there are no explicit neighborhood bounds
79	if(noOfPartitions==1)
80	partitionNeighborhoodBounds[i]=partitionCalculationBounds[i];
81	//else simply calculate the neighborhood bounds out of the previosly
82	//created calculation Area (@see AbstractSplitMap)
83	else
84	partitionNeighborhoodBounds[i] = new Rectangle(
85	(int) globalBounds.getX(),
86	(int) partitionCalculationBounds[i].getY() - neighborhoodRange,
87	(int)(partitionCalculationBounds[i].getWidth()),
88	(int)(partitionCalculationBounds[i].getHeight()+ 2 * neighborhoodRange));
89
90	//the first and the last partition have a neighborhood area only on one side of
91	//the calculation area:
92	partitionNeighborhoodBounds[i] = partitionNeighborhoodBounds[i].intersection(globalBounds);
93	nextUpperLeftCorner += pHeight; //+1 not required - the partitions will not overlap
94
95	//the partitionCalculation bounds were created for inboxing:
96	if(boxingMode==NeighborhoodBoxingMode.outBoxing)
97	partitionCalculationBounds[i]=partitionNeighborhoodBounds[i];
98	}
99	}
100
101	/* (non-Javadoc)
102	* @see appl.parallel.spmd.split.SplitMap#getNeighborsForPosition(int)
103	*/
104	public int[] getNeighborsForPosition(int pos) {
105	int[] oneReturn = new int[1];
106	int[] twoReturns = new int[2];
107
108	//this is very simple in one 1D case, of course:
109	//if only one Partition return null
110	if (noOfPartitions == 1)
111	return new int[0];
112
113	//for first partition
114	if ((pos == 0)) {
115	oneReturn[0] = 1;
116	return oneReturn;
117	}
118	//for last partition
119	if (pos == noOfPartitions - 1) {
120	oneReturn[0] = noOfPartitions - 2;
121	return oneReturn;
122	}
123	//for every other partition
124	twoReturns[0] = pos - 1;
125	twoReturns[1] = pos + 1;
126	return twoReturns;
127	}
128
129	}