Patents by Inventor Wojciech Golab
Wojciech Golab 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: 9690679Abstract: An embodiment provides a system and method for transaction commitment and replication. The method includes receiving a minitransaction from a client node at one or more memory nodes, wherein each memory node includes a number of replicas. The minitransaction is a type of transaction which atomically executes any combination of reading, comparing, and writing to any of a number of memory locations. The method also includes determining, for a leader of the replicas within a memory node, whether the leader is able to commit the minitransaction and stabilizing state changes of the minitransaction within a transaction log using a consensus procedure to update the replicas. The method further includes committing the minitransaction if, at each memory node, a quorum of the replicas is able to stabilize the minitransaction, or aborting the minitransaction otherwise.Type: GrantFiled: October 31, 2011Date of Patent: June 27, 2017Assignee: Hewlett Packard Enterprise Development LPInventors: Mehul A. Shah, Wojciech Golab, Indrajit Roy, Nathan Lorenzo Binkert, Stavros Harizopoulos
-
Patent number: 9576619Abstract: A shiftable memory supporting atomic operation employs built-in shifting capability to shift a contiguous subset of data from a first location to a second location within memory during an atomic operation. The shiftable memory includes the memory to store data. The memory has the built-in shifting capability. The shiftable memory further includes an atomic primitive defined on the memory to operate on the contiguous subset.Type: GrantFiled: October 27, 2011Date of Patent: February 21, 2017Assignee: Hewlett Packard Enterprise Development LPInventors: Wojciech Golab, Matthew D. Pickett, Alan H. Karp
-
Patent number: 9465648Abstract: A system includes an initiator and processing nodes. The initiator distributes portions of a transaction among the processing nodes. Each processing node has at least one downstream neighbor to which the processing node sends commit messages. The commit messages include a commit status of the processing node. The downstream neighbor is also a processing node.Type: GrantFiled: July 31, 2012Date of Patent: October 11, 2016Assignee: Hewlett Packard Enterprise Development LPInventors: Alan H. Karp, Wojciech Golab, Terence P. Kelly, Dhruva Chakrabarti
-
Patent number: 9292566Abstract: Based on events corresponding to operations performed with respect to a data store, a measure is computed that represents an instantaneous consistency level, at a point in time, of data that is subject to the operations.Type: GrantFiled: July 30, 2012Date of Patent: March 22, 2016Assignee: Hewlett Packard Enterprise Development LPInventors: Wojciech Golab, John Johnson Wylie
-
Publication number: 20150370655Abstract: Example methods and apparatus disclose supporting extended writes to a memory.Type: ApplicationFiled: March 15, 2013Publication date: December 24, 2015Inventors: Joseph A. Tucek, Mark David Lillibridge, Wojciech Golab
-
Patent number: 8909987Abstract: In one example, a method for implementing recovery segments includes sending an application message from a parent process executed by a first computing device to a child process executed by a second computing device and identifying a dependency created by the application message. This identified dependency is included in a dependence set of the child process and saved. A checkpoint is generated by the parent process and a checkpoint message that includes dependency information is sent from the parent process to the child process. The child process modifies the dependence set according to the dependency information and generates a second checkpoint that is saved in nonvolatile memory of the second computing device. Upon occurrence of a failure of the parent process, the child process reverts to a most recent checkpoint generated by the child process that does not include the effects of processing an orphan message.Type: GrantFiled: April 27, 2012Date of Patent: December 9, 2014Assignee: Hewlett-Packard Development Company, L. P.Inventors: Alan H. Karp, Dhruva Chakrabarti, Wojciech Golab, Terence P. Kelly
-
Patent number: 8909677Abstract: To access data, a distributed balanced tree having nodes distributed across plural servers is accessed. Version information is associated with the nodes of the distributed balanced tree. During an operation that accesses the distributed balanced tree, the version information is checked to determine whether content of one or more nodes of the distributed balanced tree has changed during the operation.Type: GrantFiled: April 27, 2007Date of Patent: December 9, 2014Assignee: Hewlett-Packard Development Company, L.P.Inventors: Marcos K. Aguilera, Wojciech Golab, Mehul A. Shah
-
Publication number: 20140310453Abstract: A shiftable memory supporting atomic operation employs built-in shifting capability to shift a contiguous subset of data from a first location to a second location within memory during an atomic operation. The shiftable memory includes the memory to store data. The memory has the built-in shifting capability. The shiftable memory further includes an atomic primitive defined on the memory to operate on the contiguous subset.Type: ApplicationFiled: October 27, 2011Publication date: October 16, 2014Inventors: Wojciech Golab, Matthew D. Picket, Alan H. Karp
-
Patent number: 8832050Abstract: A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.Type: GrantFiled: March 9, 2012Date of Patent: September 9, 2014Assignee: Hewlett-Packard Development Company, L.P.Inventors: Nathan L. Binkert, Wojciech Golab, Indrajit Roy, Mehul A. Shah, Benjamin A. Sowell
-
Patent number: 8738657Abstract: A computer apparatus and related method to reduce database congestion is provided. In one aspect, the computer apparatus and method may generate a new partition within a hierarchical data structure of interlinked nodes, if a distribution of key values stored in the hierarchical data structure is skewed in favor of a range of key values.Type: GrantFiled: September 27, 2011Date of Patent: May 27, 2014Assignee: Hewlett-Packard Development Company, L.P.Inventors: Harumi Kuno, Goetz Graefe, Wojciech Golab
-
Publication number: 20140040898Abstract: A system includes an initiator and processing nodes. The initiator distributes portions of a transaction among the processing nodes. Each processing node has at least one downstream neighbor to which the processing node sends commit messages. The commit messages include a commit status of the processing node. The downstream neighbor is also a processing node.Type: ApplicationFiled: July 31, 2012Publication date: February 6, 2014Inventors: Alan H. KARP, Wojciech GOLAB, Terence P. KELLY, Dhruva CHAKRABARTI
-
Publication number: 20140032504Abstract: Based on events corresponding to operations performed with respect to a data store, a measure is computed that represents an instantaneous consistency level, at a point in time, of data that is subject to the operations.Type: ApplicationFiled: July 30, 2012Publication date: January 30, 2014Inventors: Wojciech Golab, John Johnson Wylie
-
Patent number: 8589360Abstract: A method for verifying a consistency level in a key-value store, in which a value is stored in a cloud-based storage system comprising a read/write register identified by a key. At a centralized monitor node, a history of operations including writes and reads performed at the key is created, and a distance between a read of a value at the key and a latest write to the key is determined. It can then be ascertained whether the distance satisfies a relaxed atomicity property.Type: GrantFiled: December 12, 2011Date of Patent: November 19, 2013Assignee: Hewlett-Packard Development Company, L.P.Inventors: Xiaozhou Li, Wojciech Golab, Mehul A. Shah
-
Publication number: 20130290780Abstract: In one example, a method for implementing recovery segments includes sending an application message from a parent process executed by a first computing device to a child process executed by a second computing device and identifying a dependency created by the application message. This identified dependency is included in a dependence set of the child process and saved. A checkpoint is generated by the parent process and a checkpoint message that includes dependency information is sent from the parent process to the child process. The child process modifies the dependence set according to the dependency information and generates a second checkpoint that is saved in nonvolatile memory of the second computing device. Upon occurrence of a failure of the parent process, the child process reverts to a most recent checkpoint generated by the child process that does not include the effects of processing an orphan message.Type: ApplicationFiled: April 27, 2012Publication date: October 31, 2013Inventors: Alan H. Karp., Dhruva Chakrabarti, Wojciech Golab, Terence P. Kelly
-
Publication number: 20130238576Abstract: A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.Type: ApplicationFiled: March 9, 2012Publication date: September 12, 2013Inventors: Nathan L. Binkert, Wojciech Golab, Indrajit Roy, Mehul A. Shah, Benjamin A. Sowell
-
Publication number: 20130151478Abstract: A method for verifying a consistency level in a key-value store, in which a value is stored in a cloud-based storage system comprising a read/write register identified by a key. At a centralized monitor node, a history of operations including writes and reads performed at the key is created, and a distance between a read of a value at the key and a latest write to the key is determined. It can then be ascertained whether the distance satisfies a relaxed atomicity property.Type: ApplicationFiled: December 12, 2011Publication date: June 13, 2013Inventors: Xiaozhou Li, Wojciech Golab, Mehul A. Shah
-
Publication number: 20130110774Abstract: An embodiment provides a system and method for transaction commitment and replication. The method includes receiving a minitransaction from a client node at one or more memory nodes, wherein each memory node includes a number of replicas. The minitransaction is a type of transaction which atomically executes any combination of reading, comparing, and writing to any of a number of memory locations. The method also includes determining, for a leader of the replicas within a memory node, whether the leader is able to commit the minitransaction and stabilizing state changes of the minitransaction within a transaction log using a consensus procedure to update the replicas. The method further includes committing the minitransaction if, at each memory node, a quorum of the replicas is able to stabilize the minitransaction, or aborting the minitransaction otherwise.Type: ApplicationFiled: October 31, 2011Publication date: May 2, 2013Inventors: Mehul A. Shah, Wojciech Golab, Indrajit Roy, Nathan Lorenzo Binkert, Stavros Harizopoulos
-
Publication number: 20130110781Abstract: An embodiment provides a method for server replication and transaction commitment. The method includes receiving a transaction from a client node at one or more memory nodes, each memory node comprising a number of replicas, and determining, for each one of the replicas, whether the replica is able to commit the transaction. The method also includes sending a response from each of the replicas to a consensus node, wherein the consensus node is configured to record whether the response is a commit response. The method further includes committing the transaction if, at each memory node, a quorum of the replicas is able to commit the transaction, and aborting the transaction otherwise.Type: ApplicationFiled: October 31, 2011Publication date: May 2, 2013Inventors: Wojciech Golab, Nathan Lorenzo Binkert, Indrajit Roy, Mehul A. Shah, Bruce Walker
-
Publication number: 20130080473Abstract: A computer apparatus and related method to reduce database congestion is provided. In one aspect, the computer apparatus and method may generate a new partition within a hierarchical data structure of interlinked nodes, if a distribution of key values stored in the hierarchical data structure is skewed in favor of a range of key values.Type: ApplicationFiled: September 27, 2011Publication date: March 28, 2013Inventors: Harumi Kuno, Goetz Graefe, Wojciech Golab
-
Patent number: 7705512Abstract: A dynamoelectric machine conductor includes a bus including a central portion, a first connectable site of the central portion connectable with a first conductor and a first arm having a second electrically connectable site connectable with a second conductor. A first fused portion of the first arm located between the first connectable site and the second connectable site, the first fused portion being electrically interruptible to open a circuit between the first connectable site and the second connectable site. A second arm having a third connectable site connectable with a third conductor, and a second fused portion of the second arm located between the first connectable site and the third connectable site. The second fused portion being electrically interruptible to open a circuit between the first connectable site and the third connectable site.Type: GrantFiled: October 6, 2006Date of Patent: April 27, 2010Assignee: Remy International, Inc.Inventors: Wojciech Golab, Gustavo Sumcad