Abstract: Disclosed are systems and methods for implementing distributed in-memory timer queues. A plurality of queues is distributed across a plurality of nodes. The plurality of queues includes a first queue. The first queue corresponds to current timer expirations for a tenant, time bucket, and shard. A sorted set includes minute references to unacknowledged timers for a tenant and shard. A plurality of processes is created. Each of the plurality of processes is configured to be a unique consumer of the distributed plurality of queues. A first consumer group and a second consumer group are created within each of the plurality of processes. The first consumer group corresponds to the first queue. The second consumer group corresponds to the sorted set. The plurality of processes is used to proportionally consume the first queue with the first consumer group and the sorted set with the second consumer group.

Abstract: Disclosed are systems and methods for implementing distributed in-memory timer queues. A plurality of queues is distributed across a plurality of nodes. The plurality of queues includes a first queue. The first queue corresponds to current timer expirations for a tenant, time bucket, and shard. A sorted set includes minute references to unacknowledged timers for a tenant and shard. A plurality of processes is created. Each of the plurality of processes is configured to be a unique consumer of the distributed plurality of queues. A first consumer group and a second consumer group are created within each of the plurality of processes. The first consumer group corresponds to the first queue. The second consumer group corresponds to the sorted set. The plurality of processes is used to proportionally consume the first queue with the first consumer group and the sorted set with the second consumer group.

Abstract: Disclosed are systems and methods for implementing distributed in-memory timer queues. A plurality of queues is distributed across a plurality of nodes. The plurality of queues includes a first queue. The first queue corresponds to current timer expirations for a tenant, time bucket, and shard. A sorted set includes minute references to unacknowledged timers for a tenant and shard. A plurality of processes is created. Each of the plurality of processes is configured to be a unique consumer of the distributed plurality of queues. A first consumer group and a second consumer group are created within each of the plurality of processes. The first consumer group corresponds to the first queue. The second consumer group corresponds to the sorted set. The plurality of processes is used to proportionally consume the first queue with the first consumer group and the sorted set with the second consumer group.

Abstract: Various embodiments described herein support or provide operations including detecting an event associated with an entity; mapping the event to a customer-defined workflow in a journey based on content of the event; generating a tacit workflow in the journey based on the mapping of the event; and processing the tacit workflow in accordance with the one or more steps.

Abstract: Various embodiments described herein support or provide operations including detecting an event associated with an entity; determining that the event is mapped to a journey that comprises a plurality of steps configured by the entity; placing the entity in a current step in the journey; evaluating one or more factors to determine that the entity is not simultaneously placed in another step of the journey; and using a state machine to process the event based on an operation associated with a step subsequent to the current step in the journey.

Abstract: Various embodiments described herein support or provide operations including detecting an event that comprises a state object; mapping the event to a journey based on content of the event; identifying a state machine associated with the journey; and processing the event based on the state object in accordance with one or more steps defined for the journey.