Package aleph

Examples of aleph.Join.waitFor()

76
77
78
79
80
81
82
83
84
85
86
    long duration = 0;
    for (int j = 0; j < iterations; j++) {
      long start = System.currentTimeMillis();
      for (Iterator e = PE.allPEs(); e.hasNext(); )
        thread.start((PE) e.next(), join);
      join.waitFor();
      long stop = System.currentTimeMillis();
      duration += (stop - start);
    }
    System.out.println(howMany + "\t" + (double) duration / (double)
        iterations);
View Full Code Here
54
55
56
57
58
59
60
61
    HelloThread thread = new HelloThread();
    Join join = new Join();
    long start = System.currentTimeMillis();
    for (Iterator e = PE.allPEs(); e.hasNext(); )
      thread.start((PE) e.next(), join);
    join.waitFor();
  }
}
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
      if(level[j] > level[k]) {
        Moder m = new Moder(gb[j], gb[k]);
        m.start((PE)e.next(), join);
      }
  }
      join.waitFor();
    }
   
    //write the columns back
    for(int i=0; i<n; i++) {
      Column ctmp = (Column)gb[i].open("r");
View Full Code Here
183
184
185
186
187
188
189
190
191
192
193
      Join join = new Join();
      for(int j=k+1; j<n; j++) {
  Moder m = new Moder(gb[j], gb[k]);
  m.start((PE)e.next(), join);
      }
      join.waitFor();
    }

    //write the columns back
    for(int i=0; i<n; i++) {
      Column ctmp = (Column)gb[i].open("r");
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
      Aleph.warning("Release failed: " + ale.getMessage());
    }
    Builder builder = new Builder(gb, leftN, dir, peNo+numPE/2, numPE/2,
          minX, med, minY, maxY);
    builder.start(PE.getPE(peNo+numPE/2), jv);
    jv.waitFor();
    t = (Tree) gb.open("w");
  }
      }
     
      if (rightN == 0)
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
      Aleph.warning("Release failed: " + ale.getMessage());
    }
    Builder builder = new Builder(gb, leftN, dir, peNo+numPE/2, numPE/2,
          minX, maxX, minY, med);
    builder.start(PE.getPE(peNo+numPE/2), jv);
    jv.waitFor();
    t = (Tree) gb.open("w");
  }
      }

      if (rightN == 0)
View Full Code Here
176
177
178
179
180
181
182
183
184
185
186
    }

    t._size = n;
    t._next = null;
    t._prev = null;
    jv.waitFor();
   
    try {
      gb.release();
    } catch (AlephException ale) {
      Aleph.warning("Release failed: " + ale.getMessage());
View Full Code Here
761
762
763
764
765
766
767
768
769
770
771
  Traveler traveler = new Traveler(gb, gtleft, sz, nproc_2);
  traveler.start(pid, jv);
      }
   
      grightval = go(gtright, sz, nproc_2);
      jv.waitFor();
      return merge(gleftval, grightval, gt, nproc);
    } catch (Exception e) {
      Aleph.panic(e);
      return null;    // not reached
    }
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
    long t0 = System.currentTimeMillis();

    InitDataThread forkInitData = new InitDataThread( n );
    for (Iterator e = PE.allPEs(); e.hasNext(); )
      forkInitData.start( (PE) e.next() , join );
    join.waitFor();
    // get returned value
    while(join.hasNext()) {
      try{
        Data d = (Data)join.next();
        data[ d.pe ] = d;
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
      for ( pe = 0; pe < PE.numPEs(); pe++ ) {
        BookKeepingThread forkBookKeeping = new BookKeepingThread( data[pe] );
        forkBookKeeping.start( PE.getPE(pe), join );
      } 
      join.waitFor();
      // get returned value
      while(join.hasNext()) {
        try{
          Data d = (Data)join.next();
          data[ d.pe ] = d;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.