Patents by Inventor Douglas Earl Zongker

Douglas Earl Zongker 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).

  • Minimizing image copying during partition updates
    Patent number: 10055216
    Abstract: Apparatus and methods for updating binary images are described. A computing device can determine transfers for updating a binary source image to become a binary target image. A transfer can include a source memory reference for the source image and a target memory reference for the target image. The computing device can determine a graph based on ordering dependencies between the transfers. The graph can include vertices for the transfers with edges between vertices. The computing device can generate an edge from a first vertex for a first transfer to a second vertex for a second transfer, with the first transfer to be performed before the second transfer. The computing device can break any cycles present in the graph to obtain an acyclic graph. The computing device can order the transfers based on the acyclic graph and send the ordered transfers in an update package for the source image.
    Type: Grant
    Filed: May 31, 2017
    Date of Patent: August 21, 2018
    Assignee: Google LLC
    Inventor: Douglas Earl Zongker
  • Minimizing image copying during partition updates
    Patent number: 9778926
    Abstract: Disclosed are apparatus and methods for updating binary images. A computing device can determine transfers for updating a binary source image to become a binary target image. A transfer can include a source memory reference for the source image and a target memory reference for the target image. The computing device can determine a graph based on ordering dependencies between the transfers. The graph can include vertices for the transfers with edges between vertices. The computing device can generate an edge from a first vertex for a first transfer to a second vertex for a second transfer, with the first transfer to be performed before the second transfer. The computing device can break any cycles present in the graph to obtain an acyclic graph. The computing device can order the transfers based on the acyclic graph and send the ordered transfers in an update package for the source image.
    Type: Grant
    Filed: October 30, 2014
    Date of Patent: October 3, 2017
    Assignee: Google Inc.
    Inventor: Douglas Earl Zongker
  • Minimizing Image Copying During Partition Updates
    Publication number: 20170262276
    Abstract: Disclosed are apparatus and methods for updating binary images. A computing device can determine transfers for updating a binary source image to become a binary target image. A transfer can include a source memory reference for the source image and a target memory reference for the target image. The computing device can determine a graph based on ordering dependencies between the transfers. The graph can include vertices for the transfers with edges between vertices. The computing device can generate an edge from a first vertex for a first transfer to a second vertex for a second transfer, with the first transfer to be performed before the second transfer. The computing device can break any cycles present in the graph to obtain an acyclic graph. The computing device can order the transfers based on the acyclic graph and send the ordered transfers in an update package for the source image.
    Type: Application
    Filed: May 31, 2017
    Publication date: September 14, 2017
    Inventor: Douglas Earl Zongker
  • Minimizing Image Copying During Partition Updates
    Publication number: 20160124739
    Abstract: Disclosed are apparatus and methods for updating binary images. A computing device can determine transfers for updating a binary source image to become a binary target image. A transfer can include a source memory reference for the source image and a target memory reference for the target image. The computing device can determine a graph based on ordering dependencies between the transfers. The graph can include vertices for the transfers with edges between vertices. The computing device can generate an edge from a first vertex for a first transfer to a second vertex for a second transfer, with the first transfer to be performed before the second transfer. The computing device can break any cycles present in the graph to obtain an acyclic graph. The computing device can order the transfers based on the acyclic graph and send the ordered transfers in an update package for the source image.
    Type: Application
    Filed: October 30, 2014
    Publication date: May 5, 2016
    Inventor: Douglas Earl Zongker