spmd/split/SplitMap1DVertical.java

package appl.parallel.spmd.split;

import java.awt.Rectangle;

import schmitzm.data.WritableGrid;

/**
 * Responsible for splitting a 2D Area (e.g a {@link WritableGrid}) in a 
 * 1D fashion, which means in this case vertical (by cols). 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 SplitMap1DVertical extends AbstractSplitMap implements SplitMap {

        
//      public SplitMap1DVertical(SplittableResource splittable, int neighborhoodRange, int noOfPartitions,
//                      NeighborhoodBoxingMode boxingMode) {
//              
//              super(splittable,neighborhoodRange, noOfPartitions, boxingMode);
//      }
        

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

        /**
         * needed for serialization
         */
        public SplitMap1DVertical(){
                
        }
        
        /* (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.getX(); //next x-value (will be 0)
                        for (int i = 0; i < noOfPartitions; i++) {
                                
                                //calculate length based on weights
                                int pWidth = (int) (globalBounds.getWidth() * 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)
                                        pWidth = (int) globalBounds.getWidth() - nextUpperLeftCorner;
                                
                                //create inboxing(!) partition 
                                partitionCalculationBounds[i] = new Rectangle(
                                                nextUpperLeftCorner, (int) globalBounds.getY(), pWidth,
                                                (int) globalBounds.getHeight());
                                
                                //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
                                else 
                                        partitionNeighborhoodBounds[i] = new Rectangle(
                                                (int)partitionCalculationBounds[i].getX() - neighborhoodRange,
                                                (int) globalBounds.getY(),
                                                (int)(partitionCalculationBounds[i].getWidth() + 2 * neighborhoodRange),
                                                (int)(partitionCalculationBounds[i].getHeight()));
                                
                            //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 += pWidth; //+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 schmitzm.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 vertical (by cols). 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 SplitMap1DVertical extends AbstractSplitMap implements SplitMap {
33
34
35	// public SplitMap1DVertical(SplittableResource splittable, int neighborhoodRange, int noOfPartitions,
36	// NeighborhoodBoxingMode boxingMode) {
37	//
38	// super(splittable,neighborhoodRange, noOfPartitions, boxingMode);
39	// }
40
41
42	public SplitMap1DVertical(int width, int height, int neighborhoodRange, int noOfPartitions,
43	NeighborhoodBoxingMode boxingMode) {
44
45	super(width,height,neighborhoodRange, noOfPartitions, boxingMode);
46	}
47
48
49	/**
50	* needed for serialization
51	*/
52	public SplitMap1DVertical(){
53
54	}
55
56	/* (non-Javadoc)
57	* @see appl.parallel.spmd.split.DataSplitter#getDescription()
58	*/
59	public String getDescription() {
60	return "1D-GridSplitter";
61	}
62
63	/* (non-Javadoc)
64	* @see appl.parallel.spmd.split.DataSplitter#split(appl.parallel.spmd.split.SplittableRessource)
65	*/
66	public void makeMap() {
67	//the local calculation area is partitioned
68	int nextUpperLeftCorner = (int) globalBounds.getX(); //next x-value (will be 0)
69	for (int i = 0; i < noOfPartitions; i++) {
70
71	//calculate length based on weights
72	int pWidth = (int) (globalBounds.getWidth() * weights[i]);
73
74	//for the last position make sure, that ALL data is used
75	//and no line is lost due to rounding errors in weight calculation
76	if(i==noOfPartitions-1)
77	pWidth = (int) globalBounds.getWidth() - nextUpperLeftCorner;
78
79	//create inboxing(!) partition
80	partitionCalculationBounds[i] = new Rectangle(
81	nextUpperLeftCorner, (int) globalBounds.getY(), pWidth,
82	(int) globalBounds.getHeight());
83
84	//if there is only one partition there are no explicit neighborhood bounds
85	if(noOfPartitions==1)
86	partitionNeighborhoodBounds[i]=partitionCalculationBounds[i];
87	//else simply calculate the neighborhood bounds out of the previosly
88	//created calculation Area
89	else
90	partitionNeighborhoodBounds[i] = new Rectangle(
91	(int)partitionCalculationBounds[i].getX() - neighborhoodRange,
92	(int) globalBounds.getY(),
93	(int)(partitionCalculationBounds[i].getWidth() + 2 * neighborhoodRange),
94	(int)(partitionCalculationBounds[i].getHeight()));
95
96	//the first and the last partition have a neighborhood area only on one side of
97	//the calculation area:
98	partitionNeighborhoodBounds[i] = partitionNeighborhoodBounds[i].intersection(globalBounds);
99	nextUpperLeftCorner += pWidth; //+1 not required - the partitions will not overlap
100
101	//the partitionCalculation bounds were created for inboxing:
102	if(boxingMode==NeighborhoodBoxingMode.outBoxing)
103	partitionCalculationBounds[i]=partitionNeighborhoodBounds[i];
104
105	}
106	}
107
108	/* (non-Javadoc)
109	* @see appl.parallel.spmd.split.SplitMap#getNeighborsForPosition(int)
110	*/
111	public int[] getNeighborsForPosition(int pos) {
112	int[] oneReturn = new int[1];
113	int[] twoReturns = new int[2];
114
115	//this is very simple in one 1D case, of course:
116	//if only one Partition return null
117	if (noOfPartitions == 1)
118	return new int[0];
119
120	//for first partition
121	if ((pos == 0)) {
122	oneReturn[0] = 1;
123	return oneReturn;
124	}
125	//for last partition
126	if (pos == noOfPartitions - 1) {
127	oneReturn[0] = noOfPartitions - 2;
128	return oneReturn;
129	}
130	//for every other partition
131	twoReturns[0] = pos - 1;
132	twoReturns[1] = pos + 1;
133	return twoReturns;
134	}
135
136	}