4 * Java implementation of the <tt>em3d</tt> Olden benchmark. This Olden
5 * benchmark models the propagation of electromagnetic waves through
6 * objects in 3 dimensions. It is a simple computation on an irregular
7 * bipartite graph containing nodes representing electric and magnetic
11 * D. Culler, A. Dusseau, S. Goldstein, A. Krishnamurthy, S. Lumetta, T. von
12 * Eicken and K. Yelick. "Parallel Programming in Split-C". Supercomputing
13 * 1993, pages 262-273.
16 public class Em3d extends Thread
20 * The number of nodes (E and H)
24 * The out-degree of each node.
26 private int numDegree;
28 * The number of compute iterations
32 * Should we print the results and other runtime messages
34 private boolean printResult;
36 * Print information messages?
38 private boolean printMsgs;
53 public Em3d(BiGraph bg, int lowerlimit, int upperlimit, int numIter, Barrier mybarr) {
55 this.lowerlimit = lowerlimit;
56 this.upperlimit = upperlimit;
57 this.numIter = numIter;
74 for(int j = 0; j<lowerlimit; j++){
75 enodebase = enodebase.next;
76 hnodebase = hnodebase.next;
80 for (int i = 0; i < iteration; i++) {
84 for(int j = lowerlimit; j<upperlimit; j++) {
85 for (int k = 0; k < n.fromCount; k++) {
86 n.value -= n.coeffs[k] * n.fromNodes[k].value;
92 Barrier.enterBarrier(barr);
93 System.clearPrefetchCache();
98 for(int j = lowerlimit; j<upperlimit; j++) {
99 for (int k = 0; k < n.fromCount; k++) {
100 n.value -= n.coeffs[k] * n.fromNodes[k].value;
105 Barrier.enterBarrier(barr);
106 System.clearPrefetchCache();
111 * The main roitine that creates the irregular, linked data structure
112 * that represents the electric and magnetic fields and propagates the
113 * waves through the graph.
114 * @param args the command line arguments
116 public static void main(String args[]) {
117 Em3d em = new Em3d();
118 Em3d.parseCmdLine(args, em);
120 System.printString("Initializing em3d random graph...\n");
121 long start0 = System.currentTimeMillis();
123 int[] mid = new int[numThreads];
124 mid[0] = (128<<24)|(195<<16)|(175<<8)|79;
125 System.printString("DEBUG -> numThreads = " + numThreads+"\n");
128 mybarr = global new Barrier(numThreads);
131 Random rand = new Random(783);
133 graph = BiGraph.create(em.numNodes, em.numDegree, em.printResult, rand);
136 long end0 = System.currentTimeMillis();
138 // compute a single iteration of electro-magnetic propagation
140 System.printString("Propagating field values for " + em.numIter +
141 " iteration(s)...\n");
142 long start1 = System.currentTimeMillis();
145 em3d = global new Em3d[numThreads];
146 em3d[0] = global new Em3d(graph, 0, em.numNodes, em.numIter, mybarr);
150 for(int i = 0; i<numThreads; i++) {
157 for(int i = 0; i<numThreads; i++) {
163 long end1 = System.currentTimeMillis();
165 // print current field values
166 if (em.printResult) {
167 StringBuffer retval = new StringBuffer();
170 dvalue = graph.hNodes.value;
172 int intvalue = (int)dvalue;
176 System.printString("EM3D build time "+ (long)((end0 - start0)/1000.0) + "\n");
177 System.printString("EM3D compute time " + (long)((end1 - start1)/1000.0) + "\n");
178 System.printString("EM3D total time " + (long)((end1 - start0)/1000.0) + "\n");
180 System.printString("Done!"+ "\n");
185 * Parse the command line options.
186 * @param args the command line options.
189 public static void parseCmdLine(String args[], Em3d em)
194 while (i < args.length && args[i].startsWith("-")) {
197 // check for options that require arguments
198 if (arg.equals("-N")) {
199 if (i < args.length) {
200 em.numNodes = new Integer(args[i++]).intValue();
202 } else if (arg.equals("-d")) {
203 if (i < args.length) {
204 em.numDegree = new Integer(args[i++]).intValue();
206 } else if (arg.equals("-i")) {
207 if (i < args.length) {
208 em.numIter = new Integer(args[i++]).intValue();
210 } else if (arg.equals("-p")) {
211 em.printResult = true;
212 } else if (arg.equals("-m")) {
214 } else if (arg.equals("-h")) {
219 if (em.numNodes == 0 || em.numDegree == 0)
224 * The usage routine which describes the program options.
228 System.printString("usage: java Em3d -N <nodes> -d <degree> [-p] [-m] [-h]\n");
229 System.printString(" -N the number of nodes\n");
230 System.printString(" -d the out-degree of each node\n");
231 System.printString(" -i the number of iterations\n");
232 System.printString(" -p (print detailed results\n)");
233 System.printString(" -m (print informative messages)\n");
234 System.printString(" -h (this message)\n");