Runtime Synchronization Event Reporting for Thread Contention

The patent segments the monolithic locking mechanism into fine-grained locks organized in a lock graph data structure. Instead of using a single global lock that blocks all threads, the system divides resources into multiple independently lockable segments, allowing threads to access different segments concurrently without mutual blocking, thus maintaining data consistency while improving throughput

The patent introduces a lock graph as an intermediary data structure that mediates between multiple locks and threads. The lock graph tracks lock acquisition states, detects potential deadlocks before they occur, and manages lock ordering. This intermediary enables coordinated access to shared resources while preventing the blocking and deadlock conditions that would otherwise reduce throughput

The lock graph serves multiple functions simultaneously: it tracks which locks are held by which threads, detects potential deadlocks through cycle detection algorithms, manages lock ordering to prevent deadlocks, and provides a unified interface for fine-grained locking. By consolidating these multiple functions into a single data structure, the patent manages complexity while achieving high throughput

The system implements feedback mechanisms where the lock graph continuously monitors lock acquisition and release events, dynamically updating its internal state. When a thread attempts to acquire a lock, the system checks the lock graph for potential deadlocks and adjusts lock granting decisions based on current system state. This feedback loop enables automatic deadlock prevention without requiring complex manual synchronization logic