Patents by Inventor Peter Hochschild
Peter Hochschild 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: 11953938Abstract: The present technology proposes techniques for generating globally coherent timestamps. This technology may allow distributed systems to causally order transactions without incurring various types of communication delays inherent in explicit synchronization. By globally deploying a number of time masters that are based on various types of time references, the time masters may serve as primary time references. Through an interactive interface, the techniques may track, calculate and record data relative to each time master thus providing the distributed systems with causal timestamps.Type: GrantFiled: May 10, 2022Date of Patent: April 9, 2024Assignee: Google LLCInventors: Peter Hochschild, Alexander Lloyd, Wilson Cheng-Yi Hsieh, Robert Edman Felderman, Michael James Boyer Epstein
-
Publication number: 20240086327Abstract: The present disclosure provides for automatically detecting errors, such as SDC, in a multi-core computing environment. For example, cores may run in an error detection mode, in which multiple cores repeat the same execution of instructions and the results are compared. Based on the results, it may be determined whether one of the cores is failing.Type: ApplicationFiled: August 16, 2023Publication date: March 14, 2024Inventors: Balaram Sinharoy, Peter Hochschild
-
Patent number: 11789938Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.Type: GrantFiled: July 28, 2022Date of Patent: October 17, 2023Assignee: Google LLCInventors: Wilson Cheng-Yi Hsieh, Alexander Lloyd, Peter Hochschild, Michael James Boyer Epstein, Sean Quinlan
-
Publication number: 20230216921Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.Type: ApplicationFiled: February 24, 2023Publication date: July 6, 2023Inventors: Wilson Cheng-Yi Hsieh, Peter Hochschild
-
Patent number: 11601501Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.Type: GrantFiled: March 2, 2021Date of Patent: March 7, 2023Assignee: Google LLCInventors: Wilson Cheng-Yi Hsieh, Peter Hochschild
-
Patent number: 11442925Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.Type: GrantFiled: June 29, 2018Date of Patent: September 13, 2022Assignee: Google LLCInventors: Wilson Cheng-Yi Hsieh, Alexander Lloyd, Peter Hochschild, Michael James Boyer Epstein, Sean Quinlan
-
Patent number: 11353917Abstract: The present technology proposes techniques for generating globally coherent timestamps. This technology may allow distributed systems to causally order transactions without incurring various types of communication delays inherent in explicit synchronization. By globally deploying a number of time masters that are based on various types of time references, the time masters may serve as primary time references. Through an interactive interface, the techniques may track, calculate and record data relative to each time master thus providing the distributed systems with causal timestamps.Type: GrantFiled: August 13, 2020Date of Patent: June 7, 2022Assignee: Google LLCInventors: Peter Hochschild, Alexander Lloyd, Wilson Cheng-Yi Hsieh, Robert Edman Felderman, Michael James Boyer Epstein
-
Publication number: 20210185126Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.Type: ApplicationFiled: March 2, 2021Publication date: June 17, 2021Inventors: Wilson Cheng-Yi Hsieh, Peter Hochschild
-
Patent number: 10951706Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.Type: GrantFiled: December 9, 2016Date of Patent: March 16, 2021Assignee: Google LLCInventors: Wilson Cheng-Yi Hsieh, Peter Hochschild
-
Patent number: 10775837Abstract: The present technology proposes techniques for generating globally coherent timestamps. This technology may allow distributed systems to causally order transactions without incurring various types of communication delays inherent in explicit synchronization. By globally deploying a number of time masters that are based on various types of time references, the time masters may serve as primary time references. Through an interactive interface, the techniques may track, calculate and record data relative to each time master thus providing the distributed systems with causal timestamps.Type: GrantFiled: January 23, 2018Date of Patent: September 15, 2020Assignee: Google LLCInventors: Peter Hochschild, Alexander Lloyd, Wilson Cheng-Yi Hsieh, Robert Edman Felderman, Michael James Boyer Epstein
-
Patent number: 10042881Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.Type: GrantFiled: November 22, 2016Date of Patent: August 7, 2018Assignee: Google LLCInventors: Wilson Cheng-Yi Hsieh, Alexander Lloyd, Peter Hochschild, Michael James Boyer Epstein, Sean Quinlan
-
Publication number: 20180167460Abstract: Throughput is preserved in a distributed system while maintaining concurrency by pushing a commit wait period to client commit paths and to future readers. As opposed to servers performing commit waits, the servers assign timestamps, which are used to ensure that causality is preserved. When a server executes a transaction that writes data to a distributed database, the server acquires a user-level lock, and assigns the transaction a timestamp equal to a current time plus an interval corresponding to bounds of uncertainty of clocks in the distributed system. After assigning the timestamp, the server releases the user-level lock. Any client devices, before performing a read of the written data, must wait until the assigned timestamp is in the past.Type: ApplicationFiled: December 9, 2016Publication date: June 14, 2018Inventors: Wilson Cheng-Yi Hsieh, Peter Hochschild
-
Patent number: 9915970Abstract: The present technology proposes techniques for generating globally coherent timestamps. This technology may allow distributed systems to causally order transactions without incurring various types of communication delays inherent in explicit synchronization. By globally deploying a number of time masters that are based on various types of time references, the time masters may serve as primary time references. Through an interactive interface, the techniques may track, calculate and record data relative to each time master thus providing the distributed systems with causal timestamps.Type: GrantFiled: October 28, 2015Date of Patent: March 13, 2018Assignee: Google LLCInventors: Peter Hochschild, Alexander Lloyd, Wilson Cheng-Yi Hsieh, Robert Edman Felderman, Michael James Boyer Epstein
-
Patent number: 9569253Abstract: The present technology proposes techniques for ensuring globally consistent transactions. This technology may allow distributed systems to ensure the causal order of read and write transactions across different partitions of a distributed database. By assigning causally generated timestamps to the transactions based on one or more globally coherent time services, the timestamps can be used to preserve and represent the causal order of the transactions in the distributed system. In this regard, certain transactions may wait for a period of time after choosing a timestamp in order to delay the start of any second transaction that might depend on it. The wait may ensure that the effects of the first transaction are not made visible until its timestamp is guaranteed to be in the past. This may ensure that a consistent snapshot of the distributed database can be determined for any past timestamp.Type: GrantFiled: May 30, 2013Date of Patent: February 14, 2017Assignee: Google Inc.Inventors: Wilson Cheng-Yi Hsieh, Alexander Lloyd, Peter Hochschild, Michael James Boyer Epstein, Sean Quinlan
-
Patent number: 9203600Abstract: The present technology proposes techniques for generating globally coherent timestamps. This technology may allow distributed systems to causally order transactions without incurring various types of communication delays inherent in explicit synchronization. By globally deploying a number of time masters that are based on various types of time references, the time masters may serve as primary time references. Through an interactive interface, the techniques may track, calculate and record data relative to each time master thus providing the distributed systems with causal timestamps.Type: GrantFiled: December 11, 2014Date of Patent: December 1, 2015Assignee: Google Inc.Inventors: Peter Hochschild, Alexander Lloyd, Wilson Cheng-Yi Hsieh, Robert Edman Felderman, Michael James Boyer Epstein
-
Patent number: 8938636Abstract: The present technology proposes techniques for generating globally coherent timestamps. This technology may allow distributed systems to causally order transactions without incurring various types of communication delays inherent in explicit synchronization. By globally deploying a number of time masters that are based on various types of time references, the time masters may serve as primary time references. Through an interactive interface, the techniques may track, calculate and record data relative to each time master thus providing the distributed systems with causal timestamps.Type: GrantFiled: May 18, 2012Date of Patent: January 20, 2015Assignee: Google Inc.Inventors: Peter Hochschild, Alexander Lloyd, Wilson Cheng-Yi Hsieh, Robert Edman Felderman, Michael James Boyer Epstein
-
Patent number: 8605578Abstract: Systems and methods are provided for managing congestion at a destination host in a network. A transport layer system manages receive buffer for application processes running on the destination host. Upon receiving the first packet of a new message from a source host, the system determines if there is enough free space in the receive buffer at the destination host to be reserved for the entire message. The system allocates receive buffer for the entire message if there is enough free receive buffer space. If there is not enough free buffer space, the system drops the message and sends a negative acknowledgment to the source host. The source host pauses transmission to the destination host upon receiving the negative acknowledgment. The system sends a resume message to the source host when there is enough free buffer. The source host retransmits the dropped message upon receiving the resume message.Type: GrantFiled: May 25, 2011Date of Patent: December 10, 2013Assignee: Google Inc.Inventors: Rama K. Govindaraju, Peter Hochschild, Rajeev Sivaram, Sridhar Raman
-
Patent number: 8248930Abstract: A method, apparatus, and queuing engine implement congestion management. The method may include receiving, via a first interface of the apparatus, data traffic for forwarding to a node of a network. The method may also include receiving, at a second interface of the apparatus, a notification that indicates that congestion is affecting communication with the node, and responsive to the notification, accumulating the data traffic into the queue for a given time period. The method may further include dequeuing the data traffic from the queue after the given time period; and sending the portion of the data traffic to the node via the second interface.Type: GrantFiled: April 28, 2009Date of Patent: August 21, 2012Assignee: Google Inc.Inventors: Robert Edman Felderman, Roy M. Bannon, Peter Hochschild, Guenter Roeck, Hain-Ching Humphrey Liu
-
Patent number: 7774554Abstract: A system and method to provide injection of important data directly into a processor's cache location when that processor has previously indicated interest in the data. The memory subsystem at a target processor will determine if the memory address of data to be written to a memory location associated with the target processor is found in a processor cache of the target processor. If it is determined that the memory address is found in a target processor's cache, the data will be directly written to that cache at the same time that the data is being provided to a location in main memory.Type: GrantFiled: February 20, 2007Date of Patent: August 10, 2010Assignee: International Business Machines CorporationInventors: Piyush Chaudhary, Rama K. Govindaraju, Jay Robert Herring, Peter Hochschild, Chulho Kim, Rajeev Sivaram, Hanhong Xue
-
Publication number: 20090268612Abstract: A method, apparatus, and queuing engine implement congestion management. The method may include receiving, via a first interface of the apparatus, data traffic for forwarding to a node of a network. The method may also include receiving, at a second interface of the apparatus, a notification that indicates that congestion is affecting communication with the node, and responsive to the notification, accumulating the data traffic into the queue for a given time period. The method may further include dequeuing the data traffic from the queue after the given time period; and sending the portion of the data traffic to the node via the second interface.Type: ApplicationFiled: April 28, 2009Publication date: October 29, 2009Applicant: Google Inc.Inventors: Bob Felderman, Roy M. Bannon, Peter Hochschild, Guenter Roeck, Hain- Ching Humphrey Liu