[Red5] performance questions

[Dan Rossi]

One for the documentation thanks heaps !!!

On 03/01/2008, at 10:52 AM, Mondain wrote:

> In your red5.properties files you can play with following settings:
>
> Set this to the number of cpus that you have
> rtmp.event_threads_core=4
>
> Set this to any multiple of 16 that gives you the best performance
> rtmp.event_threads_max=1024
>
> Set this to -1 if you want the linked blocking thread queue, 0 if  
> you want a synchronous thread queue, or to a set number 1 through  
> max-int for a array blocking queue of threads fixed to the size you  
> set.
> rtmp.event_threads_queue=0
>
> Tweak this for thread keep alive
> rtmp.event_threads_keepalive=60
>
>
> Definitions:
> LinkedBlockingQueue - An optionally-bounded blocking queue based on  
> linked nodes. This queue orders elements FIFO (first-in-first-out).  
> The head of the queue is that element that has been on the queue the  
> longest time. The tail of the queue is that element that has been on  
> the queue the shortest time. New elements are inserted at the tail  
> of the queue, and the queue retrieval operations obtain elements at  
> the head of the queue. Linked queues typically have higher  
> throughput than array-based queues but less predictable performance  
> in most concurrent applications.
>
> SynchronousQueue - A blocking queue in which each put must wait for  
> a take, and vice versa. A synchronous queue does not have any  
> internal capacity, not even a capacity of one. You cannot peek at a  
> synchronous queue because an element is only present when you try to  
> take it; you cannot add an element (using any method) unless another  
> thread is trying to remove it; you cannot iterate as there is  
> nothing to iterate. The head of the queue is the element that the  
> first queued thread is trying to add to the queue; if there are no  
> queued threads then no element is being added and the head is null.  
> For purposes of other Collection methods (for example contains), a  
> SynchronousQueue acts as an empty collection. This queue does not  
> permit null  elements.
>
> Synchronous queues are similar to rendezvous channels used in CSP  
> and Ada. They are well suited for handoff designs, in which an  
> object running in one thread must sync up with an object running in  
> another thread in order to hand it some information, event, or task.
>
> This class supports an optional fairness policy for ordering waiting  
> producer and consumer threads. By default, this ordering is not  
> guaranteed. However, a queue constructed with fairness set to true  
> grants threads access in FIFO order. Fairness generally decreases  
> throughput but reduces variability and avoids starvation.
>
> ArrayBlockingQueue - A bounded blocking queue backed by an array.  
> This queue orders elements FIFO (first-in-first-out). The head of  
> the queue is that element that has been on the queue the longest  
> time. The tail of the queue is that element that has been on the  
> queue the shortest time. New elements are inserted at the tail of  
> the queue, and the queue retrieval operations obtain elements at the  
> head of the queue.
>
> This is a classic "bounded buffer", in which a fixed-sized array  
> holds elements inserted by producers and extracted by consumers.  
> Once created, the capacity cannot be increased. Attempts to put an  
> element to a full queue will result in the put operation blocking;  
> attempts to retrieve an element from an empty queue will similarly  
> block.
>
> This class supports an optional fairness policy for ordering waiting  
> producer and consumer threads. By default, this ordering is not  
> guaranteed. However, a queue constructed with fairness set to true  
> grants threads access in FIFO order. Fairness generally decreases  
> throughput but reduces variability and avoids starvation.
>
>
>
> Paul
> _______________________________________________
> Red5 mailing list
> Red5 at osflash.org
> http://osflash.org/mailman/listinfo/red5_osflash.org

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://osflash.org/pipermail/red5_osflash.org/attachments/20080103/f79201e6/attachment.html