Patents by Inventor Joseph H. Izraelevitz

Joseph H. Izraelevitz has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Systems and methods for constructing composable persistent data structures
    Patent number: 10007581
    Abstract: A technique referred to as “data structure chronicles” is described that may be used to build strictly failure resilient persistent concurrent data structures. A “chronicle” maintains a persistent history of operations invoked on a persistent data structure that can be replayed to recover the current consistent state of the data structure after a failure. The chronicle technique may also enable composability of data structure operations with the enclosing application. In addition, the chronicle technique is non-blocking, a desirable progress condition for concurrent data structures. A lock free, non-blocking chronicle stack algorithm is described that may outperform a lock-based implementation in the presence of high contention. In addition, a lock free, non-blocking chronicle queue algorithm is described.
    Type: Grant
    Filed: January 5, 2016
    Date of Patent: June 26, 2018
    Assignee: Oracle International Corporation
    Inventors: Virendra J. Marathe, Joseph H. Izraelevitz
  • Systems and Methods for Constructing Composable Persistent Data Structures
    Publication number: 20160314044
    Abstract: A technique referred to as “data structure chronicles” is described that may be used to build strictly failure resilient persistent concurrent data structures. A “chronicle” maintains a persistent history of operations invoked on a persistent data structure that can be replayed to recover the current consistent state of the data structure after a failure. The chronicle technique may also enable composability of data structure operations with the enclosing application. In addition, the chronicle technique is non-blocking, a desirable progress condition for concurrent data structures. A lock free, non-blocking chronicle stack algorithm is described that may outperform a lock-based implementation in the presence of high contention. In addition, a lock free, non-blocking chronicle queue algorithm is described.
    Type: Application
    Filed: January 5, 2016
    Publication date: October 27, 2016
    Inventors: Virendra J. Marathe, Joseph H. Izraelevitz