Abstract: A method for managing events. A first event 16 is received by an event engine from one of a multitude of sources. A rule which matches the event is extracted from a database 31. When the rule specifies that the event is to be held the event engine holds 22 the event for a specified time. Certain events received during that time are caught by the engine. At the expiration of the time a new event relating to the first event and captured events is created 24. The new event is fed-back 30 into the engine. Other methods for managing events wherein the event is held by an event engine and new events are fed-back into the event engine are disclosed. Systems for implementing the methods are further disclosed.

Abstract: A call management method includes receiving an incoming call and transferring the call to an intended recipient device. If the recipient device does not answer the incoming call, the call is transferred to an intranet gateway. If the intended recipient is logged on to the intranet or is otherwise accessible on the network, the intranet gateway determines the network location of the intended recipient and transfers the call to the intended recipient. If the intended recipient is inaccessible, the incoming call is transferred to a call recordation system.

Abstract: A method for managing a memory pool containing memory blocks between a producer thread and a consumer thread running in parallel within a process is disclosed. The method places free memory blocks in a first group in the memory pool and allocates on demand a memory block from the first group to the producer thread. The allocated memory block is shared between the producer thread and the consumer thread. Once the allocated memory block is no longer required, the consumer thread deallocates the allocated memory block by placing the deallocated memory block in a second group of the memory pool. Deallocated memory blocks in the second group are moved to a third group only when the third group is empty. Memory blocks in the third group are moved to the first group only when the third group is non-empty. A locking mechanism is not required in such a multi-threaded environment.

Abstract: A method for managing a memory pool containing memory blocks between a producer thread and a consumer thread running in parallel within a process is disclosed. The method places free memory blocks in a first group in the memory pool and allocates on demand a memory block from the first group to the producer thread. The allocated memory block is shared between the producer thread and the consumer thread. Once the allocated memory block is no longer required, the consumer thread deallocates the allocated memory block by placing the deallocated memory block in a second group of the memory pool. Deallocated memory blocks in the second group are moved to a third group only when the third group is empty. Memory blocks in the third group are moved to the first group only when the third group is non-empty. A locking mechanism is not required in such a multi-threaded environment.