Examples of java.util.concurrent.ThreadPoolExecutor.submit()

Class java.util.concurrent.ThreadPoolExecutor

Examples of java.util.concurrent.ThreadPoolExecutor.submit()

java.util.concurrent.ThreadPoolExecutor.submit()

            }
        };
        
        // send two tasks through the stage: one to follow existing tasks and a second to follow tasks created by
        // those existing tasks: tasks won't recursively create more tasks
        stage.submit(noop).get(5000, TimeUnit.MILLISECONDS);
        stage.submit(noop).get(5000, TimeUnit.MILLISECONDS);
    }
}

View Full Code Here

        };
        
        // send two tasks through the stage: one to follow existing tasks and a second to follow tasks created by
        // those existing tasks: tasks won't recursively create more tasks
        stage.submit(noop).get(5000, TimeUnit.MILLISECONDS);
        stage.submit(noop).get(5000, TimeUnit.MILLISECONDS);
    }
}

View Full Code Here

          };


          if (executor == null) {
            r.run();
          } else {
            Future<?> result = executor.submit(r);
            results.add(result);
          }
        }


        if (executor != null) {

View Full Code Here

            for (TokenRange range : masterRangeNodes)
            {
                if (jobRange == null)
                {
                    // for each range, pick a live owner and ask it to compute bite-sized splits
                    splitfutures.add(executor.submit(new SplitCallable(range, conf)));
                }
                else
                {
                    Range<Token> dhtRange = new Range<Token>(partitioner.getTokenFactory().fromString(range.start_token),
                                                             partitioner.getTokenFactory().fromString(range.end_token),

View Full Code Here

                        for (Range<Token> intersection: dhtRange.intersectionWith(jobRange))
                        {
                            range.start_token = partitioner.getTokenFactory().toString(intersection.left);
                            range.end_token = partitioner.getTokenFactory().toString(intersection.right);
                            // for each range, pick a live owner and ask it to compute bite-sized splits
                            splitfutures.add(executor.submit(new SplitCallable(range, conf)));
                        }
                    }
                }
            }

View Full Code Here


    // Split each store file.
    for (Map.Entry<byte[], List<StoreFile>> entry: hstoreFilesToSplit.entrySet()) {
      for (StoreFile sf: entry.getValue()) {
        StoreFileSplitter sfs = new StoreFileSplitter(entry.getKey(), sf);
        futures.add(threadPool.submit(sfs));
      }
    }
    // Shutdown the pool
    threadPool.shutdown();

View Full Code Here

          } catch (InterruptedException ie) { }
        }
      });
    }
    // First, add two threads and make sure the pool size follows
    pool.submit(threads.get(0));
    assertEquals(1, pool.getPoolSize());
    pool.submit(threads.get(1));
    assertEquals(2, pool.getPoolSize());


    // Next, terminate those threads and then make sure the pool is still the

View Full Code Here

      });
    }
    // First, add two threads and make sure the pool size follows
    pool.submit(threads.get(0));
    assertEquals(1, pool.getPoolSize());
    pool.submit(threads.get(1));
    assertEquals(2, pool.getPoolSize());


    // Next, terminate those threads and then make sure the pool is still the
    // same size
    queue.put(new Object());

View Full Code Here

    threads.get(1).join();
    assertEquals(2, pool.getPoolSize());


    // Now let's simulate adding a RS meaning that we'll go up to three
    // concurrent threads. The pool should not grow larger than three.
    pool.submit(threads.get(2));
    pool.submit(threads.get(3));
    pool.submit(threads.get(4));
    assertEquals(3, pool.getPoolSize());
    queue.put(new Object());
    queue.put(new Object());

View Full Code Here

    assertEquals(2, pool.getPoolSize());


    // Now let's simulate adding a RS meaning that we'll go up to three
    // concurrent threads. The pool should not grow larger than three.
    pool.submit(threads.get(2));
    pool.submit(threads.get(3));
    pool.submit(threads.get(4));
    assertEquals(3, pool.getPoolSize());
    queue.put(new Object());
    queue.put(new Object());
    queue.put(new Object());

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.