Examples of java.util.concurrent.Semaphore

java.util.concurrent.Semaphore
a particularly efficient data structure; just for demo protected Object[] items = ... whatever kinds of items being managed protected boolean[] used = new boolean[MAX_AVAILABLE]; protected synchronized Object getNextAvailableItem() { for (int i = 0; i < MAX_AVAILABLE; ++i) { if (!used[i]) { used[i] = true; return items[i]; } } return null; // not reached } protected synchronized boolean markAsUnused(Object item) { for (int i = 0; i < MAX_AVAILABLE; ++i) { if (item == items[i]) { if (used[i]) { used[i] = false; return true; } else return false; } } return false; } }
Before obtaining an item each thread must acquire a permit from the semaphore, guaranteeing that an item is available for use. When the thread has finished with the item it is returned back to the pool and a permit is returned to the semaphore, allowing another thread to acquire that item. Note that no synchronization lock is held when {@link #acquire} is called as that would prevent an itemfrom being returned to the pool. The semaphore encapsulates the synchronization needed to restrict access to the pool, separately from any synchronization needed to maintain the consistency of the pool itself.
A semaphore initialized to one, and which is used such that it only has at most one permit available, can serve as a mutual exclusion lock. This is more commonly known as a binary semaphore, because it only has two states: one permit available, or zero permits available. When used in this way, the binary semaphore has the property (unlike many {@link Lock}implementations), that the "lock" can be released by a thread other than the owner (as semaphores have no notion of ownership). This can be useful in some specialized contexts, such as deadlock recovery.
The constructor for this class optionally accepts a fairness parameter. When set false, this class makes no guarantees about the order in which threads acquire permits. In particular, barging is permitted, that is, a thread invoking {@link #acquire} can be allocated a permit ahead of athread that has been waiting - logically the new thread places itself at the head of the queue of waiting threads. When fairness is set true, the semaphore guarantees that threads invoking any of the {@link #acquire() acquire} methods are selected to obtain permits in the order inwhich their invocation of those methods was processed (first-in-first-out; FIFO). Note that FIFO ordering necessarily applies to specific internal points of execution within these methods. So, it is possible for one thread to invoke {@code acquire} before another, but reach the ordering point afterthe other, and similarly upon return from the method. Also note that the untimed {@link #tryAcquire() tryAcquire} methods do nothonor the fairness setting, but will take any permits that are available.
Generally, semaphores used to control resource access should be initialized as fair, to ensure that no thread is starved out from accessing a resource. When using semaphores for other kinds of synchronization control, the throughput advantages of non-fair ordering often outweigh fairness considerations.
This class also provides convenience methods to {@link #acquire(int) acquire} and {@link #release(int) release} multiplepermits at a time. Beware of the increased risk of indefinite postponement when these methods are used without fairness set true.
Memory consistency effects: Actions in a thread prior to calling a "release" method such as {@code release()}happen-before actions following a successful "acquire" method such as {@code acquire()}in another thread. @since 1.5 @author Doug Lea

     * started to do the writing, throws an exception.
     */
    private void writeLocal() throws IOException {
        PipedInputStream in = new PipedInputStream();
        final PipedOutputStream out = new PipedOutputStream(in);
        final Semaphore semaphore = new Semaphore(0);
        final Exception[] exceptions = new Exception[1];
        new Thread("RepositoryUserAdmin writer") {
            @Override
            public void run() {
                try {
                    write(out);
                }
                catch (IOException e) {
                    m_log.log(LogService.LOG_ERROR, "Error writing out contents of RepositoryAdminUser", e);
                    exceptions[0] = e;
                }
                catch (IllegalArgumentException iae) {
                    m_log.log(LogService.LOG_ERROR, "Error writing out contents of RepositoryAdminUser", iae);
                    exceptions[0] = iae;
                }
                semaphore.release();
            }
        }.start();
        m_repository.writeLocal(in);
        try {
            if (!semaphore.tryAcquire(30, TimeUnit.SECONDS)) {
                throw new IOException("Error writing the contents of RepositoryUserAdmin.");
            }
        }
        catch (InterruptedException e) {
            Thread.currentThread().interrupt();

View Full Code Here

    }


    private static void resetStatus() {
      runStarted.release(Integer.MAX_VALUE);
      finishRun.release(Integer.MAX_VALUE);
      runStarted = new Semaphore(0);
      finishRun = new Semaphore(0);
      timesRun.set(0);
    }

View Full Code Here

        private Semaphore semaphore;


        public UserSimulator(LocalAvatar avatar) {
            super("UserSimulator");
            this.avatar = avatar;
            semaphore = new Semaphore(0);
        }

View Full Code Here

                              final String fragmentFile,
                              final ShaderVariableBinder binder)
    {
        // the sceneworker will set this value
        final MutableBoolean out = new MutableBoolean();
        final Semaphore done = new Semaphore(0);


        final String vertex = readShader(vertexFile);
         final String fragment = readShader(fragmentFile);


        SceneWorker.addWorker(new WorkCommit() {
            public void commit() {
                try {
                    RenderManager rm = ClientContextJME.getWorldManager().getRenderManager();
                    GLSLShaderObjectsState shaderState = (GLSLShaderObjectsState)rm.createRendererState(StateType.GLSLShaderObjects);
                    shaderState.setEnabled(true);
                    shaderState.load(vertex, fragment);


                    if (binder != null) {
                        binder.bind(shaderState);
                    }


                    shaderState.apply();
                } catch (GLException ex) {
                    logger.log(Level.WARNING, "Unable to load avatar sample " +
                               "shader. High quality avatars are not available.",
                               ex);
                    out.value = false;
                } finally {
                    done.release();
                }
            }
        });


        try {
            done.acquire();
            return out.value;
        } catch (InterruptedException ie) {
            return false;
        }
    }

View Full Code Here

     *                   Must be &gt;0 and &lt; {@link Integer#MAX_VALUE}.
     * @param fair <tt>true</tt> guarantees the waiting schedulers to wake up in order they acquired a permit
     */
    ThreadResourcesBalancer( int numPermits, boolean fair )
    {
        balancer = new Semaphore( numPermits, fair );
        this.numPermits = numPermits;
    }

View Full Code Here

         final int totalrepeats = 3;


         final AtomicInteger errors = new AtomicInteger(0);


         // We shouldn't have more than 10K messages pending
         final Semaphore semop = new Semaphore(10000);


         class ConsumerThread extends Thread
         {
            public void run()
            {
               try
               {
                  ServerLocator locator = HornetQClient.createServerLocatorWithoutHA(server1tc);


                  ClientSessionFactory sf = locator.createSessionFactory();


                  ClientSession session = sf.createSession(false, false);


                  session.start();


                  ClientConsumer consumer = session.createConsumer(queueName1);


                  for (int i = 0; i < numMessages; i++)
                  {
                     ClientMessage message = consumer.receive(5000);


                     Assert.assertNotNull(message);


                     message.acknowledge();
                     semop.release();
                     if (i % 1000 == 0)
                     {
                        session.commit();
                     }
                  }


                  session.commit();


                  session.close();
                  sf.close();
                  locator.close();


               }
               catch (Throwable e)
               {
                  e.printStackTrace();
                  errors.incrementAndGet();
               }
            }
         };


         class ProducerThread extends Thread
         {
            final int nmsg;
            ProducerThread(int nmsg)
            {
               this.nmsg = nmsg;
            }
            public void run()
            {
               ServerLocator locator = HornetQClient.createServerLocatorWithoutHA(server0tc);
               
               locator.setBlockOnDurableSend(false);
               locator.setBlockOnNonDurableSend(false);


               ClientSessionFactory sf = null;


               ClientSession session = null;


               ClientProducer producer = null;


               try
               {
                  sf = locator.createSessionFactory();


                  session = sf.createSession(false, true, true);


                  producer = session.createProducer(new SimpleString(testAddress));


                  for (int i = 0; i < nmsg; i++)
                  {
                     assertEquals(0, errors.get());
                     ClientMessage message = session.createMessage(true);


                     message.putIntProperty("seq", i);
                     
                     
                     if (i % 100 == 0)
                     {
                        message.setPriority((byte)(RandomUtil.randomPositiveInt() % 9));
                     }
                     else
                     {
                        message.setPriority((byte)5);
                     }


                     message.getBodyBuffer().writeBytes(new byte[50]);


                     producer.send(message);
                     assertTrue(semop.tryAcquire(1, 10, TimeUnit.SECONDS));
                  }
               }
               catch (Throwable e)
               {
                  e.printStackTrace(System.out);

View Full Code Here

        public URL url = null;


        private Job(JobType jobType, ImiAvatar avatar) {
            this.jobType = jobType;
            this.avatar = avatar;
            this.jobDone = new Semaphore(0);
            this.url = null;
        }

View Full Code Here

        private final URI uri;


        private Pool(final URI uri, final int size, final long timeout) {
            this.uri = uri;
            this.size = size;
            this.semaphore = new Semaphore(size);
            this.pool = new Stack<SocketConnection>();
            this.timeout = timeout;
            this.timeUnit = TimeUnit.MILLISECONDS;


            for (int i = 0; i < size; i++) {

View Full Code Here


    public static class Parallel {


        public static void exec(Runnable... runnables) {
            final int permits = 2;
            final Semaphore semaphore = new Semaphore(permits);


            for (Runnable runnable : runnables) {
                try {
                    semaphore.acquire();
                    final Thread thread = new Thread();
                    thread.setDaemon(true);
                    thread.start();
                } catch (InterruptedException e) {
                    Thread.interrupted();
                }
            }
            try {
                semaphore.acquire(permits);
            } catch (InterruptedException e) {
                Thread.interrupted();
            }
        }

View Full Code Here

        private Semaphore semaphore;
        
        public Data(int poolLimit, boolean strictPooling) {
            pool = new LinkedListStack(poolLimit);
            if (strictPooling) {
                semaphore = new Semaphore(poolLimit);
            }
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.concurrent.Semaphore

avrobase.redis.RABTest

com.alipay.bluewhale.core.drpc.Drpc

com.alu.e3.gateway.ApiDeploymentManager

com.amazonaws.services.simpleworkflow.flow.worker.ActivityTaskPoller

com.basho.riak.client.api.commands.kv.MultiFetch$Submitter

com.basho.riak.client.raw.pbc.PBClusterClient

com.basho.riak.pbc.RiakConnectionPool

com.bitsofproof.supernode.api.JMSServerConnector

com.facebook.presto.hive.HiveSplitIterable

com.facebook.presto.hive.HiveSplitSourceProvider

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.