Patents by Inventor Daniel Jonathan Kurtz

Daniel Jonathan Kurtz 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).

  • Management of configuration data using persistent memories requiring block-wise erase before rewriting
    Patent number: 8321626
    Abstract: According to an aspect, the values corresponding to each group of parameters are stored in successive memory locations of a set of blocks, and pointer locations are maintained to point to the area where the groups of values are stored. When a new value is received for a parameter of a group, the values of parameters (with the new value substituted for the corresponding old value) of the group are replicated to a new set of locations in the same set of blocks if sufficient number of successive unwritten memory locations are available. A pointer data from the prior set of locations to the new set of locations is also maintained. According to another aspect, when there is insufficient space for the replication, all the present valid values of all groups are first written to a new set of blocks, and then only the earlier set of blocks are erased.
    Type: Grant
    Filed: March 31, 2010
    Date of Patent: November 27, 2012
    Assignee: Gainspan Corporation
    Inventors: Indudharswamy G Hiremath, Daniel Jonathan Kurtz, Sibasis Purohit, Vishal Batra
  • Management Of Configuration Data Using Persistent Memories Requiring Block-Wise Erase Before Rewriting
    Publication number: 20110246702
    Abstract: According to an aspect, the values corresponding to each group of parameters are stored in successive memory locations of a set of blocks, and pointer locations are maintained to point to the area where the groups of values are stored. When a new value is received for a parameter of a group, the values of parameters (with the new value substituted for the corresponding old value) of the group are replicated to a new set of locations in the same set of blocks if sufficient number of successive unwritten memory locations are available. A pointer data from the prior set of locations to the new set of locations is also maintained. According to another aspect, when there is insufficient space for the replication, all the present valid values of all groups are first written to a new set of blocks, and then only the earlier set of blocks are erased.
    Type: Application
    Filed: March 31, 2010
    Publication date: October 6, 2011
    Applicant: GainSpan Corporation
    Inventors: Indudharswamy G. Hiremath, Daniel Jonathan Kurtz, Sibasis Purohit, Vishal Batra