Abstract: A threshold mechanism is provided so that a producer and a corresponding consumer, executing on the same resource (e.g., CPU) are able to switch context between them in a manner that reduces the total number of such context switches. The threshold mechanism is associated with a buffer into which the producer stores packets up to a given threshold before the consumer is allowed to remove packets. The buffer has an associated upper limit on the number of packets that can be stored in the buffer. A flush empties the buffer of any remaining packets when no more packets are to be produced. This reduction in the total number of context switches in general leads to better performance at the cost of more latency.

Abstract: Method for dynamically allocating/de-allocating memory pools (0, 1, 2, 3) in a physical memory of a computer comprising the steps of: allocating a memory area (4) for said memory pools (0, 1, 2, 3) within said physical memory, allocating said at least one memory block (2a, 2b) within each of said at least one memory pool (0, 1, 2, 3), and writing data in said at least one memory block (2a). To enable dynamic memory allocation, and to reduce memory fragmentation it is proposed that said at least one memory block (2a) is de-allocated after said at least one memory block (2a) is marked empty, and that at least one memory block (2a) is re-allocated within said memory area (4), whereby said memory block (2a) is moved within said memory area (4) during said de-allocation/re-allocation of said at least one memory block (2a, 2b).