Examples of com.facebook.presto.jdbc.internal.netty.handler.execution.OrderedMemoryAwareThreadPoolExecutor

• com.facebook.presto.jdbc.internal.netty.handler.execution.OrderedMemoryAwareThreadPoolExecutor
  default implementation returns a special ConcurrentMap that // uses identity comparison only (see {@link IdentityHashMap}). // Because SocketAddress does not work with identity comparison, // we need to employ more generic implementation. return new ConcurrentHashMap<Object, Executor> } protected Object getChildExecutorKey( {@link ChannelEvent} e) {// Use the IP of the remote peer as a key. return ((InetSocketAddress) e.getChannel().getRemoteAddress()).getAddress(); } // Make public so that you can call from anywhere. public boolean removeChildExecutor(Object key) { super.removeChildExecutor(key); } } Please be very careful of memory leak of the child executor map. You must call {@link #removeChildExecutor(Object)} when the life cycle of the keyends (e.g. all connections from the same IP were closed.) Also, please keep in mind that the key can appear again after calling {@link #removeChildExecutor(Object)}(e.g. a new connection could come in from the same old IP after removal.) If in doubt, prune the old unused or stall keys from the child executor map periodically:

   RemoteAddressBasedOMATPE executor = ...; on every 3 seconds: for (Iterator<Object> i = executor.getChildExecutorKeySet().iterator; i.hasNext();) { InetAddress ip = (InetAddress) i.next(); if (there is no active connection from 'ip' now && there has been no incoming connection from 'ip' for last 10 minutes) { i.remove(); } } 

  If the expected maximum number of keys is small and deterministic, you could use a weak key map such as ConcurrentWeakHashMap or synchronized {@link WeakHashMap} instead of managing the life cycle of thekeys by yourself. @apiviz.landmark

Related Classes of com.facebook.presto.jdbc.internal.netty.handler.execution.OrderedMemoryAwareThreadPoolExecutor