Abstract
A method (300) for distributed event queue processing includes receiving events via an application programming interface (208) and storing the events in a partitioned database queue backed by a relational database. The method includes periodically discovering queues with pending events using a query that performs atomic detection of queue enumeration and pending event status without cache-based timestamp tracking. Queue partitions are assigned to readers using epoch-based coordination and leader election. The method includes processing queues using a shared thread pool with circulating reader tasks and adaptive backoff. Events are atomically fetched and marked as consumed using epoch-fenced queries that validate partition ownership within a same database operation as event consumption. The method includes publishing events to a message broker (213) and committing or rolling back transactions to provide reliable delivery and retry. The disclosed approach is applicable as a general-purpose distributed queueing system across multiple computing environments.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Kumar, Vishnu; Thampi, Appu; Yadav, Mahendra; and Vijay, Tulika, "DISTRIBUTED EVENT QUEUE PROCESSING WITH ADAPTIVE COORDINATION AND TRANSACTIONAL DELIVERY", Technical Disclosure Commons, (June 03, 2026)
https://www.tdcommons.org/dpubs_series/10335