Steven D Rostedt

8127074, Feb 28, 2012

Jun 9, 2009

12/481376

Steven D. Rostedt - Endwell NY, US

Red Hat, Inc. - Raleigh NC

G06F 12/00

711110

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.

8495642, Jul 23, 2013

Apr 23, 2008

12/150090

Steven D. Rostedt - Endwell NY, US

Red Hat, Inc. - Raleigh NC

G06F 9/46

718103

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.

20040107189, Jun 3, 2004

Dec 3, 2002

10/308763

Douglas Burdick - Ithaca NY, US
Steven Rostedt - Endwell NY, US
Robert Szczerba - Endicott NY, US

Lockheed Martin Corporation

G06F007/00

707/003000

A system identifies similarities in data. The system includes a collection of records, a plurality of transform functions, and a cell list structure. Each record in the collection represents an entity and has a list of fields. Data is contained in each field. The plurality of transform functions operates upon the data in each field in each record. The plurality of transform functions generates a set of output values for facilitating comparison of the records and determining whether any of the records represent the same entity. The cell list structure is generated from the output values. The cell list structure has a list of cells for each field and a list of pointers to each cell of the list of cells for each output value generated by the plurality of transform functions.

20040107205, Jun 3, 2004

Dec 3, 2002

10/308740

Douglas Burdick - Ithaca NY, US
Steven Rostedt - Endwell NY, US
Robert Szczerba - Endicott NY, US

Lockheed Martin Corporation

G06F017/00
G06F007/00

707/102000

A system identifies similar records. The system includes a collection of records, a set of Boolean rules, and a cell list structure. Each record in the collection has a list of fields and data contained in each field. The set of Boolean rules operate upon the data in each field. The cell list structure is generated from the collection of records. The cell list structure has a list of cells for each field and a list of pointers to each cell of the list of cells for each record. The set of Boolean rules identifies the similar records from the cell list structure.

20040181501, Sep 16, 2004

Mar 11, 2003

10/385536

Douglas Burdick - Ithaca NY, US
Steven Rostedt - Endwell NY, US
Robert Szczerba - Endicott NY, US

Lockheed Martin Corporation

G06F007/00

707/001000

A system represents data during a data cleansing application. The system includes a record collection. Each record in the collection includes a list of fields and data contained in each field. The system further includes a predetermined sequence of operations to be performed on the record collection and a plurality of bit-maps representing the record collection. The system still further includes a partitioned sequence of operations for parallel processing of the bit-maps by a plurality of separate devices.

20100312985, Dec 9, 2010

Jun 9, 2009

12/481397

Steven D. Rostedt - Endwell NY, US

G06F 12/06

711206, 711E12078

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. The method further includes combining a movement of a head page pointer to a head page of the ring buffer with a swapping of the head page and a reader page, the combining comprising updating the state flag of the head page pointer to the normal state and updating the state flag of a pointer to the page after the head page to the header state, and moving the head page and a tail page of the ring buffer, the moving comprising updating the state flags of one or more pointers in the ring buffer associated with the head page and the tail page.

20120144171, Jun 7, 2012

Dec 7, 2010

12/962453

Jonathan Masters - Cambridge MA, US
Steven D. Rostedt - Endwell NY, US

G06F 9/30

712227, 712E09032

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.