Patents by Inventor Grzegorz Czajkowski

Grzegorz Czajkowski 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: 10268777
    Abstract: Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.
    Type: Grant
    Filed: August 10, 2015
    Date of Patent: April 23, 2019
    Assignee: Google LLC
    Inventors: Aart J. C. Bik, James C. Dehnert, Matthew H. Austern, Grzegorz Czajkowski
  • Publication number: 20180285477
    Abstract: Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.
    Type: Application
    Filed: August 10, 2015
    Publication date: October 4, 2018
    Inventors: Aart J.C. Bik, James C. Dehnert, Matthew H. Austern, Grzegorz Czajkowski
  • Patent number: 9870631
    Abstract: Data are maintained in a distributed computing system that describe a directed graph representing relationships among items. The directed graph has a plurality of vertices representing the items and has edges with values representing distances between the items connected by the vertices. A multiple reference point algorithm is executed for a plurality of the vertices in the directed graph in parallel for a series of synchronized iterations to determine shortest distances between the vertices and the source vertex. After executing the algorithm on the vertices, value pairs associated with the vertices are aggregated. The aggregated value pairs indicate shortest distances from the respective vertices to the source vertex. The aggregated value pairs are outputted.
    Type: Grant
    Filed: August 31, 2015
    Date of Patent: January 16, 2018
    Assignee: Google Inc.
    Inventors: Mohamed Elbassiony Mohamed Abou El Alaa Khalefa, Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz
  • Patent number: 9819731
    Abstract: A value is distributed in a distributed computing system having a master system in communication with a plurality of worker systems. Partitions of a graph are assigned to the worker systems. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. Configuration information is determined that describes a configuration of the distributed computing system. A distribution scheme is selected for distributing a value from the master system to the plurality of worker systems based on the configuration information. The value is distributed from the master system to the worker systems according to the selected distribution scheme. The worker systems are configured to use the value to produce an output representing a solution to the real-world problem.
    Type: Grant
    Filed: June 9, 2016
    Date of Patent: November 14, 2017
    Assignee: Google Inc.
    Inventors: Matthew Harold Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski
  • Patent number: 9727425
    Abstract: Executing a confined recovery in a distributed system having a plurality of worker systems including a failed worker system at a current superstep. The confined recovery includes determining states of the partitions of the worker systems during the supersteps preceding the current superstep, and determining a recovery initiation superstep preceding the current superstep in which all messages for recovery initiation superstep are available. The recovery initiation superstep is determined responsive to determining the states of the partitions. Additionally, a recovery set of partitions is determined for which messages in supersteps after the recovery initiation superstep are not available. The worker systems having the partitions in the recovery set are instructed to execute the defined function for the partitions in the recovery set starting at the recovery initiation superstep to recover the lost exchanged messages.
    Type: Grant
    Filed: May 4, 2015
    Date of Patent: August 8, 2017
    Assignee: Google Inc.
    Inventors: Grzegorz Malewicz, Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski
  • Patent number: 9652876
    Abstract: Data are maintained in a distributed computing system that describe a graph. The graph represents relationships among items. The graph has a plurality of vertices that represent the items and a plurality of edges connecting the plurality of vertices. At least one vertex of the plurality of vertices includes a set of label values indicating the at least one vertex's strength of association with a label from a set of labels. The set of labels describe possible characteristics of an item represented by the at least one vertex. At least one edge of the plurality of edges includes a set of label weights for influencing label values that traverse the at least one edge. A label propagation algorithm is executed for a plurality of the vertices in the graph in parallel for a series of synchronized iterations to propagate labels through the graph.
    Type: Grant
    Filed: July 23, 2014
    Date of Patent: May 16, 2017
    Assignee: Google Inc.
    Inventors: Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz
  • Patent number: 9495477
    Abstract: Data are maintained in a distributed computing system that describe a directed graph representing relationships among a set of items. The directed graph models a condition having an associated problem. The directed graph has graph components having associated data fields. The relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified responsive to an operation performed during the analysis. The new value is compared with an existing value of the data field, and the data field is modified. The modification may include inserting the new value into an overflow vector of data, and replacing the existing value in the data field with exception information identifying the location of the new value. An exception flag associated with the data field is set to indicate that the exception information is being used.
    Type: Grant
    Filed: January 19, 2012
    Date of Patent: November 15, 2016
    Assignee: Google Inc.
    Inventors: James C. Dehnert, Matthew H. Austern, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz, Ilan Horn, Naty Leiser
  • Patent number: 9385845
    Abstract: A value is distributed in a distributed computing system having a master system in communication with a plurality of worker systems. Partitions of a graph are assigned to the worker systems. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. Configuration information is determined that describes a configuration of the distributed computing system. A distribution scheme is selected for distributing a value from the master system to the plurality of worker systems based on the configuration information. The value is distributed from the master system to the worker systems according to the selected distribution scheme. The worker systems are configured to use the value to produce an output representing a solution to the real-world problem.
    Type: Grant
    Filed: April 17, 2012
    Date of Patent: July 5, 2016
    Assignee: Google Inc.
    Inventors: Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz
  • Patent number: 9135565
    Abstract: Data are maintained in a distributed computing system that describe a directed graph representing relationships among items. The directed graph has a plurality of vertices representing the items and has edges with values representing distances between the items connected by the vertices. A multiple reference point algorithm is executed for a plurality of the vertices in the directed graph in parallel for a series of synchronized iterations to determine shortest distances between the vertices and the source vertex. After executing the algorithm on the vertices, value pairs associated with the vertices are aggregated. The aggregated value pairs indicate shortest distances from the respective vertices to the source vertex. The aggregated value pairs are outputted.
    Type: Grant
    Filed: April 20, 2012
    Date of Patent: September 15, 2015
    Assignee: Google Inc.
    Inventors: Mohamed Elbassiony Mohamed Abou El Alaa Khalefa, Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz
  • Patent number: 9104665
    Abstract: Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.
    Type: Grant
    Filed: April 19, 2012
    Date of Patent: August 11, 2015
    Assignee: Google Inc.
    Inventors: Aart J. C. Bik, James C. Dehnert, Matthew H. Austern, Grzegorz Czajkowski
  • Patent number: 9026850
    Abstract: Executing a confined recovery in a distributed system having a plurality of worker systems including a failed worker system at a current superstep. The confined recovery includes determining states of the partitions of the worker systems during the supersteps preceding the current superstep, and determining a recovery initiation superstep preceding the current superstep in which all messages for recovery initiation superstep are available. The recovery initiation superstep is determined responsive to determining the states of the partitions. Additionally, a recovery set of partitions is determined for which messages in supersteps after the recovery initiation superstep are not available. The worker systems having the partitions in the recovery set are instructed to execute the defined function for the partitions in the recovery set starting at the recovery initiation superstep to recover the lost exchanged messages.
    Type: Grant
    Filed: April 19, 2012
    Date of Patent: May 5, 2015
    Assignee: Google Inc.
    Inventors: Grzegorz Malewicz, Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski
  • Patent number: 8880941
    Abstract: Instructing a plurality of worker systems in a distributed computing system to perform a checkpoint. Instructing the worker systems includes receiving timing messages from the plurality of worker systems and determining, based on the received timing messages, a common checkpoint time indicating an estimated amount of time to be taken by the plurality of worker systems to write data to the persistent storage for a subsequent checkpoint. The common checkpoint time is used to determine a checkpoint threshold, and responsive to the determined checkpoint threshold, it is determined whether to perform the checkpoint. Responsive to determining to perform the checkpoint, messages are transmitted to the plurality of worker systems instructing the worker systems to perform the checkpoint.
    Type: Grant
    Filed: April 20, 2012
    Date of Patent: November 4, 2014
    Assignee: Google Inc.
    Inventors: Charles Reiss, Grzegorz Malewicz, Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski
  • Patent number: 8793283
    Abstract: Data are maintained in a distributed computing system that describe a graph. The graph represents relationships among items. The graph has a plurality of vertices that represent the items and a plurality of edges connecting the plurality of vertices. At least one vertex of the plurality of vertices includes a set of label values indicating the at least one vertex's strength of association with a label from a set of labels. The set of labels describe possible characteristics of an item represented by the at least one vertex. At least one edge of the plurality of edges includes a set of label weights for influencing label values that traverse the at least one edge. A label propagation algorithm is executed for a plurality of the vertices in the graph in parallel for a series of synchronized iterations to propagate labels through the graph.
    Type: Grant
    Filed: April 20, 2012
    Date of Patent: July 29, 2014
    Assignee: Google Inc.
    Inventors: Matthew H. Austern, James C. Dehnert, Aart J. C. Bik, Grzegorz Czajkowski, Grzegorz Malewicz
  • Patent number: 8645429
    Abstract: Resolving conflicting graph mutations in a distributed computing system. Graph data for at least a partition of a graph is stored in a worker system of a distributed computing system. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. A plurality of conflicting mutation requests are received to mutate the graph. A conflict between the mutation requests is resolved with a conflict resolution function that lacks direct access to the graph data. The graph data is updated responsive to a result generated by resolving the conflict using the conflict resolution function.
    Type: Grant
    Filed: March 28, 2012
    Date of Patent: February 4, 2014
    Assignee: Google Inc.
    Inventors: Aart J. C. Bik, Matthew H. Austern, James C. Dehnert, Grzegorz Czajkowski, Grzegorz Malewicz, Naty Leiser
  • Patent number: 7945920
    Abstract: Disclosed techniques ensure that isolates that are attached to a shared object region will see appropriate class states. In response to an isolate's attempt to instantiate, in such a region, an object that is an instance of a particular class, a bootstrap class' identity is added to that region's bootstrap class list. In response to an isolate's attempt to attach to the region, each class that is both (a) in the region's associated bootstrap class list, and (b) not yet initialized for that isolate, is initialized for that isolate. Thus, those bootstrap classes are seen by that isolate as being in the “initialized” state. In response to an isolate's addition of a particular bootstrap class to the region's list of dependent bootstrap classes, the particular bootstrap class is initialized for each of the isolates attached to the region and for which the bootstrap class is not initialized yet.
    Type: Grant
    Filed: September 19, 2006
    Date of Patent: May 17, 2011
    Assignee: Oracle America, Inc.
    Inventors: Grzegorz Czajkowski, Laurent Daynes, Michal Wegiel
  • Patent number: 7840967
    Abstract: A technique for allowing isolated JAVA applications (“isolates”) to share data between themselves is disclosed. According to one aspect, a shared object region, to which multiple isolates may attach, is defined in memory. A shared class loader associated with the region is stored in the region in conjunction with the region's creation. Isolates that can access the region can invoke that loader. The region only comprises objects whose type is defined by a bootstrap class loader or the region's associated shared class loader. Runtime representations of classes defined by the shared class loader are stored in the region. Thus, the types of objects stored in the region are known to all isolates that attach to the region. Isolates attached to the region may enter the context of the region to access objects stored therein. Within the context of a shared object region, all allocation instructions automatically allocate to that region.
    Type: Grant
    Filed: July 6, 2006
    Date of Patent: November 23, 2010
    Assignee: Oracle America, Inc.
    Inventors: Grzegorz Czajkowski, Laurent Daynes, Michal Wegiel
  • Patent number: 7761872
    Abstract: A method is provided to virtualize a mutually exclusive lock of a shared immutable object. A determination is made whether any threads have locked the immutable shared object. If threads have not locked the immutable shared object, threads of different tasks are allowed to fast lock and unlock the immutable shared object. If a thread requests the lock of an immutable shared object and the object is fast locked by another thread when both threads are from an equivalent task, the lock of the immutable shared object is inflated and the requesting thread is blocked. If a thread requests the lock of an immutable shared object and the object is fast locked by another thread when both threads are from different tasks, the lock of the immutable shared object is virtualized and granted to the requesting thread.
    Type: Grant
    Filed: March 1, 2006
    Date of Patent: July 20, 2010
    Assignee: Oracle America, Inc.
    Inventors: Laurent Daynès, Grzegorz Czajkowski
  • Patent number: 7665075
    Abstract: A method for sharing dynamically compiled code between different class loaders is provided. In this method, loader-reentrant compiled code is produced from bytecodes by generating native code implementing a class initialization barrier when compiling bytecodes that require a class to be initialized, by generating native code implementing a link resolution barrier when compiling bytecodes that require a symbolic link to be resolved, and by generating code to retrieve loader-dependent data from a loader-dependent table when compiling bytecodes that use data computed from a resolved symbolic link.
    Type: Grant
    Filed: May 18, 2004
    Date of Patent: February 16, 2010
    Assignee: Sun Microsystems, Inc.
    Inventors: Laurent Daynes, Grzegorz Czajkowski
  • Patent number: 7644402
    Abstract: A method for reducing a usage of main memory by a first class loader and a second class loader is provided. The first class loader and the second class loader are capable of dynamically loading a class having a class file, and translating the class file into a first and a second class type, respectively. The method includes dividing a runtime representation of the first class type into a first loader independent part and a first loader dependent part. Also included is determining whether a runtime representation of the second class type can use the first loader independent part of the runtime representation of the first class type. If the first loader independent part can be used, the method includes generating a second loader dependent part of the runtime representation of the second class type using the first loader independent part of the runtime representation of the first class type.
    Type: Grant
    Filed: March 17, 2004
    Date of Patent: January 5, 2010
    Assignee: Sun Microsystems, Inc.
    Inventors: Laurent Daynes, Grzegorz Czajkowski
  • Patent number: 7526760
    Abstract: A method for implementing virtual method invocation when a compiled code of an invoked method is shared between class types that share a runtime representation is provided. In this method, an entry of an inline cache is set to a reference to an object. Subsequently, instructions for calling code are modified and the inline cache is set to be in one of an unresolved state, a monomorphic state, a shared monomorphic state, or a megamorphic state. A computer readable medium and a system for implementing virtual method invocation are also described.
    Type: Grant
    Filed: November 5, 2004
    Date of Patent: April 28, 2009
    Assignee: Sun Microsystems, Inc.
    Inventors: Laurent Daynes, Grzegorz Czajkowski