Abstract: In one embodiment, a mechanism for priority inheritance for read/write locks (RW locks) is disclosed. In one embodiment, a method includes setting a maximum number of read/write locks (RW locks) allowed to be held for read by one or more tasks, maintaining an array in each of the one or more tasks to track the RW locks held for read, linking a RW lock with the array of each of the tasks that own the RW lock, and boosting a priority of each of the tasks that own the RW lock according to a priority inheritance algorithm implemented by the RW lock.

Abstract: A mechanism for detection and measurement of hardware-based processor latency is disclosed. A method of the invention includes issuing an instruction to stop all running instructions on one or more processors of a multi-core computing device, starting a latency measurement code loop on each of the one or more processors, wherein for each of the one or more processors the latency measurement code loop operates to sample a time stamp counter (TSC) for a first time reading and sample the TSC for a second time reading after a predetermined period of time, and determine whether a difference between the first and the second time readings represents a discontinuous time interval where an operating system (OS) of the computing device does not control the one or more processors.

Abstract: In one embodiment, a mechanism for a reader page for a ring buffer is disclosed. In one embodiment, a method for implementing a reader page for a ring buffer includes allocating, by a processing device, a block of storage separate from a ring buffer as a reader page for a reader of the ring buffer, the ring buffer stored in a physical memory device, and swapping, by the processing device, a head page of the ring buffer with the reader page so that the reader page is part of the ring buffer and the head page is no longer attached to the ring buffer.

Abstract: In one embodiment, a mechanism for a lockless ring buffer in overwrite mode is disclosed. In one embodiment, a method for implementing a lockless ring buffer in overwrite mode includes aligning memory addresses for each page of a ring buffer to form maskable bits in the address to be used as a state flag for the page and utilizing at least a two least significant bits of each of the addresses to represent the state flag associated with the page represented by the address, wherein the state flag indicates one of three states including a header state, an update state, and a normal state.

Abstract: In one embodiment, a mechanism for a lockless ring buffer in overwrite mode is disclosed. In one embodiment, a method for implementing a lockless ring buffer in overwrite mode includes aligning memory addresses for each page of a ring buffer to form maskable bits in the address to be used as a state flag for the page and utilizing at least a two least significant bits of each of the addresses to represent the state flag associated with the page represented by the address, wherein the state flag indicates one of three states including a header state, an update state, and a normal state.

Abstract: In one embodiment, a mechanism for a reader page for a ring buffer is disclosed. In one embodiment, a method for implementing a reader page for a ring buffer includes allocating, by a processing device, a block of storage separate from a ring buffer as a reader page for a reader of the ring buffer, the ring buffer stored in a physical memory device, and swapping, by the processing device, a head page of the ring buffer with the reader page so that the reader page is part of the ring buffer and the head page is no longer attached to the ring buffer.

Abstract: In one embodiment, a mechanism for priority inheritance for read/write locks (RW locks) is disclosed. In one embodiment, a method includes setting a maximum number of read/write locks (RW locks) allowed to be held for read by one or more tasks, maintaining an array in each of the one or more tasks to track the RW locks held for read, linking a RW lock with the array of each of the tasks that own the RW lock, and boosting a priority of each of the tasks that own the RW lock according to a priority inheritance algorithm implemented by the RW lock.