Patents by Inventor Bryan Karr

Bryan Karr 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).

  • Patent number: 11409447
    Abstract: A computer-implemented method of resizing a data structure includes storing a first hash index comprising x elements, wherein x is a positive integer greater than two, determining that the first hash index needs to expand, allocating a second hash index, wherein the second index contains at least x+1 elements, attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index, attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index, where only one of the first thread or the second thread will advance the first pointer based on an atomic operation.
    Type: Grant
    Filed: April 10, 2019
    Date of Patent: August 9, 2022
    Assignee: TRAVELPORT, LP
    Inventor: Bryan Karr
  • Patent number: 10303383
    Abstract: A computer-implemented method of resizing a data structure includes storing a first hash index comprising x elements, wherein x is a positive integer greater than two, determining that the first hash index needs to expand, allocating a second hash index, wherein the second index contains at least x+1 elements, attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index, attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index, where only one of the first thread or the second thread will advance the first pointer based on an atomic operation.
    Type: Grant
    Filed: December 9, 2016
    Date of Patent: May 28, 2019
    Assignee: TRAVELPORT, LP
    Inventor: Bryan Karr
  • Patent number: 10013235
    Abstract: Systems and methods of queuing data for multiple readers and writers are provided. Enqueuing operations are disclosed that can process write functionality and can determine whether ring buffers have potentially filled, and dynamically declare a new ring buffer at a multiple of capacity of the current ring. Dequeuing operations are disclosed that can process read functionality for advancing control and determining whether and when to free ring buffers from memory.
    Type: Grant
    Filed: June 13, 2014
    Date of Patent: July 3, 2018
    Assignee: TRAVELPORT, LP
    Inventor: Bryan Karr
  • Publication number: 20160070535
    Abstract: Systems and methods of queuing data for multiple readers and writers are provided. Enqueuing operations are disclosed that can process write functionality and can determine whether ring buffers have potentially filled, and dynamically declare a new ring buffer at a multiple of capacity of the current ring. Dequeuing operations are disclosed that can process read functionality for advancing control and determining whether and when to free ring buffers from memory.
    Type: Application
    Filed: June 13, 2014
    Publication date: March 10, 2016
    Inventor: Bryan Karr