| CPC G06F 9/52 (2013.01) [G06F 9/4881 (2013.01)] | 20 Claims |

|
1. A computerized method for scalable, correct, and high-performance asynchronous lockless sharing of a computer resource comprising:
determining there is a contention for a shared computer resource by a plurality of competing processes, wherein the plurality of competing processes are competing to access a same portion of the shared resource;
adding the plurality of competing processes to a priority queue;
retrieving a process at a front of the queue of the plurality of competing processes;
access a work area of the process at a front of the queue;
sharing the work area with other processes of the plurality of competing processes in priority queue;
sanitizing the work area to obtain a plurality of code bundles;
placing the code bundles into a patchpointer; and
processing the patchpointer until the patchpointer is empty.
|